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

• 1995
• 
  Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman:
  Derandomized Graph Products. Comput. Complex. 5(1): 60-75 (1995)
• 
  Carme Àlvarez, Birgit Jenner:
  A Note on Logspace Optimization. Comput. Complex. 5(2): 155-166 (1995)
• 
  Benny Chor, Netta Shani:
  The Privacy of Dense Symmetric Functions. Comput. Complex. 5(1): 43-59 (1995)
• 
  Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde:
  Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. 5(2): 113-131 (1995)
• 
  Johan Håstad, Stasys Jukna, Pavel Pudlák:
  Top-Down Lower Bounds for Depth-Three Circuits. Comput. Complex. 5(2): 99-112 (1995)
• 
  Alain P. Hiltgen, Mike Paterson:
  PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice. Comput. Complex. 5(2): 132-154 (1995)
• 
  David W. Juedes:
  Weakly Complete Problems are not Rare. Comput. Complex. 5(3/4): 267-283 (1995)
• 
  Mauricio Karchmer, Ran Raz, Avi Wigderson:
  Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Comput. Complex. 5(3/4): 191-204 (1995)
• 
  Thomas Lickteig, Kai Werther:
  How can a Complex Square Root be Computed in an Optimal Way. Comput. Complex. 5(3/4): 222-236 (1995)
• 
  Nick Littlestone, Philip M. Long, Manfred K. Warmuth:
  On-line Learning of Linear Functions. Comput. Complex. 5(1): 1-23 (1995)
• 
  Keju Ma, Joachim von zur Gathen:
  The Computational Complexity of Recognizing Permutation Functions. Comput. Complex. 5(1): 76-97 (1995)
• 
  Ueli M. Maurer:
  On the Oracle Complexity of Factoring Integers. Comput. Complex. 5(3/4): 237-247 (1995)
• 
  Ran Raz:
  Fourier Analysis for Probabilistic Communication Complexity. Comput. Complex. 5(3/4): 205-221 (1995)
• 
  Meera Sitharam:
  Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates. Comput. Complex. 5(2): 167-189 (1995)
• 
  Meera Sitharam:
  Pseudorandom Generators and Learning Algorithms for AC0. Comput. Complex. 5(3/4): 248-266 (1995)
• 
  György Turán:
  On the Complexity of Planar Boolean Circuits. Comput. Complex. 5(1): 24-42 (1995)