default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasileios Nakos
Person information
- affiliation: Saarland University, Saarbrücken, Germany
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation: Harvard University, Cambridge, MA, USA
- affiliation: National Technical University of Athens, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Mahmoud Abo Khamis
, Vasileios Nakos, Dan Olteanu, Dan Suciu:
Join Size Bounds using lp-Norms on Degree Sequences. Proc. ACM Manag. Data 2(2): 96 (2024)- [i24]Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis:
Targeted Least Cardinality Candidate Key for Relational Databases. CoRR abs/2408.13540 (2024) - 2023
- [c23]Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh:
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. SODA 2023: 4768-4845 - [i23]Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
Join Size Bounds using Lp-Norms on Degree Sequences. CoRR abs/2306.14075 (2023) - 2022
- [c22]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Improved Sublinear-Time Edit Distance for Preprocessed Strings. ICALP 2022: 32:1-32:20 - [c21]Baris Can Esmer, Vasileios Nakos:
On (1 + ϵ)-Approximate Block Sparse Recovery. ISIT 2022: 1815-1820 - [c20]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. SODA 2022: 3069-3090 - [c19]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Almost-optimal sublinear-time edit distance in the low distance regime. STOC 2022: 1102-1115 - [i22]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. CoRR abs/2202.08066 (2022) - [i21]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Improved Sublinear-Time Edit Distance for Preprocessed Strings. CoRR abs/2204.14137 (2022) - 2021
- [c18]Karl Bringmann, Vasileios Nakos:
Fast n-Fold Boolean Convolution via Additive Combinatorics. ICALP 2021: 41:1-41:17 - [c17]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. ICALP 2021: 65:1-65:19 - [c16]Karl Bringmann, Vasileios Nakos:
A Fine-Grained Perspective on Approximating Subset Sum and Partition. SODA 2021: 1797-1815 - [c15]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [c14]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Sparse nonnegative convolution is equivalent to dense nonnegative convolution. STOC 2021: 1711-1724 - [i20]Karl Bringmann, Vasileios Nakos:
Fast n-fold Boolean Convolution via Additive Combinatorics. CoRR abs/2105.03968 (2021) - [i19]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution. CoRR abs/2105.05984 (2021) - [i18]Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh:
Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs. CoRR abs/2107.07347 (2021) - [i17]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. CoRR abs/2107.07625 (2021) - [i16]Karl Bringmann, Vasileios Nakos:
Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum. CoRR abs/2107.13206 (2021) - [i15]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. CoRR abs/2107.13344 (2021) - 2020
- [j2]Vasileios Nakos:
Nearly Optimal Sparse Polynomial Multiplication. IEEE Trans. Inf. Theory 66(11): 7231-7236 (2020) - [j1]Yi Li, Vasileios Nakos:
Sublinear-Time Algorithms for Compressive Phase Retrieval. IEEE Trans. Inf. Theory 66(11): 7302-7310 (2020) - [c13]Mahdi Cheraghchi, Vasileios Nakos:
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. FOCS 2020: 1203-1213 - [c12]Yi Li, Vasileios Nakos:
Deterministic Sparse Fourier Transform with an ℓ∞ Guarantee. ICALP 2020: 77:1-77:14 - [c11]Karl Bringmann, Vasileios Nakos:
Top-k-convolution and the quest for near-linear output-sensitive subset sum. STOC 2020: 982-995 - [i14]Mahdi Cheraghchi, Vasileios Nakos:
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. CoRR abs/2006.08420 (2020) - [i13]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020)
2010 – 2019
- 2019
- [c10]Vasileios Nakos, Zhao Song, Zhengyu Wang:
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. FOCS 2019: 1568-1577 - [c9]Vasileios Nakos:
One-Bit ExpanderSketch for One-Bit Compressed Sensing. ISIT 2019: 2853-2857 - [c8]Vasileios Nakos, Zhao Song:
Stronger l2/l2 compressed sensing; without iterating. STOC 2019: 289-297 - [i12]Vasileios Nakos:
Nearly Optimal Sparse Polynomial Multiplication. CoRR abs/1901.09355 (2019) - [i11]Yi Li, Vasileios Nakos:
Deterministic Sparse Fourier Transform with an ell_infty Guarantee. CoRR abs/1903.00995 (2019) - [i10]Vasileios Nakos, Zhao Song:
Stronger L2/L2 Compressed Sensing; Without Iterating. CoRR abs/1903.02742 (2019) - [i9]Vasileios Nakos, Zhao Song, Zhengyu Wang:
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. CoRR abs/1909.11123 (2019) - 2018
- [c7]Yi Li, Vasileios Nakos:
Deterministic Heavy Hitters with Sublinear Query Time. APPROX-RANDOM 2018: 18:1-18:18 - [c6]Yi Li, Vasileios Nakos, David P. Woodruff:
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. APPROX-RANDOM 2018: 19:1-19:13 - [c5]Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang:
Improved Algorithms for Adaptive Compressed Sensing. ICALP 2018: 90:1-90:14 - [c4]Yi Li, Vasileios Nakos:
Sublinear- Time Algorithms for Compressive Phase Retrieval. ISIT 2018: 2301-2305 - [i8]Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang:
Improved Algorithms for Adaptive Compressed Sensing. CoRR abs/1804.09673 (2018) - 2017
- [c3]Vasileios Nakos:
On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. ICALP 2017: 61:1-61:14 - [c2]Vasileios Nakos:
Almost optimal phaseless compressed sensing with sublinear decoding time. ISIT 2017: 1142-1146 - [i7]Vasileios Nakos:
Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding Time. CoRR abs/1701.06437 (2017) - [i6]Yi Li, Vasileios Nakos:
Sublinear-Time Algorithms for Compressive Phase Retrieval. CoRR abs/1709.02917 (2017) - [i5]Yi Li, Vasileios Nakos, David P. Woodruff:
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. CoRR abs/1709.02919 (2017) - [i4]Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos:
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR abs/1709.07308 (2017) - [i3]Vasileios Nakos:
One-Bit ExpanderSketch for One-Bit Compressed Sensing. CoRR abs/1711.04049 (2017) - [i2]Yi Li, Vasileios Nakos:
Deterministic Heavy Hitters with Sublinear Query Time. CoRR abs/1712.01971 (2017) - 2016
- [i1]Vasileios Nakos:
On Fast Decoding of Noiseless Signals from One-Bit or Phaseless Measurements. CoRR abs/1603.08585 (2016) - 2014
- [c1]Charalampos Konstantopoulos, Grammati E. Pantziou, Nikolaos Vathis, Vasileios Nakos, Damianos Gavalas:
Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay. MOBIWAC 2014: 47-54
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
