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

• 1986
• 
  Leonard M. Adleman, Hendrik W. Lenstra Jr.:
  Finding Irreducible Polynomials over Finite Fields. STOC 1986: 350-355
• 
  Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán:
  Two lower bounds for branching programs. STOC 1986: 30-38
• 
  Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
  Deterministic Selection in O(log log N) Parallel Time. STOC 1986: 188-195
• 
  Imre Bárány, Zoltán Füredi:
  Computing the Volume Is Difficult. STOC 1986: 442-447
• 
  David A. Mix Barrington:
  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹. STOC 1986: 1-5
• 
  Paul Beame:
  Limits on the Power of Concurrent-Write Parallel Machines. STOC 1986: 169-176
• 
  Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
  A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots. STOC 1986: 340-349
• 
  Marshall W. Bern:
  Two Probabilistic Results on Rectilinear Steiner Trees. STOC 1986: 433-441
• 
  Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
  Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract). STOC 1986: 273-282
• 
  Andrei Z. Broder:
  How hard is to marry at random? (On the approximation of the permanent). STOC 1986: 50-58
• 
  Jin-yi Cai:
  With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. STOC 1986: 21-29
• 
  Kenneth L. Clarkson:
  Further Applications of Random Sampling to Computational Geometry. STOC 1986: 414-423
• 
  Richard Cleve:
  Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract). STOC 1986: 364-369
• 
  Edward G. Coffman Jr., Frank Thomson Leighton:
  A Provably Efficient Algorithm for Dynamic Storage Allocation. STOC 1986: 77-90
• 
  Richard Cole, Uzi Vishkin:
  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. STOC 1986: 206-219
• 
  Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper:
  Reasoning about Fair Concurrent Programs. STOC 1986: 283-294
• 
  David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap:
  Probing Convex Polytopes. STOC 1986: 424-432
• 
  James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan:
  Making Data Structures Persistent. STOC 1986: 109-121
• 
  Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
  Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379
• 
  Herbert Edelsbrunner, Leonidas J. Guibas:
  Topologically Sweeping an Arrangement. STOC 1986: 389-403
• 
  Paul Feldman, Joel Friedman, Nicholas Pippenger:
  Non-Blocking Networks (Preliminary Version). STOC 1986: 247-254
• 
  Zvi Galil, Ravi Kannan, Endre Szemerédi:
  On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. STOC 1986: 39-49
• 
  Andrew V. Goldberg, Robert Endre Tarjan:
  A New Approach to the Maximum Flow Problem. STOC 1986: 136-146
• 
  Shafi Goldwasser, Joe Kilian:
  Almost All Primes Can Be Quickly Certified. STOC 1986: 316-329
• 
  Shafi Goldwasser, Michael Sipser:
  Private Coins versus Public Coins in Interactive Proof Systems. STOC 1986: 59-68
• 
  Joseph Y. Halpern, Moshe Y. Vardi:
  The Complexity of Reasoning about Knowledge and Time: Extended Abstract. STOC 1986: 304-315
• 
  Johan Håstad:
  Almost Optimal Lower Bounds for Small Depth Circuits. STOC 1986: 6-20
• 
  Erich L. Kaltofen:
  Uniform Closure Properties of P-Computable Functions. STOC 1986: 330-337
• 
  Sanjiv Kapoor, Pravin M. Vaidya:
  Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows. STOC 1986: 147-159
• 
  Anna R. Karlin, Eli Upfal:
  Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version). STOC 1986: 160-168

skipping 18 more matches