Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay. - Charalampos Konstantopoulos; Grammati E. Pantziou; Nikolaos Vathis; Vasileios Nakos; Damianos Gavalas (MOBIWAC, 2014)

On Fast Decoding of Noiseless Signals from One-Bit or Phaseless Measurements. - Vasileios Nakos (CoRR, 2016)

On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. - Vasileios Nakos (ICALP, 2017)

Almost optimal phaseless compressed sensing with sublinear decoding time. - Vasileios Nakos (ISIT, 2017)

Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. - Charalampos E. Tsourakakis; Michael Mitzenmacher; Jaroslaw Blasiok; Ben Lawson; Preetum Nakkiran; Vasileios Nakos (CoRR, 2017)

Deterministic Heavy Hitters with Sublinear Query Time. - Yi Li 002; Vasileios Nakos (APPROX-RANDOM, 2018)

On Low-Risk Heavy Hitters and Sparse Recovery Schemes. - Yi Li 002; Vasileios Nakos; David P. Woodruff (APPROX-RANDOM, 2018)

Improved Algorithms for Adaptive Compressed Sensing. - Vasileios Nakos; Xiaofei Shi; David P. Woodruff; Hongyang Zhang 001 (ICALP, 2018)

(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. - Vasileios Nakos; Zhao Song 002; Zhengyu Wang (FOCS, 2019)

One-Bit ExpanderSketch for One-Bit Compressed Sensing. - Vasileios Nakos (ISIT, 2019)

Stronger l2/l2 compressed sensing; without iterating. - Vasileios Nakos; Zhao Song 002 (STOC, 2019)

Deterministic Sparse Fourier Transform with an ell_infty Guarantee. - Yi Li 002; Vasileios Nakos (CoRR, 2019)

Stronger L2/L2 Compressed Sensing; Without Iterating. - Vasileios Nakos; Zhao Song 002 (CoRR, 2019)

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. - Mahdi Cheraghchi; Vasileios Nakos (FOCS, 2020)

Deterministic Sparse Fourier Transform with an ℓ∞ Guarantee. - Yi Li 002; Vasileios Nakos (ICALP, 2020)

Top-k-convolution and the quest for near-linear output-sensitive subset sum. - Karl Bringmann; Vasileios Nakos (STOC, 2020)

Sublinear-Time Algorithms for Compressive Phase Retrieval. - Yi Li 002; Vasileios Nakos (IEEE Trans. Inf. Theory, 2020)

Nearly Optimal Sparse Polynomial Multiplication. - Vasileios Nakos (IEEE Trans. Inf. Theory, 2020)

Fast n-Fold Boolean Convolution via Additive Combinatorics. - Karl Bringmann; Vasileios Nakos (ICALP, 2021)

On the Approximability of Multistage Min-Sum Set Cover. - Dimitris Fotakis 001; Panagiotis Kostopanagiotis; Vasileios Nakos; Georgios Piliouras; Stratis Skoulakis (ICALP, 2021)

A Fine-Grained Perspective on Approximating Subset Sum and Partition. - Karl Bringmann; Vasileios Nakos (SODA, 2021)

Fast and Simple Modular Subset Sum. - Kyriakos Axiotis; Arturs Backurs; Karl Bringmann; Ce Jin 001; Vasileios Nakos; Christos Tzamos; Hongxun Wu (SOSA, 2021)

Sparse nonnegative convolution is equivalent to dense nonnegative convolution. - Karl Bringmann; Nick Fischer; Vasileios Nakos (STOC, 2021)

Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs. - Karl Bringmann; Michael Kapralov; Mikhail Makarov; Vasileios Nakos; Amir Yagudin; Amir Zandieh (CoRR, 2021)

Improved Sublinear-Time Edit Distance for Preprocessed Strings. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Vasileios Nakos (ICALP, 2022)

On (1 + ϵ)-Approximate Block Sparse Recovery. - Baris Can Esmer; Vasileios Nakos (ISIT, 2022)

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. - Karl Bringmann; Nick Fischer; Vasileios Nakos (SODA, 2022)

Almost-optimal sublinear-time edit distance in the low distance regime. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Vasileios Nakos (STOC, 2022)

Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. - Karl Bringmann; Michael Kapralov; Mikhail Makarov; Vasileios Nakos; Amir Yagudin; Amir Zandieh (SODA, 2023)

Join Size Bounds using Lp-Norms on Degree Sequences. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (CoRR, 2023)

Join Size Bounds using lp-Norms on Degree Sequences. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (Proc. ACM Manag. Data, 2024)

Targeted Least Cardinality Candidate Key for Relational Databases. - Vasileios Nakos; Hung Q. Ngo 001; Charalampos E. Tsourakakis (ICDT, 2025)

Beating Bellman's Algorithm for Subset Sum. - Karl Bringmann; Nick Fischer; Vasileios Nakos (SODA, 2025)

Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (SIGMOD Rec., 2025)