Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Vasileios Nakos
@inproceedings{DBLP:conf/soda/BringmannKMNYZ23,
author = {Karl Bringmann and
Michael Kapralov and
Mikhail Makarov and
Vasileios Nakos and
Amir Yagudin and
Amir Zandieh},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Traversing the {FFT} Computation Tree for Dimension-Independent Sparse
Fourier Transforms},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4768--4845},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch177},
doi = {10.1137/1.9781611977554.CH177},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannKMNYZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-14075,
author = {Mahmoud Abo Khamis and
Vasileios Nakos and
Dan Olteanu and
Dan Suciu},
title = {Join Size Bounds using Lp-Norms on Degree Sequences},
journal = {CoRR},
volume = {abs/2306.14075},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.14075},
doi = {10.48550/ARXIV.2306.14075},
eprinttype = {arXiv},
eprint = {2306.14075},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-14075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannCFN22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Improved Sublinear-Time Edit Distance for Preprocessed Strings},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {32:1--32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.32},
doi = {10.4230/LIPICS.ICALP.2022.32},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannCFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/EsmerN22,
author = {Baris Can Esmer and
Vasileios Nakos},
title = {On {(1} + {\unicode{1013}})-Approximate Block Sparse Recovery},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2022,
Espoo, Finland, June 26 - July 1, 2022},
pages = {1815--1820},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ISIT50566.2022.9834705},
doi = {10.1109/ISIT50566.2022.9834705},
timestamp = {Mon, 08 Aug 2022 16:44:13 +0200},
biburl = {https://dblp.org/rec/conf/isit/EsmerN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannFN22,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3069--3090},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.119},
doi = {10.1137/1.9781611977073.119},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannCFN22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Almost-optimal sublinear-time edit distance in the low distance regime},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1102--1115},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519990},
doi = {10.1145/3519935.3519990},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannCFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08066,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
title = {Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime},
journal = {CoRR},
volume = {abs/2202.08066},
year = {2022},
url = {https://arxiv.org/abs/2202.08066},
eprinttype = {arXiv},
eprint = {2202.08066},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-14137,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
title = {Improved Sublinear-Time Edit Distance for Preprocessed Strings},
journal = {CoRR},
volume = {abs/2204.14137},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.14137},
doi = {10.48550/ARXIV.2204.14137},
eprinttype = {arXiv},
eprint = {2204.14137},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-14137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannN21,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Fast n-Fold Boolean Convolution via Additive Combinatorics},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {41:1--41:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.41},
doi = {10.4230/LIPICS.ICALP.2021.41},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BringmannN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FotakisKNPS21,
author = {Dimitris Fotakis and
Panagiotis Kostopanagiotis and
Vasileios Nakos and
Georgios Piliouras and
Stratis Skoulakis},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {On the Approximability of Multistage Min-Sum Set Cover},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {65:1--65:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.65},
doi = {10.4230/LIPICS.ICALP.2021.65},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FotakisKNPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannN21,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {D{\'{a}}niel Marx},
title = {A Fine-Grained Perspective on Approximating Subset Sum and Partition},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1797--1815},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.108},
doi = {10.1137/1.9781611976465.108},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AxiotisBBJNTW21,
author = {Kyriakos Axiotis and
Arturs Backurs and
Karl Bringmann and
Ce Jin and
Vasileios Nakos and
Christos Tzamos and
Hongxun Wu},
editor = {Hung Viet Le and
Valerie King},
title = {Fast and Simple Modular Subset Sum},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {57--67},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.6},
doi = {10.1137/1.9781611976496.6},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AxiotisBBJNTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannFN21,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sparse nonnegative convolution is equivalent to dense nonnegative
convolution},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1711--1724},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451090},
doi = {10.1145/3406325.3451090},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannFN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-03968,
author = {Karl Bringmann and
Vasileios Nakos},
title = {Fast n-fold Boolean Convolution via Additive Combinatorics},
journal = {CoRR},
volume = {abs/2105.03968},
year = {2021},
url = {https://arxiv.org/abs/2105.03968},
eprinttype = {arXiv},
eprint = {2105.03968},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-03968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05984,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
title = {Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative
Convolution},
journal = {CoRR},
volume = {abs/2105.05984},
year = {2021},
url = {https://arxiv.org/abs/2105.05984},
eprinttype = {arXiv},
eprint = {2105.05984},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07347,
author = {Karl Bringmann and
Michael Kapralov and
Mikhail Makarov and
Vasileios Nakos and
Amir Yagudin and
Amir Zandieh},
title = {Sparse Fourier Transform by traversing Cooley-Tukey {FFT} computation
graphs},
journal = {CoRR},
volume = {abs/2107.07347},
year = {2021},
url = {https://arxiv.org/abs/2107.07347},
eprinttype = {arXiv},
eprint = {2107.07347},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07625,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
title = {Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution},
journal = {CoRR},
volume = {abs/2107.07625},
year = {2021},
url = {https://arxiv.org/abs/2107.07625},
eprinttype = {arXiv},
eprint = {2107.07625},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-13206,
author = {Karl Bringmann and
Vasileios Nakos},
title = {Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset
Sum},
journal = {CoRR},
volume = {abs/2107.13206},
year = {2021},
url = {https://arxiv.org/abs/2107.13206},
eprinttype = {arXiv},
eprint = {2107.13206},
timestamp = {Fri, 30 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-13206.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-13344,
author = {Dimitris Fotakis and
Panagiotis Kostopanagiotis and
Vasileios Nakos and
Georgios Piliouras and
Stratis Skoulakis},
title = {On the Approximability of Multistage Min-Sum Set Cover},
journal = {CoRR},
volume = {abs/2107.13344},
year = {2021},
url = {https://arxiv.org/abs/2107.13344},
eprinttype = {arXiv},
eprint = {2107.13344},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-13344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Nakos20,
author = {Vasileios Nakos},
title = {Nearly Optimal Sparse Polynomial Multiplication},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {11},
pages = {7231--7236},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2989385},
doi = {10.1109/TIT.2020.2989385},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/Nakos20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/LiN20,
author = {Yi Li and
Vasileios Nakos},
title = {Sublinear-Time Algorithms for Compressive Phase Retrieval},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {11},
pages = {7302--7310},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.3020701},
doi = {10.1109/TIT.2020.3020701},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/LiN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CheraghchiN20,
author = {Mahdi Cheraghchi and
Vasileios Nakos},
editor = {Sandy Irani},
title = {Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal
Decoding Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1203--1213},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00115},
doi = {10.1109/FOCS46700.2020.00115},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/CheraghchiN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0002N20,
author = {Yi Li and
Vasileios Nakos},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Deterministic Sparse Fourier Transform with an {\(\mathscr{l}\)}\({}_{\mbox{{\(\infty\)}}}\)
Guarantee},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {77:1--77:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.77},
doi = {10.4230/LIPICS.ICALP.2020.77},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0002N20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannN20,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Top-k-convolution and the quest for near-linear output-sensitive subset
sum},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {982--995},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384308},
doi = {10.1145/3357713.3384308},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-08420,
author = {Mahdi Cheraghchi and
Vasileios Nakos},
title = {Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal
Decoding Time},
journal = {CoRR},
volume = {abs/2006.08420},
year = {2020},
url = {https://arxiv.org/abs/2006.08420},
eprinttype = {arXiv},
eprint = {2006.08420},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-08420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-10577,
author = {Kyriakos Axiotis and
Arturs Backurs and
Karl Bringmann and
Ce Jin and
Vasileios Nakos and
Christos Tzamos and
Hongxun Wu},
title = {Fast and Simple Modular Subset Sum},
journal = {CoRR},
volume = {abs/2008.10577},
year = {2020},
url = {https://arxiv.org/abs/2008.10577},
eprinttype = {arXiv},
eprint = {2008.10577},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-10577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NakosSW19,
author = {Vasileios Nakos and
Zhao Song and
Zhengyu Wang},
editor = {David Zuckerman},
title = {(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension;
RIPless and Filterless},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1568--1577},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00092},
doi = {10.1109/FOCS.2019.00092},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NakosSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Nakos19,
author = {Vasileios Nakos},
title = {One-Bit ExpanderSketch for One-Bit Compressed Sensing},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {2853--2857},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849231},
doi = {10.1109/ISIT.2019.8849231},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/Nakos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NakosS19,
author = {Vasileios Nakos and
Zhao Song},
editor = {Moses Charikar and
Edith Cohen},
title = {Stronger l\({}_{\mbox{2}}\)/l\({}_{\mbox{2}}\) compressed sensing;
without iterating},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {289--297},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316355},
doi = {10.1145/3313276.3316355},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NakosS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09355,
author = {Vasileios Nakos},
title = {Nearly Optimal Sparse Polynomial Multiplication},
journal = {CoRR},
volume = {abs/1901.09355},
year = {2019},
url = {http://arxiv.org/abs/1901.09355},
eprinttype = {arXiv},
eprint = {1901.09355},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-09355.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-00995,
author = {Yi Li and
Vasileios Nakos},
title = {Deterministic Sparse Fourier Transform with an ell{\_}infty Guarantee},
journal = {CoRR},
volume = {abs/1903.00995},
year = {2019},
url = {http://arxiv.org/abs/1903.00995},
eprinttype = {arXiv},
eprint = {1903.00995},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-00995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-02742,
author = {Vasileios Nakos and
Zhao Song},
title = {Stronger {L2/L2} Compressed Sensing; Without Iterating},
journal = {CoRR},
volume = {abs/1903.02742},
year = {2019},
url = {http://arxiv.org/abs/1903.02742},
eprinttype = {arXiv},
eprint = {1903.02742},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-02742.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11123,
author = {Vasileios Nakos and
Zhao Song and
Zhengyu Wang},
title = {(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension;
RIPless and Filterless},
journal = {CoRR},
volume = {abs/1909.11123},
year = {2019},
url = {http://arxiv.org/abs/1909.11123},
eprinttype = {arXiv},
eprint = {1909.11123},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-11123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/0002N18,
author = {Yi Li and
Vasileios Nakos},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Deterministic Heavy Hitters with Sublinear Query Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.18},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.18},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/0002N18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/0002NW18,
author = {Yi Li and
Vasileios Nakos and
David P. Woodruff},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {On Low-Risk Heavy Hitters and Sparse Recovery Schemes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.19},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.19},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/0002NW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/NakosSW018,
author = {Vasileios Nakos and
Xiaofei Shi and
David P. Woodruff and
Hongyang Zhang},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Improved Algorithms for Adaptive Compressed Sensing},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {90:1--90:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.90},
doi = {10.4230/LIPICS.ICALP.2018.90},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/NakosSW018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/LiN18,
author = {Yi Li and
Vasileios Nakos},
title = {Sublinear- Time Algorithms for Compressive Phase Retrieval},
booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
2018, Vail, CO, USA, June 17-22, 2018},
pages = {2301--2305},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ISIT.2018.8437599},
doi = {10.1109/ISIT.2018.8437599},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/LiN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-09673,
author = {Vasileios Nakos and
Xiaofei Shi and
David P. Woodruff and
Hongyang Zhang},
title = {Improved Algorithms for Adaptive Compressed Sensing},
journal = {CoRR},
volume = {abs/1804.09673},
year = {2018},
url = {http://arxiv.org/abs/1804.09673},
eprinttype = {arXiv},
eprint = {1804.09673},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-09673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Nakos17,
author = {Vasileios Nakos},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {On Fast Decoding of High-Dimensional Signals from One-Bit Measurements},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {61:1--61:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.61},
doi = {10.4230/LIPICS.ICALP.2017.61},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Nakos17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Nakos17,
author = {Vasileios Nakos},
title = {Almost optimal phaseless compressed sensing with sublinear decoding
time},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {1142--1146},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006707},
doi = {10.1109/ISIT.2017.8006707},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/Nakos17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Nakos17,
author = {Vasileios Nakos},
title = {Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding
Time},
journal = {CoRR},
volume = {abs/1701.06437},
year = {2017},
url = {http://arxiv.org/abs/1701.06437},
eprinttype = {arXiv},
eprint = {1701.06437},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Nakos17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02917,
author = {Yi Li and
Vasileios Nakos},
title = {Sublinear-Time Algorithms for Compressive Phase Retrieval},
journal = {CoRR},
volume = {abs/1709.02917},
year = {2017},
url = {http://arxiv.org/abs/1709.02917},
eprinttype = {arXiv},
eprint = {1709.02917},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02917.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02919,
author = {Yi Li and
Vasileios Nakos and
David P. Woodruff},
title = {On Low-Risk Heavy Hitters and Sparse Recovery Schemes},
journal = {CoRR},
volume = {abs/1709.02919},
year = {2017},
url = {http://arxiv.org/abs/1709.02919},
eprinttype = {arXiv},
eprint = {1709.02919},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-07308,
author = {Charalampos E. Tsourakakis and
Michael Mitzenmacher and
Jaroslaw Blasiok and
Ben Lawson and
Preetum Nakkiran and
Vasileios Nakos},
title = {Predicting Positive and Negative Links with Noisy Queries: Theory
{\&} Practice},
journal = {CoRR},
volume = {abs/1709.07308},
year = {2017},
url = {http://arxiv.org/abs/1709.07308},
eprinttype = {arXiv},
eprint = {1709.07308},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-07308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04049,
author = {Vasileios Nakos},
title = {One-Bit ExpanderSketch for One-Bit Compressed Sensing},
journal = {CoRR},
volume = {abs/1711.04049},
year = {2017},
url = {http://arxiv.org/abs/1711.04049},
eprinttype = {arXiv},
eprint = {1711.04049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-01971,
author = {Yi Li and
Vasileios Nakos},
title = {Deterministic Heavy Hitters with Sublinear Query Time},
journal = {CoRR},
volume = {abs/1712.01971},
year = {2017},
url = {http://arxiv.org/abs/1712.01971},
eprinttype = {arXiv},
eprint = {1712.01971},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-01971.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Nakos16,
author = {Vasileios Nakos},
title = {On Fast Decoding of Noiseless Signals from One-Bit or Phaseless Measurements},
journal = {CoRR},
volume = {abs/1603.08585},
year = {2016},
url = {http://arxiv.org/abs/1603.08585},
eprinttype = {arXiv},
eprint = {1603.08585},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Nakos16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mobiwac/KonstantopoulosPVNG14,
author = {Charalampos Konstantopoulos and
Grammati E. Pantziou and
Nikolaos Vathis and
Vasileios Nakos and
Damianos Gavalas},
editor = {Wessam Ajib and
{\'{A}}ngel Cuevas Rum{\'{\i}}n},
title = {Efficient mobile sink-based data gathering in wireless sensor networks
with guaranteed delay},
booktitle = {MobiWac'14, Proceedings of the 12th {ACM} International Symposium
on Mobility Management and Wireless Access, Montreal, QC, Canada,
September 21-26, 2014},
pages = {47--54},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2642668.2642674},
doi = {10.1145/2642668.2642674},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mobiwac/KonstantopoulosPVNG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:45 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:
