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

• 1987
• 
  Martín Abadi, Joan Feigenbaum, Joe Kilian:
  On Hiding Information from an Oracle (Extended Abstract). STOC 1987: 195-203
• 
  Leonard M. Adleman, Ming-Deh A. Huang:
  Recognizing Primes in Random Polynomial Time. STOC 1987: 462-469
• 
  Alok Aggarwal, Richard J. Anderson:
  A Random NC Algorithm for Depth First Search. STOC 1987: 325-334
• 
  Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir:
  A Model for Hierarchical Memory. STOC 1987: 305-314
• 
  Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
  A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. STOC 1987: 39-45
• 
  Miklós Ajtai, János Komlós, Endre Szemerédi:
  Deterministic Simulation in LOGSPACE. STOC 1987: 132-140
• 
  Eric Allender:
  Some Consequences of the Existence of Pseudorandom Generators. STOC 1987: 151-159
• 
  Baruch Awerbuch:
  Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary). STOC 1987: 230-240
• 
  László Babai, Eugene M. Luks, Ákos Seress:
  Permutation Groups in NC. STOC 1987: 409-420
• 
  Eric Bach:
  Realistic Analysis of Some Randomized Algorithms. STOC 1987: 453-461
• 
  David A. Mix Barrington, Denis Thérien:
  Finite Monoids and the Fine Structure of NC¹. STOC 1987: 101-109
• 
  Paul Beame, Johan Håstad:
  Optimal Bounds for Decision Problems on the CRCW PRAM. STOC 1987: 83-93
• 
  Gianfranco Bilardi, Franco P. Preparata:
  Size-Time Complexity of Boolean Networks for Prefix Computations. STOC 1987: 436-442
• 
  Allan Borodin, Nathan Linial, Michael E. Saks:
  An Optimal Online Algorithm for Metrical Task Systems. STOC 1987: 373-382
• 
  Samuel R. Buss:
  The Boolean Formula Value Problem Is in ALOGTIME. STOC 1987: 123-131
• 
  Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas:
  The Complexity of Cutting Convex Polytopes. STOC 1987: 66-76
• 
  Kenneth L. Clarkson:
  Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract). STOC 1987: 56-65
• 
  Don Coppersmith, Shmuel Winograd:
  Matrix Multiplication via Arithmetic Progressions. STOC 1987: 1-6
• 
  Paul F. Dietz, Daniel Dominic Sleator:
  Two Algorithms for Maintaining Order in a List. STOC 1987: 365-372
• 
  Uriel Feige, Amos Fiat, Adi Shamir:
  Zero Knowledge Proofs of Identity. STOC 1987: 210-217
• 
  Lance Fortnow:
  The Complexity of Perfect Zero-Knowledge (Extended Abstract). STOC 1987: 204-209
• 
  Greg N. Frederickson:
  A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract). STOC 1987: 19-28
• 
  Martin Fürer:
  The Power of Randomness for Communication Complexity (Preliminary Version). STOC 1987: 178-181
• 
  Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
  Parallel Symmetry-Breaking in Sparse Graphs. STOC 1987: 315-324
• 
  Andrew V. Goldberg, Robert Endre Tarjan:
  Solving Minimum-Cost Flow Problems by Successive Approximation. STOC 1987: 7-18
• 
  Oded Goldreich:
  Towards a Theory of Software Protection and Simulation by Oblivious RAMs. STOC 1987: 182-194
• 
  Oded Goldreich, Silvio Micali, Avi Wigderson:
  How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. STOC 1987: 218-229
• 
  Johan Håstad, Frank Thomson Leighton, Mark Newman:
  Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract). STOC 1987: 274-284
• 
  Johan Håstad, Frank Thomson Leighton, Brian Rogoff:
  Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract). STOC 1987: 241-253
• 
  Lenwood S. Heath, Sorin Istrail:
  The Pagenumber of Genus g Graphs is O(g). STOC 1987: 388-397

skipping 21 more matches