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 | 32 | 2021 |
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 | 32 | 2020 |
Nearly optimal sparse polynomial multiplication V Nakos IEEE Transactions on Information Theory 66 (11), 7231-7236, 2020 | 28 | 2020 |
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 | 25 | 2020 |
Improved algorithms for adaptive compressed sensing V Nakos, X Shi, DP Woodruff, H Zhang arXiv preprint arXiv:1804.09673, 2018 | 25 | 2018 |
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 | 23 | 2022 |
Stronger L2/L2 compressed sensing; without iterating V Nakos, Z Song Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 23 | 2019 |
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 | 21 | 2021 |
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 | 20 | 2014 |
Fast -fold Boolean Convolution via Additive Combinatorics K Bringmann, V Nakos arXiv preprint arXiv:2105.03968, 2021 | 16 | 2021 |
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 | 16 | 2017 |
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 | 15 | 2021 |
On low-risk heavy hitters and sparse recovery schemes Y Li, V Nakos, D Woodruff arXiv preprint arXiv:1709.02919, 2017 | 14 | 2017 |
(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 | 13 | 2019 |
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 | 12 | 2022 |
Improved sublinear-time edit distance for preprocessed strings K Bringmann, A Cassis, N Fischer, V Nakos arXiv preprint arXiv:2204.14137, 2022 | 10 | 2022 |
Sublinear-time algorithms for compressive phase retrieval Y Li, V Nakos IEEE Transactions on Information Theory 66 (11), 7302-7310, 2020 | 8 | 2020 |
Join size bounds using lp-norms on degree sequences MA Khamis, V Nakos, D Olteanu, D Suciu arXiv preprint arXiv:2306.14075, 2023 | 7 | 2023 |
Private link prediction in social networks R Abebe, V Nakos Harvard Univ., Cambridge, MA, USA, Tech. Rep, 2014 | 6 | 2014 |
Deterministic Sparse Fourier Transform with an 𝓁_ {∞} Guarantee Y Li, V Nakos 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 4 | 2020 |