Bio

I am a research computer scientist in RelationalAI as part of the Query Optimization team, working remotely from Athens, Greece. Before that, I was a postdoc position at Saarland University and Max Planck Institute for Informatics, generously funded by Karl Bringmann's ERC starting grant . Before that, I obtained by Ph.D. from Harvard University, advised by Prof. Jelani Nelson. Even before that, I completed my undergraduate studies at the National Technical University of Athens. You can contact me at vasileios.nakos AT relational.ai .

For general audience: In the theory of Algorithms and Computer Science, the most important venues are conferences and not journals. The most widely recognized and prestigious conferences in the field are FOCS (Foundations of Computer Science) and STOC (Symposium on the Theory of Computation), while the next most important conference is SODA.

Selected Papers

  1. Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime STOC 2022
    Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
  2. Deterministic and Las Vegas algorithms for Sparse Nonnegative Convolution SODA 2022
    Karl Bringmann, Nick Fischer, Vasileios Nakos
  3. Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution STOC 2021
    Karl Bringmann, Nick Fischer, Vasileios Nakos
  4. A Fine-Grained Perspective on Approximating Subset Sum and Partition SODA 2021
    Karl Bringmann, Vasileios Nakos
  5. Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time FOCS 2020
    Mahdi Cheraghchi, Vasileios Nakos
  6. Top-k Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum STOC 2020
    Karl Bringmann, Vasileios Nakos
  7. (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless FOCS 2019
    Vasileios Nakos, Zhao Song, Zhengyu Wang
  8. Stronger L2/L2 Compressed Sensing; Without Iterating. STOC 2019
    Vasileios Nakos, Zhao Song

Research Papers

(author names in alphabetical order, except where *)
  1. Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime STOC 2022
    Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
  2. Deterministic and Las Vegas algorithms for Sparse Nonnegative Convolution SODA 2022
    Karl Bringmann, Nick Fischer, Vasileios Nakos
  3. Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs
    Karl Bringmann, Michael Kapralov, Michael Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
  4. Fast n-fold Boolean Convolution via Additive Combinatorics ICALP 2021
    Karl Bringmann, Vasileios Nakos
  5. On the Approximability of Multistage Min-Sum Set Cover ICALP 2021
    Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
  6. Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution STOC 2021
    Karl Bringmann, Nick Fischer, Vasileios Nakos
  7. Fast and Simple Modular Subset Sum SOSA@SODA 2021
    Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
    (to be shared talk slot with this paper of Cardinal and Iacono)
  8. A Fine-Grained Perspective on Approximating Subset Sum and Partition SODA 2021
    Karl Bringmann, Vasileios Nakos
  9. Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time FOCS 2020
    Mahdi Cheraghchi, Vasileios Nakos
  10. Deterministic Sparse Fourier Transform with an L_infty Guarantee. ICALP 2020
    Yi Li, Vasileios Nakos
  11. Nearly Optimal Sparse Polynomial Multiplication. IEEE Trans. on Info Theory 2020
    Vasileios Nakos
  12. Sublinear-Time Algorithms for Compressive Phase Retrieval. IEEE Trans. on Info Theory 2020
    Preliminary version in ISIT 2018
    Yi Li, Vasileios Nakos
  13. Predicting Positive and Negative Links with Noisy Queries: Theory & Practice.(*) Internet Mathematics 2020
    Charalampos E. Tsourakakis, Michael Mitzenmacher, Kasper Green Larsen, Jarosław Błasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
  14. Top-k Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum STOC 2020
    Karl Bringmann, Vasileios Nakos
  15. (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless FOCS 2019
    Vasileios Nakos, Zhao Song, Zhengyu Wang
  16. Stronger L2/L2 Compressed Sensing; Without Iterating. STOC 2019
    Vasileios Nakos, Zhao Song
  17. One-Bit ExpanderSketch for One-Bit Compressed Sensing. ISIT 2019
    Vasileios Nakos
  18. Improved Algorithms for Adaptive Compressed Sensing ICALP 2018
    Vasileios Nakos, Xiaofei Shi, David Woodruff, Hongyang Zhang
  19. On Low-Risk Heavy Hitters and Sparse Recovery Schemes. RANDOM/APPROX 2018
    Yi Li, Vasileios Nakos, David Woodruff
  20. Deterministic Heavy Hitters with Sublinear Query Time. RANDOM/APPROX 2018
    Yi Li, Vasileios Nakos
  21. Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding Time.ISIT 2017
    Vasileios Nakos
  22. On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. ICALP 2017
    Vasileios Nakos