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

• 2002
• 
  Dimitris Achlioptas, Cristopher Moore:
  On the 2-Colorability of Random Hypergraphs. RANDOM 2002: 78-90
• 
  Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan:
  Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10
• 
  Boaz Barak:
  A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms. RANDOM 2002: 194-208
• 
  Hana Chockler, Orna Kupferman:
  omega-Regular Languages Are Testable with a Constant Number of Queries. RANDOM 2002: 26-28
• 
  Amin Coja-Oghlan:
  Finding Sparse Induced Subgraphs of Semirandom Graphs. RANDOM 2002: 139-148
• 
  Colin Cooper:
  Classifying Special Interest Groups in Web Graphs. RANDOM 2002: 263-276
• 
  Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
  Bisection of Random Cubic Graphs. RANDOM 2002: 114-125
• 
  William Duckworth, Bernard Mans:
  Small k-Dominating Sets of Regular Graphs. RANDOM 2002: 126-138
• 
  Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
  Counting and Sampling H-Colourings. RANDOM 2002: 51-67
• 
  Martin E. Dyer, Mark Jerrum, Eric Vigoda:
  Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM 2002: 68-77
• 
  Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
  Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM 2002: 149-163
• 
  Lars Engebretsen, Venkatesan Guruswami:
  Is Constraint Satisfaction Over Two Variables Always Easy? RANDOM 2002: 224-238
• 
  Ehud Friedgut, Jeff Kahn, Avi Wigderson:
  Computing Graph Properties by Randomized Subcube Partitions. RANDOM 2002: 105-113
• 
  Oded Goldreich, Avi Wigderson:
  Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. RANDOM 2002: 209-223
• 
  Avner Magen:
  Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications. RANDOM 2002: 239-253
• 
  Christopher Malon, Igor Pak:
  Percolation on Finite Cayley Graphs. RANDOM 2002: 91-104
• 
  Milena Mihail, Christos H. Papadimitriou:
  On the Eigenvalue Power Law. RANDOM 2002: 254-262
• 
  Cristopher Moore, Alexander Russell:
  Quantum Walks on the Hypercube. RANDOM 2002: 164-178
• 
  Kenji Obata:
  Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes. RANDOM 2002: 39-50
• 
  Michal Parnas, Dana Ron, Ronitt Rubinfeld:
  On Testing Convexity and Submodularity. RANDOM 2002: 11-25
• 
  Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
  Randomness-Optimal Characterization of Two NP Proof Systems. RANDOM 2002: 179-193
• 
  José D. P. Rolim, Salil P. Vadhan:
  Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Lecture Notes in Computer Science 2483, Springer 2002, ISBN 3-540-44147-6 [contents]