Vasileios Nakos

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Targeted least cardinality candidate key for relational databases	2026-07-08	Paper
Fast n-fold Boolean convolution via additive combinatorics	2026-05-12	Paper
On the approximability of multistage min-sum set cover	2026-05-12	Paper
Deterministic sparse Fourier transform with an _ guarantee	2026-03-18	Paper
Predicting positive and negative links with noisy queries: theory \& practice Internet Mathematics	2025-10-21	Paper
Combinatorial group testing and sparse recovery schemes with near-optimal decoding time	2025-08-12	Paper
(Nearly) sample-optimal sparse Fourier transform in any dimension; RIPless and filterless	2025-08-12	Paper
Deterministic and Las Vegas algorithms for sparse nonnegative convolution	2024-07-19	Paper
Improved sublinear-time edit distance for preprocessed strings	2024-06-24	Paper
Traversing the FFT computation tree for dimension-independent sparse Fourier transforms	2024-05-14	Paper
Fast and simple modular subset sum	2024-05-14	Paper
scientific article; zbMATH DE number 7788446 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Almost-optimal sublinear-time edit distance in the low distance regime Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Sparse nonnegative convolution is equivalent to dense nonnegative convolution Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
Deterministic heavy hitters with sublinear query time (available as arXiv preprint)	2021-08-04	Paper
On low-risk heavy hitters and sparse recovery schemes (available as arXiv preprint)	2021-08-04	Paper
Improved algorithms for adaptive compressed sensing (available as arXiv preprint)	2021-07-28	Paper
Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
Nearly Optimal Sparse Polynomial Multiplication IEEE Transactions on Information Theory	2020-12-04	Paper
Sublinear-Time Algorithms for Compressive Phase Retrieval IEEE Transactions on Information Theory	2020-12-04	Paper
On fast decoding of high-dimensional signals from one-bit measurements (available as arXiv preprint)	2020-05-27	Paper
Stronger \(\ell_2/\ell_2\) compressed sensing; without iterating Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice	2017-09-19	Paper

Research outcomes over time

This page was built for person: Vasileios Nakos