• 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 837 matches

• 2021
• 
  Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
  Rectilinear link diameter and radius in a rectilinear polygonal domain. Comput. Geom. 92: 101685 (2021)
• 
  Evangelos Kipouridis, Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas:
  Dynamic layers of maxima with applications to dominating queries. Comput. Geom. 93: 101699 (2021)
• 2020
• 
  Karl Bringmann, Thore Husfeldt, Måns Magnusson:
  Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica 82(8): 2292-2315 (2020)
• 
  Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
  Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020)
• 
  Yasuo Tabei, Yoshihiro Yamanishi, Rasmus Pagh:
  Space-Efficient Feature Maps for String Alignment Kernels. Data Sci. Eng. 5(2): 168-179 (2020)
• 
  Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
  Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63(2): 483-505 (2020)
• 
  Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
  Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020)
• 
  Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
  Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM 67(6): 36:1-36:22 (2020)
• 
  Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
  Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127(7): 579-593 (2020)
• 
  Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
  Escaping an Infinitude of Lions. Am. Math. Mon. 127(10): 880-896 (2020)
• 
  Thore Husfeldt:
  Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). CPM 2020: 1:1-1:1
• 
  Evangelos Kipouridis, Kostas Tsichlas:
  Longest Common Subsequence on Weighted Sequences. CPM 2020: 19:1-19:15
• 
  Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
  Private Aggregation from Fewer Anonymous Messages. EUROCRYPT (2) 2020: 798-827
• 
  Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
  Framework for ER-Completeness of Two-Dimensional Packing Problems. FOCS 2020: 1014-1021
• 
  Thomas D. Ahle, Jakob Bæk Tejs Knudsen:
  Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search. FOCS 2020: 728-739
• 
  Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
  Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS 2020: 1112-1122
• 
  Rasmus Pagh, Johan Sivertsen:
  The Space Complexity of Inner Product Filters. ICDT 2020: 22:1-22:14
• 
  Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
  Pure Differentially Private Summation from Anonymous Messages. ITC 2020: 15:1-15:23
• 
  Peter Michael Reichstein Rasmussen, Amit Sahai:
  Expander Graphs Are Non-Malleable Codes. ITC 2020: 6:1-6:10
• 
  Edith Cohen, Ofir Geri, Rasmus Pagh:
  Composable Sketches for Functions of Frequencies: Beyond the Worst Case. ICML 2020: 2057-2067
• 
  Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh:
  Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. ICML 2020: 3505-3514
• 
  Edith Cohen, Rasmus Pagh, David P. Woodruff:
  WOR and p's: Sketches for ℓ_p-Sampling Without Replacement. NeurIPS 2020
• 
  Martin Aumüller, Rasmus Pagh, Francesco Silvestri:
  Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS 2020: 191-204
• 
  Mayank Goswami, Riko Jacob, Rasmus Pagh:
  On the I/O Complexity of the k-Nearest Neighbors Problem. PODS 2020: 205-212
• 
  Christian Hansen, Casper Hansen, Jakob Grue Simonsen, Birger Larsen, Stephen Alstrup, Christina Lioma:
  Factuality Checking in News Headlines with Eye Tracking. SIGIR 2020: 2013-2016
• 
  Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
  Content-aware Neural Hashing for Cold-start Recommendation. SIGIR 2020: 971-980
• 
  Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
  Unsupervised Semantic Hashing with Pairwise Reconstruction. SIGIR 2020: 2009-2012
• 
  Thomas Dybdahl Ahle:
  On the Problem of p_1^-1 in Locality-Sensitive Hashing. SISAP 2020: 85-93
• 
  Thomas D. Ahle, Francesco Silvestri:
  Similarity Search with Tensor Core Units. SISAP 2020: 76-84
• 
  Tobias Christiani, Rasmus Pagh, Mikkel Thorup:
  Confirmation Sampling for Exact Nearest Neighbor Search. SISAP 2020: 97-110

skipping 807 more matches