- (
**Sparse Fourier Transform**) Under which structural assumptions and under which error guarantees can we design algorithms that outperform the Fast Fourier Transform? - (
**Compressed Sensing/ Linear Sketching**) Rapidly compress a very long vector, such that a fine approximation of it can be recovered very fast given its compressed form. In each possible scenario, how many bits do you need to compress, and how fast the compression, decompression algorithms can be? - (
**Additive Combinatorics-Inspired Algorithms**) For problems like Subset Sum, Knapsack, (any sort of) convolution, how can we exploit the underlying additive structure to design faster algorithms?

- Top-k Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum (Under Submission)

Karl Bringmann, Vasileios Nakos - Fast n-fold Boolean Convolution via Additive Combinatorics (Under Submission)

Karl Bringmann, Vasileios Nakos - Deterministic Sparse Fourier Transform with an L_infty Guarantee.

Yi Li, Vasileios Nakos - Combinatorial Group Testing Schemes with Nearly Optimal Decoding Time.

Vasileios Nakos - Robust Sparse Recovery via Huber and Tukey loss

Vasileios Nakos, Zhao Song, Zhengyu Wang - Nearly Optimal Sparse Polynomial Multiplication.

Vasileios Nakos - (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
**FOCS 2019**

Vasileios Nakos, Zhao Song, Zhengyu Wang - One-Bit ExpanderSketch for One-Bit Compressed Sensing.
**ISIT 2019**

Vasileios Nakos - Stronger L2/L2 Compressed Sensing; Without Iterating.
**STOC 2019**

Vasileios Nakos, Zhao Song - Predicting Positive and Negative Links with Noisy Queries: Theory & Practice.(*)
**Allerton 2018**

Charalampos E. Tsourakakis, Michael Mitzenmacher, Kasper Green Larsen, Jarosław Błasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos - Improved Algorithms for Adaptive Compressed Sensing
**ICALP 2018**

Vasileios Nakos, Xiaofei Shi, David Woodruff, Hongyang Zhang - On Low-Risk Heavy Hitters and Sparse Recovery Schemes.
**RANDOM/APPROX 2018**

Yi Li, Vasileios Nakos, David Woodruff - Deterministic Heavy Hitters with Sublinear Query Time.
**RANDOM/APPROX 2018**

Yi Li, Vasileios Nakos - Sublinear-Time Algorithms for Compressive Phase Retrieval.
**ISIT 2018**

Yi Li, Vasileios Nakos - Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding Time.
**ISIT 2017**

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

Vasileios Nakos

© Vasileios Nakos 2017