| 2026 | ESA | Robustifying Sparse Matrix Multiplication. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2025 | FOCS | ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling. | Nick Fischer, Vasileios Nakos |
| 2025 | ICDT | Targeted Least Cardinality Candidate Key for Relational Databases. | Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis |
| 2025 | SODA | Beating Bellman's Algorithm for Subset Sum. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2023 | SODA | Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. | Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh |
| 2022 | ICALP | Improved Sublinear-Time Edit Distance for Preprocessed Strings. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2022 | ISIT | On (1 + ϵ)-Approximate Block Sparse Recovery. | Baris Can Esmer, Vasileios Nakos |
| 2022 | SODA | Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2022 | STOC | Almost-optimal sublinear-time edit distance in the low distance regime. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2021 | ICALP | Fast n-Fold Boolean Convolution via Additive Combinatorics. | Karl Bringmann, Vasileios Nakos |
| 2021 | ICALP | On the Approximability of Multistage Min-Sum Set Cover. | Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis |
| 2021 | SODA | A Fine-Grained Perspective on Approximating Subset Sum and Partition. | Karl Bringmann, Vasileios Nakos |
| 2021 | STOC | Sparse nonnegative convolution is equivalent to dense nonnegative convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2020 | FOCS | Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. | Mahdi Cheraghchi, Vasileios Nakos |
| 2020 | ICALP | Deterministic Sparse Fourier Transform with an ℓ | Yi Li, Vasileios Nakos |
| 2020 | STOC | Top-k-convolution and the quest for near-linear output-sensitive subset sum. | Karl Bringmann, Vasileios Nakos |
| 2019 | FOCS | (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. | Vasileios Nakos, Zhao Song, Zhengyu Wang |
| 2019 | ISIT | One-Bit ExpanderSketch for One-Bit Compressed Sensing. | Vasileios Nakos |
| 2019 | STOC | Stronger l | Vasileios Nakos, Zhao Song |
| 2018 | ICALP | Improved Algorithms for Adaptive Compressed Sensing. | Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang |
| 2018 | ISIT | Sublinear- Time Algorithms for Compressive Phase Retrieval. | Yi Li, Vasileios Nakos |
| 2017 | ICALP | On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. | Vasileios Nakos |
| 2017 | ISIT | Almost optimal phaseless compressed sensing with sublinear decoding time. | Vasileios Nakos |