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

• 2007
• 
  Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
  Region-fault tolerant geometric spanners. SODA 2007: 1-10
• 
  Ittai Abraham, Yair Bartal, Ofer Neiman:
  Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA 2007: 502-511
• 
  Nir Ailon:
  Aggregation of partial rankings, p-ratings and top-m lists. SODA 2007: 415-424
• 
  Gorjan Alagic, Cristopher Moore, Alexander Russell:
  Quantum algorithms for Simon's problem over general groups. SODA 2007: 1217-1224
• 
  Max A. Alekseyev, Pavel A. Pevzner:
  Whole genome duplications, multi-break rearrangements, and genome halving problem. SODA 2007: 665-679
• 
  Luca Allulli, Peter Lichodzijewski, Norbert Zeh:
  A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. SODA 2007: 910-919
• 
  Noga Alon, Oded Schwartz, Asaf Shapira:
  An elementary construction of constant-degree expanders. SODA 2007: 454-458
• 
  Nina Amenta, Dominique Attali, Olivier Devillers:
  Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. SODA 2007: 1106-1113
• 
  Nir Andelman, Michal Feldman, Yishay Mansour:
  Strong price of anarchy. SODA 2007: 189-198
• 
  Matthew Andrews:
  Instability of FIFO in the permanent sessions model at arbitrarily small network loads. SODA 2007: 219-228
• 
  Spyros Angelopoulos:
  Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. SODA 2007: 248-257
• 
  Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
  On the separation and equivalence of paging strategies. SODA 2007: 229-237
• 
  David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang:
  Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075
• 
  David Arthur, Sergei Vassilvitskii:
  k-means++: the advantages of careful seeding. SODA 2007: 1027-1035
• 
  Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
  Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765
• 
  James Aspnes, Yang Richard Yang, Yitong Yin:
  Path-independent load balancing with unreliable machines. SODA 2007: 814-823
• 
  Baruch Awerbuch, Rohit Khandekar, Satish Rao:
  Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957
• 
  László Babai, Igor Gorodezky:
  Sandpile transience on the grid is polynomially bounded. SODA 2007: 627-636
• 
  Moshe Babaioff, Nicole Immorlica, Robert Kleinberg:
  Matroids, secretary problems, and online mechanisms. SODA 2007: 434-443
• 
  Dave Bacon, Isaac L. Chuang, Aram W. Harrow:
  The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits. SODA 2007: 1235-1244
• 
  Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos:
  Approximation algorithms for embedding general metrics into trees. SODA 2007: 512-521
• 
  Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
  Dynamic pricing for impatient bidders. SODA 2007: 726-735
• 
  Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
  Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206
• 
  Nikhil Bansal, Kirk Pruhs, Clifford Stein:
  Speed scaling for weighted flow time. SODA 2007: 805-813
• 
  Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
  Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689
• 
  Rajat Bhattacharjee, Ashish Goel:
  Algorithms and incentives for robust ranking. SODA 2007: 425-433
• 
  Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
  An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365
• 
  Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein:
  A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294
• 
  Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
  Fast computation of power series solutions of systems of differential equations. SODA 2007: 1012-1021
• 
  Julia Böttcher, Mathias Schacht, Anusch Taraz:
  On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626

skipping 110 more matches