Vasileios Nakos

57 papers A* 17A 1B 4Journal 31Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Beating Bellman's Algorithm for Subset Sum. SODA Karl Bringmann, Nick Fischer, Vasileios Nakos
2025	J	`jnl`	Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation. CoRR Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu
2025	J	`jnl`	Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation. SIGMOD Rec. Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu
2025	A	`conf`	Targeted Least Cardinality Candidate Key for Relational Databases. ICDT Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
2025	J	`jnl`	ℓ CoRR Nick Fischer, Vasileios Nakos
2025	A*	`conf`	ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling. FOCS Nick Fischer, Vasileios Nakos
2024	J	`jnl`	Beating Bellman's Algorithm for Subset Sum. CoRR Karl Bringmann, Nick Fischer, Vasileios Nakos
2024	J	`jnl`	Join Size Bounds using l Proc. ACM Manag. Data Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu
2024	J	`jnl`	Targeted Least Cardinality Candidate Key for Relational Databases. CoRR Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
2023	J	`jnl`	Join Size Bounds using Lp-Norms on Degree Sequences. CoRR Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu
2023	A*	`conf`	Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. SODA Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
2022	J	`jnl`	Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. CoRR Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022	A*	`conf`	Almost-optimal sublinear-time edit distance in the low distance regime. STOC Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022	A*	`conf`	Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. SODA Karl Bringmann, Nick Fischer, Vasileios Nakos
2022	A*	`conf`	Improved Sublinear-Time Edit Distance for Preprocessed Strings. ICALP Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022	J	`jnl`	Improved Sublinear-Time Edit Distance for Preprocessed Strings. CoRR Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022	B	`conf`	On (1 + ϵ)-Approximate Block Sparse Recovery. ISIT Baris Can Esmer, Vasileios Nakos
2021	A*	`conf`	A Fine-Grained Perspective on Approximating Subset Sum and Partition. SODA Karl Bringmann, Vasileios Nakos
2021	J	`jnl`	Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. CoRR Karl Bringmann, Nick Fischer, Vasileios Nakos
2021	—	`conf`	Fast and Simple Modular Subset Sum. SOSA Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
2021	A*	`conf`	Fast n-Fold Boolean Convolution via Additive Combinatorics. ICALP Karl Bringmann, Vasileios Nakos
2021	J	`jnl`	Fast n-fold Boolean Convolution via Additive Combinatorics. CoRR Karl Bringmann, Vasileios Nakos
2021	A*	`conf`	On the Approximability of Multistage Min-Sum Set Cover. ICALP Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
2021	J	`jnl`	On the Approximability of Multistage Min-Sum Set Cover. CoRR Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
2021	J	`jnl`	Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs. CoRR Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
2021	J	`jnl`	Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution. CoRR Karl Bringmann, Nick Fischer, Vasileios Nakos
2021	A*	`conf`	Sparse nonnegative convolution is equivalent to dense nonnegative convolution. STOC Karl Bringmann, Nick Fischer, Vasileios Nakos
2021	J	`jnl`	Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum. CoRR Karl Bringmann, Vasileios Nakos
2020	A*	`conf`	Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. FOCS Mahdi Cheraghchi, Vasileios Nakos
2020	J	`jnl`	Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. CoRR Mahdi Cheraghchi, Vasileios Nakos
2020	A*	`conf`	Deterministic Sparse Fourier Transform with an ℓ ICALP Yi Li, Vasileios Nakos
2020	J	`jnl`	Fast and Simple Modular Subset Sum. CoRR Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
2020	J	`jnl`	Nearly Optimal Sparse Polynomial Multiplication. IEEE Trans. Inf. Theory Vasileios Nakos
2020	J	`jnl`	Sublinear-Time Algorithms for Compressive Phase Retrieval. IEEE Trans. Inf. Theory Yi Li, Vasileios Nakos
2020	A*	`conf`	Top-k-convolution and the quest for near-linear output-sensitive subset sum. STOC Karl Bringmann, Vasileios Nakos
2019	A*	`conf`	(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. FOCS Vasileios Nakos, Zhao Song, Zhengyu Wang
2019	J	`jnl`	(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. CoRR Vasileios Nakos, Zhao Song, Zhengyu Wang
2019	J	`jnl`	Deterministic Sparse Fourier Transform with an ell_infty Guarantee. CoRR Yi Li, Vasileios Nakos
2019	J	`jnl`	Nearly Optimal Sparse Polynomial Multiplication. CoRR Vasileios Nakos
2019	B	`conf`	One-Bit ExpanderSketch for One-Bit Compressed Sensing. ISIT Vasileios Nakos
2019	J	`jnl`	Stronger L2/L2 Compressed Sensing; Without Iterating. CoRR Vasileios Nakos, Zhao Song
2019	A*	`conf`	Stronger l STOC Vasileios Nakos, Zhao Song
2018	—	`conf`	Deterministic Heavy Hitters with Sublinear Query Time. APPROX-RANDOM Yi Li, Vasileios Nakos
2018	A*	`conf`	Improved Algorithms for Adaptive Compressed Sensing. ICALP Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang
2018	J	`jnl`	Improved Algorithms for Adaptive Compressed Sensing. CoRR Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang
2018	—	`conf`	On Low-Risk Heavy Hitters and Sparse Recovery Schemes. APPROX-RANDOM Yi Li, Vasileios Nakos, David P. Woodruff
2018	B	`conf`	Sublinear- Time Algorithms for Compressive Phase Retrieval. ISIT Yi Li, Vasileios Nakos
2017	J	`jnl`	Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding Time. CoRR Vasileios Nakos
2017	B	`conf`	Almost optimal phaseless compressed sensing with sublinear decoding time. ISIT Vasileios Nakos
2017	J	`jnl`	Deterministic Heavy Hitters with Sublinear Query Time. CoRR Yi Li, Vasileios Nakos
2017	A*	`conf`	On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. ICALP Vasileios Nakos
2017	J	`jnl`	On Low-Risk Heavy Hitters and Sparse Recovery Schemes. CoRR Yi Li, Vasileios Nakos, David P. Woodruff
2017	J	`jnl`	One-Bit ExpanderSketch for One-Bit Compressed Sensing. CoRR Vasileios Nakos
2017	J	`jnl`	Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
2017	J	`jnl`	Sublinear-Time Algorithms for Compressive Phase Retrieval. CoRR Yi Li, Vasileios Nakos
2016	J	`jnl`	On Fast Decoding of Noiseless Signals from One-Bit or Phaseless Measurements. CoRR Vasileios Nakos
2014	—	`conf`	Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay. MOBIWAC Charalampos Konstantopoulos, Grammati E. Pantziou, Nikolaos Vathis, Vasileios Nakos, Damianos Gavalas