Follow
Vasileios Nakos
Vasileios Nakos
Relational AI
No verified email - Homepage
Title
Cited by
Cited by
Year
A fine-grained perspective on approximating subset sum and partition
K Bringmann, V Nakos
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
322021
Combinatorial group testing and sparse recovery schemes with near-optimal decoding time
M Cheraghchi, V Nakos
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
322020
Nearly optimal sparse polynomial multiplication
V Nakos
IEEE Transactions on Information Theory 66 (11), 7231-7236, 2020
282020
Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
K Bringmann, V Nakos
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
252020
Improved algorithms for adaptive compressed sensing
V Nakos, X Shi, DP Woodruff, H Zhang
arXiv preprint arXiv:1804.09673, 2018
252018
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution∗
K Bringmann, N Fischer, V Nakos
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
232022
Stronger L2/L2 compressed sensing; without iterating
V Nakos, Z Song
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
232019
Sparse nonnegative convolution is equivalent to dense nonnegative convolution
K Bringmann, N Fischer, V Nakos
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
212021
Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay
C Konstantopoulos, G Pantziou, N Vathis, V Nakos, D Gavalas
Proceedings of the 12th ACM international symposium on Mobility management …, 2014
202014
Fast -fold Boolean Convolution via Additive Combinatorics
K Bringmann, V Nakos
arXiv preprint arXiv:2105.03968, 2021
162021
Predicting positive and negative links with noisy queries: Theory & practice
CE Tsourakakis, M Mitzenmacher, KG Larsen, J Błasiok, B Lawson, ...
arXiv preprint arXiv:1709.07308, 2017
162017
Fast and Simple Modular Subset Sum∗
K Axiotis, A Backurs, K Bringmann, C Jin, V Nakos, C Tzamos, H Wu
Symposium on Simplicity in Algorithms (SOSA), 57-67, 2021
152021
On low-risk heavy hitters and sparse recovery schemes
Y Li, V Nakos, D Woodruff
arXiv preprint arXiv:1709.02919, 2017
142017
(Nearly) Sample-optimal sparse Fourier transform in any dimension; RIPless and Filterless
V Nakos, Z Song, Z Wang
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
132019
Almost-optimal sublinear-time edit distance in the low distance regime
K Bringmann, A Cassis, N Fischer, V Nakos
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
122022
Improved sublinear-time edit distance for preprocessed strings
K Bringmann, A Cassis, N Fischer, V Nakos
arXiv preprint arXiv:2204.14137, 2022
102022
Sublinear-time algorithms for compressive phase retrieval
Y Li, V Nakos
IEEE Transactions on Information Theory 66 (11), 7302-7310, 2020
82020
Join size bounds using lp-norms on degree sequences
MA Khamis, V Nakos, D Olteanu, D Suciu
arXiv preprint arXiv:2306.14075, 2023
72023
Private link prediction in social networks
R Abebe, V Nakos
Harvard Univ., Cambridge, MA, USA, Tech. Rep, 2014
62014
Deterministic Sparse Fourier Transform with an 𝓁_ {∞} Guarantee
Y Li, V Nakos
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
42020
The system can't perform the operation now. Try again later.
Articles 1–20