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

• 2001
• 
  Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy:
  A sharp threshold in proof complexity. STOC 2001: 337-346
• 
  Dimitris Achlioptas, Frank McSherry:
  Fast computation of low rank matrix. STOC 2001: 611-618
• 
  Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang:
  Running time and program size for self-assembled squares. STOC 2001: 740-748
• 
  Miklós Ajtai, Ravi Kumar, D. Sivakumar:
  A sieve algorithm for the shortest lattice vector problem. STOC 2001: 601-610
• 
  Luca de Alfaro, Rupak Majumdar:
  Quantitative solution of omega-regular games. STOC 2001: 675-683
• 
  Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
  Optimal static range reporting in one dimension. STOC 2001: 476-482
• 
  Andris Ambainis:
  A new protocol and lower bounds for quantum coin flipping. STOC 2001: 134-142
• 
  Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous:
  One-dimensional quantum walks. STOC 2001: 37-49
• 
  Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani:
  Quantum walks on graphs. STOC 2001: 50-59
• 
  Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart:
  The complexity of analytic tableaux. STOC 2001: 356-363
• 
  Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit:
  Local search heuristic for k-median and facility location problems. STOC 2001: 21-29
• 
  Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia:
  Spectral analysis of data. STOC 2001: 619-626
• 
  Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
  Sampling algorithms: lower bounds and applications. STOC 2001: 266-275
• 
  Yair Bartal, Moses Charikar, Danny Raz:
  Approximating min-sum k-clustering in metric spaces. STOC 2001: 11-20
• 
  Luca Becchetti, Stefano Leonardi:
  Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001: 94-103
• 
  Beate Bollig, Philipp Woelfel:
  A read-once branching program lower bound of Omega(2^n/4) for integer multiplication using universal. STOC 2001: 419-424
• 
  Christian Borgs, Jennifer T. Chayes, Boris G. Pittel:
  Sharp threshold and scaling window for the integer partitioning problem. STOC 2001: 330-336
• 
  Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons:
  The complexity of maximal constraint languages. STOC 2001: 667-674
• 
  Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
  Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579
• 
  Moses Charikar, Rina Panigrahy:
  Clustering to minimize the sum of cluster diameters. STOC 2001: 1-10
• 
  Bernard Chazelle, Ding Liu:
  Lower bounds for intersection searching and fractional cascading in higher dimension. STOC 2001: 322-329
• 
  Chandra Chekuri, Sanjeev Khanna, An Zhu:
  Algorithms for minimizing weighted flow time. STOC 2001: 84-93
• 
  John Dunagan, Santosh S. Vempala:
  Optimal outlier removal in high-dimensional. STOC 2001: 627-636
• 
  Bruno Durand, Leonid A. Levin, Alexander Shen:
  Complex tilings. STOC 2001: 732-739
• 
  Noam D. Elkies:
  Excellent codes from modular curves. STOC 2001: 200-208
• 
  Michael Elkin, David Peleg:
  (1+epsilon, beta)-spanner constructions for general graphs. STOC 2001: 173-182
• 
  Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha:
  Biased dictionaries with fast insert/deletes. STOC 2001: 483-491
• 
  Uriel Feige, Gideon Schechtman:
  On the integrality ratio of semidefinite relaxations of MAX CUT. STOC 2001: 433-442
• 
  Eldar Fischer, Ilan Newman:
  Testing of matrix properties. STOC 2001: 286-295
• 
  Péter Gács:
  Compatible sequences and a slow Winkler percolation. STOC 2001: 694-703

skipping 57 more matches