Get started
Author

Vasileios Nakos

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
2020 · Mahdi Cheraghchi, Vasileios Nakos · Annual Symposium on Foundations of Computer Science · 21
PDF
Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
2020 · Karl Bringmann, Vasileios Nakos · ACM Symposium on Theory of Computing (STOC) · 21
PDF
Nearly Optimal Sparse Polynomial Multiplication
2020 · Vasileios Nakos · IEEE Transactions on Information Theory · 21
PDF
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
2019 · Vasileios Nakos, Zhao Song, et al. · Annual Symposium on Foundations of Computer Science · 18
PDF
A Fine-Grained Perspective on Approximating Subset Sum and Partition
2021 · Karl Bringmann, Vasileios Nakos · Society for Industrial and Applied Mathematics eBooks · 16
PDF
Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay
2014 · Charalampos Konstantopoulos, Grammati Pantziou, et al. · ACM International Symposium on Mobility Management and Wireless Access (MobiWac) · 16
Stronger L 2 /L 2 compressed sensing; without iterating
2019 · Vasileios Nakos, Zhao Song · ACM Symposium on Theory of Computing (STOC) · 15
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
2020 · Charalampos Tsourakakis, Preetum Nakkiran, et al. · Internet Mathematics · 14
PDF
Improved Algorithms for Adaptive Compressed Sensing
2018 · Nakos, Vasileios, Shi, Xiaofei, et al. · arXiv (Cornell University) · 13
PDF
Join Size Bounds using l p -Norms on Degree Sequences
2024 · Mahmoud Abo Khamis, Vasileios Nakos, et al. · Proceedings of the ACM on Management of Data · 9
PDF
Sparse nonnegative convolution is equivalent to dense nonnegative convolution
2021 · Karl Bringmann, Nick Fischer, et al. · ACM Symposium on Theory of Computing (STOC) · 9
PDF
Fast $n$-fold Boolean Convolution via Additive Combinatorics
2021 · Bringmann, Karl, Nakos, Vasileios · arXiv (Cornell University) · 9
PDF
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution
2022 · Karl Bringmann, Nick Fischer, et al. · Society for Industrial and Applied Mathematics eBooks · 8
PDF
Fast and Simple Modular Subset Sum
2021 · Kyriakos Axiotis, Arturs Backurs, et al. · Society for Industrial and Applied Mathematics eBooks · 8
PDF
Almost optimal phaseless compressed sensing with sublinear decoding time
2017 · Vasileios Nakos · IEEE International Symposium on Information Theory (ISIT) · 8
PDF
Almost-optimal sublinear-time edit distance in the low distance regime
2022 · Karl Bringmann, Alejandro Cassis, et al. · ACM Symposium on Theory of Computing (STOC) · 6
PDF
Sublinear- Time Algorithms for Compressive Phase Retrieval
2018 · Yi Li, Vasileios Nakos · IEEE International Symposium on Information Theory (ISIT) · 6
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
2018 · Li, Yi, Nakos, Vasileios, et al. · DR-NTU (Nanyang Technological University) · 6
Improved Sublinear-Time Edit Distance for Preprocessed Strings
2022 · Bringmann, Karl, Cassis, Alejandro, et al. · arXiv (Cornell University) · 5
PDF
Join Size Bounds using Lp-Norms on Degree Sequences
2023 · Khamis, Mahmoud Abo, Nakos, Vasileios, et al. · arXiv (Cornell University) · 4
PDF
Stronger L2/L2 Compressed Sensing; Without Iterating
2019 · Nakos, Vasileios, Song, Zhao · arXiv (Cornell University) · 4
PDF
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
2017 · Li, Yi, Nakos, Vasileios, et al. · arXiv (Cornell University) · 4
PDF
Deterministic Sparse Fourier Transform with an _{∞} Guarantee
2020 · Yi Li, Vasileios Nakos · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 3
PDF
Deterministic Heavy Hitters with Sublinear Query Time
2017 · Li, Yi, Nakos, Vasileios · arXiv (Cornell University) · 3
PDF
On Fast Decoding of High Dimensional Signals from One-Bit Measurements
2016 · Nakos, Vasileios · arXiv (Cornell University) · 3
PDF
Works count: 47
Citation count: 264
H-index: 9
I10-index: 9
Year
Topic
Type