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

• 2005
• 
  Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi:
  Toward a Model for Backtracking and Dynamic Programming. CCC 2005: 308-322
• 
  Eric Allender, Samir Datta, Sambuddha Roy:
  Topology Inside NC¹. CCC 2005: 298-307
• 
  Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
  Computationally Private Randomizing Polynomials and Their Applications. CCC 2005: 260-274
• 
  Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan:
  Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. CCC 2005: 13-27
• 
  Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson:
  A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. CCC 2005: 52-66
• 
  Amos Beimel, Enav Weinreb:
  Monotone Circuits for Weighted Threshold Functions. CCC 2005: 67-75
• 
  Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
  Short PCPs Verifiable in Polylogarithmic Time. CCC 2005: 120-134
• 
  Andrej Bogdanov, Hoeteck Wee:
  More on Noncommutative Polynomial Identity Testing. CCC 2005: 92-99
• 
  Sourav Chakraborty:
  On the Sensitivity of Cyclically-Invariant Boolean Functions. CCC 2005: 163-167
• 
  Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar:
  On the Hardness of Approximating Multicut and Sparsest-Cut. CCC 2005: 144-153
• 
  Eldar Fischer, Lance Fortnow:
  Tolerant Versus Intolerant Testing for Boolean Properties. CCC 2005: 135-140
• 
  Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
  On the Complexity of Succinct Zero-Sum Games. CCC 2005: 323-332
• 
  Lance Fortnow, Adam R. Klivans:
  NP with Small Advice. CCC 2005: 228-234
• 
  Venkatesan Guruswami, Subhash Khot:
  Hardness of Max 3SAT with No Mixed Clauses. CCC 2005: 154-162
• 
  Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
  If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. CCC 2005: 243-257
• 
  Gus Gutoski:
  Upper Bounds for Quantum Interactive Proofs with Competing Provers. CCC 2005: 334-343
• 
  Thanh Minh Hoang, Thomas Thierauf:
  The Complexity of the Inertia and Some Closure Properties of GapL. CCC 2005: 28-37
• 
  Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
  Prior Entanglement, Message Compression and Privacy in Quantum Communication. CCC 2005: 285-296
• 
  Neeraj Kayal, Nitin Saxena:
  On the Ring Isomorphism and Automorphism Problems. CCC 2005: 2-12
• 
  Sophie Laplante, Troy Lee, Mario Szegedy:
  The Quantum Adversary Method and Classical Formula Size Lower Bounds. CCC 2005: 76-90
• 
  Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi:
  On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. CCC 2005: 112-119
• 
  Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
  On the Complexity of Hardness Amplification. CCC 2005: 170-182
• 
  Arfst Nickelsen, Birgit Schelm:
  Average-Case Computations - Comparing AvgP, HP, and Nearly-P. CCC 2005: 235-242
• 
  Bill Rosgen:
  On the Hardness of Distinguishing Mixed-State Quantum Computations. CCC 2005: 344-354
• 
  Ronen Shaltiel, Christopher Umans:
  Pseudorandomness for Approximate Counting and Sampling. CCC 2005: 212-226
• 
  Emanuele Viola:
  On Constructing Parallel Pseudorandom Generators from One-Way Functions. CCC 2005: 183-197
• 
  Emanuele Viola:
  Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. CCC 2005: 198-209
• 
  Ingo Wegener, Philipp Woelfel:
  New Results on the Complexity of the Middle Bit of Multiplication. CCC 2005: 100-110
• 
  Ryan Williams:
  Better Time-Space Lower Bounds for SAT and Related Problems. CCC 2005: 40-49
• 
  David P. Woodruff, Sergey Yekhanin:
  A Geometric Approach to Information-Theoretic Private Information Retrieval. CCC 2005: 275-284