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

• 1999
• 
  Eric Allender, Michael E. Saks, Igor E. Shparlinski:
  A Lower Bound for Primality. CCC 1999: 10-14
• 
  László Babai, Sophie Laplante:
  Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. CCC 1999: 98-104
• 
  Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson:
  Deterministic Amplification of Space-Bounded Probabilistic Algorithms. CCC 1999: 188-
• 
  David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
  On Monotone Planar Circuits. CCC 1999: 24-
• 
  Richard Beigel:
  Gaps in Bounded Query Hierarchies. CCC 1999: 124-141
• 
  Richard Beigel, Alexis Maciel:
  Circuit Lower Bounds Collapse Relativized Complexity Classes. CCC 1999: 222-226
• 
  Eli Ben-Sasson, Avi Wigderson:
  Short Proofs Are Narrow - Resolution Made Simple (Abstract). CCC 1999: 2
• 
  Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
  Non-Automatizability of Bounded-Depth Frege Proofs. CCC 1999: 15-23
• 
  Harry Buhrman, Wim van Dam:
  Quantum Bounded Query Complexity. CCC 1999: 149-
• 
  Harry Buhrman, Leen Torenvliet:
  Complicated Complementations. CCC 1999: 227-236
• 
  Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi:
  Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). CCC 1999: 5
• 
  Jin-yi Cai:
  Some Recent Progress on the Complexity of Lattice Problems. CCC 1999: 158-
• 
  Jin-yi Cai:
  Applications of a New Transference Theorem to Ajtai's Connection Factor. CCC 1999: 205-214
• 
  Jack Jie Dai, Jack H. Lutz:
  Query Order and NP-Completeness. CCC 1999: 142-148
• 
  Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank:
  Computing from Partial Solutions. CCC 1999: 34-45
• 
  Mikael Goldmann, Alexander Russell:
  The Complexity of Solving Equations over Finite Groups. CCC 1999: 80-86
• 
  Oded Goldreich, Salil P. Vadhan:
  Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. CCC 1999: 54-
• 
  Russell Impagliazzo, Ramamohan Paturi:
  Complexity of k-SAT. CCC 1999: 237-240
• 
  Tao Jiang, Ming Li, Paul M. B. Vitányi:
  The Expected Size of Heilbronn's Triangles. CCC 1999: 105-113
• 
  Ravi Kumar, D. Sivakumar:
  Proofs, Codes, and Polynomial-Time Reducibilities. CCC 1999: 46-53
• 
  Ravi Kumar, D. Sivakumar:
  A Note on the Shortest Lattice Vector Problem. CCC 1999: 200-204
• 
  Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
  Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". CCC 1999: 114-
• 
  Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
  The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). CCC 1999: 7
• 
  J. Maurice Rojas:
  On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). CCC 1999: 3
• 
  Marcus Schaefer:
  Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). CCC 1999: 6
• 
  Amir Shpilka, Avi Wigderson:
  Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. CCC 1999: 87-
• 
  Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
  Pseudorandom Generators without the XOR Lemma (Abstract). CCC 1999: 4
• 
  Jun Tarui, Tatsuie Tsukiji:
  Learning DNF by Approximating Inclusion-Exclusion Formulae. CCC 1999: 215-
• 
  John Watrous:
  Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. CCC 1999: 180-187
• 
  Avi Wigderson:
  De-Randomizing BPP: The State of the Art. CCC 1999: 76-

skipping 1 more match