Vasileios Nakos
Orcid: 0000-0003-2703-2750Affiliations:
- Saarland University, Saarbrücken, Germany
- Max Planck Institute for Informatics, Saarbrücken, Germany
- Harvard University, Cambridge, MA, USA
- National Technical University of Athens, Greece
According to our database1,
Vasileios Nakos
authored at least 33 papers
between 2014 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Proc. ACM Manag. Data, 2024
2023
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
IEEE Trans. Inf. Theory, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the Approximation, 2018
Proceedings of the Approximation, 2018
2017
CoRR, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
CoRR, 2016
2014
Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay.
Proceedings of the MobiWac'14, 2014