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

• 2020
• 
  Scott Aaronson, Patrick Rall:
  Quantum Approximate Counting, Simplified. SOSA 2020: 24-32
• 
  Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
  Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA 2020: 8-14
• 
  Leonid Barenboim, Gal Oren:
  Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. SOSA 2020: 99-105
• 
  Ahmad Biniaz:
  A Short Proof of the Toughness of Delaunay Triangulations. SOSA 2020: 43-46
• 
  Deeparnab Chakrabarty, Paul de Supinski:
  On a Decentralized (Δ+1)-Graph Coloring Algorithm. SOSA 2020: 91-98
• 
  Timothy M. Chan:
  Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. SOSA 2020: 33-37
• 
  Timothy M. Chan, Qizheng He:
  Reducing 3SUM to Convolution-3SUM. SOSA 2020: 1-7
• 
  Timothy M. Chan, Qizheng He:
  On the Change-Making Problem. SOSA 2020: 38-42
• 
  Moses Charikar, Xian Wu, Yinyu Ye:
  Adaptive Discrete Phase Retrieval. SOSA 2020: 47-56
• 
  Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi:
  Distributionally Robust Max Flows. SOSA 2020: 81-90
• 
  Bruno Grenet, Ilya Volkovich:
  One (more) line on the most Ancient Algorithm in History. SOSA 2020: 15-17
• 
  Ragesh Jaiswal, Amit Kumar:
  Multiplicative Rank-1 Approximation using Length-Squared Sampling. SOSA 2020: 18-23
• 
  Adam Karczmarz, Jakub Lacki:
  Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA 2020: 106-120
• 
  Kent Quanrud:
  Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. SOSA 2020: 69-80
• 
  Front Matter. SOSA 2020: 1-2
• 
  Grigory Yaroslavtsev, Samson Zhou:
  Fast Fourier Sparsity Testing. SOSA 2020: 57-68
• 
  Martin Farach-Colton, Inge Li Gørtz:
  3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. SIAM 2020, ISBN 978-1-61197-601-4 [contents]