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

• 2024
• 
  Ahmed Abdelkader, David M. Mount:
  Convex Approximation and the Hilbert Geometry. SOSA 2024: 286-298
• 
  Shyan Akmal:
  An Enumerative Perspective on Connectivity. SOSA 2024: 179-198
• 
  Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
  Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. SOSA 2024: 63-81
• 
  Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
  A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223
• 
  Sepehr Assadi:
  A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. SOSA 2024: 337-354
• 
  Nikhil Balaji, Samir Datta:
  USSR is in P/poly. SOSA 2024: 151-159
• 
  Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
  Modern Hashing Made Simple. SOSA 2024: 363-373
• 
  Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
  Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA 2024: 331-336
• 
  Greg Bodwin:
  An Alternate Proof of Near-Optimal Light Spanners. SOSA 2024: 39-55
• 
  Clément L. Canonne, Joy Qiping Yang:
  Simpler Distribution Testing with Little Memory. SOSA 2024: 406-416
• 
  Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
  Simple and tight complexity lower bounds for solving Rabin games. SOSA 2024: 160-167
• 
  Timothy M. Chan, Yinzhan Xu:
  Simpler Reductions from Exact Triangle. SOSA 2024: 28-38
• 
  Vaggos Chatziafratis, Piotr Indyk:
  Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. SOSA 2024: 230-243
• 
  Chandra Chekuri, Junkai Song, Weizhong Zhang:
  Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. SOSA 2024: 396-405
• 
  Majid Daliri, Juliana Freire, Christopher Musco, Aécio S. R. Santos, Haoxiang Zhang:
  Simple Analysis of Priority Sampling. SOSA 2024: 224-229
• 
  Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
  Finding the saddlepoint faster than sorting. SOSA 2024: 168-178
• 
  Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
  Minimum-cost paths for electric cars. SOSA 2024: 374-382
• 
  Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
  Sorting Signed Permutations by Reversals in Nearly-Linear Time. SOSA 2024: 199-214
• 
  Jinxiang Gan, Mordecai J. Golin:
  Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. SOSA 2024: 269-278
• 
  Uma Girish, Ran Raz, Wei Zhan:
  Quantum Logspace Computations are Verifiable. SOSA 2024: 144-150
• 
  Sariel Har-Peled, Elfarouk Harb:
  Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA 2024: 244-268
• 
  Qizheng He:
  Improved Algorithms for Integer Complexity. SOSA 2024: 107-114
• 
  Qizheng He, Zhean Xu:
  Simple and Faster Algorithms for Knapsack. SOSA 2024: 56-62
• 
  Gary Hoppenworth:
  Simple Linear-Size Additive Emulators. SOSA 2024: 1-8
• 
  Sven Jäger, Philipp Warode:
  Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. SOSA 2024: 82-96
• 
  Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
  Listing 6-Cycles. SOSA 2024: 19-27
• 
  Pavel E. Kalugin, Maksim S. Nikolaev:
  The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. SOSA 2024: 97-99
• 
  Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
  Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305
• 
  Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
  Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285
• 
  Alexander S. Kulikov, Ivan Mihajlin:
  If Edge Coloring is Hard under SETH, then SETH is False. SOSA 2024: 115-120

skipping 155 more matches