• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 51 matches

• 2024
• 
  Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
  Join Size Bounds using l_p-Norms on Degree Sequences. Proc. ACM Manag. Data 2(2): 96 (2024)
• 
  Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis:
  Targeted Least Cardinality Candidate Key for Relational Databases. CoRR abs/2408.13540 (2024)
• 2023
• 
  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
• 
  Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
  Join Size Bounds using Lp-Norms on Degree Sequences. CoRR abs/2306.14075 (2023)
• 2022
• 
  Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
  Improved Sublinear-Time Edit Distance for Preprocessed Strings. ICALP 2022: 32:1-32:20
• 
  Baris Can Esmer, Vasileios Nakos:
  On (1 + ϵ)-Approximate Block Sparse Recovery. ISIT 2022: 1815-1820
• 
  Karl Bringmann, Nick Fischer, Vasileios Nakos:
  Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. SODA 2022: 3069-3090
• 
  Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
  Almost-optimal sublinear-time edit distance in the low distance regime. STOC 2022: 1102-1115
• 
  Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
  Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. CoRR abs/2202.08066 (2022)
• 
  Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
  Improved Sublinear-Time Edit Distance for Preprocessed Strings. CoRR abs/2204.14137 (2022)
• 2021
• 
  Karl Bringmann, Vasileios Nakos:
  Fast n-Fold Boolean Convolution via Additive Combinatorics. ICALP 2021: 41:1-41:17
• 
  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
• 
  Karl Bringmann, Vasileios Nakos:
  A Fine-Grained Perspective on Approximating Subset Sum and Partition. SODA 2021: 1797-1815
• 
  Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
  Fast and Simple Modular Subset Sum. SOSA 2021: 57-67
• 
  Karl Bringmann, Nick Fischer, Vasileios Nakos:
  Sparse nonnegative convolution is equivalent to dense nonnegative convolution. STOC 2021: 1711-1724
• 
  Karl Bringmann, Vasileios Nakos:
  Fast n-fold Boolean Convolution via Additive Combinatorics. CoRR abs/2105.03968 (2021)
• 
  Karl Bringmann, Nick Fischer, Vasileios Nakos:
  Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution. CoRR abs/2105.05984 (2021)
• 
  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)
• 
  Karl Bringmann, Nick Fischer, Vasileios Nakos:
  Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. CoRR abs/2107.07625 (2021)
• 
  Karl Bringmann, Vasileios Nakos:
  Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum. CoRR abs/2107.13206 (2021)
• 
  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
• 
  Yi Li, Vasileios Nakos:
  Sublinear-Time Algorithms for Compressive Phase Retrieval. IEEE Trans. Inf. Theory 66(11): 7302-7310 (2020)
• 
  Vasileios Nakos:
  Nearly Optimal Sparse Polynomial Multiplication. IEEE Trans. Inf. Theory 66(11): 7231-7236 (2020)
• 
  Mahdi Cheraghchi, Vasileios Nakos:
  Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. FOCS 2020: 1203-1213
• 
  Yi Li, Vasileios Nakos:
  Deterministic Sparse Fourier Transform with an ℓ_∞ Guarantee. ICALP 2020: 77:1-77:14
• 
  Karl Bringmann, Vasileios Nakos:
  Top-k-convolution and the quest for near-linear output-sensitive subset sum. STOC 2020: 982-995
• 
  Mahdi Cheraghchi, Vasileios Nakos:
  Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. CoRR abs/2006.08420 (2020)
• 
  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)
• 2019
• 
  Vasileios Nakos, Zhao Song, Zhengyu Wang:
  (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. FOCS 2019: 1568-1577
• 
  Vasileios Nakos:
  One-Bit ExpanderSketch for One-Bit Compressed Sensing. ISIT 2019: 2853-2857

skipping 21 more matches