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

• 2003
• 
  Tom Bohman, Alan M. Frieze, Ryan R. Martin:
  How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003)
• 
  Béla Bollobás, Graham R. Brightwell:
  The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003)
• 
  Anna Carlsund:
  Notes on the variance of the number of maxima in three dimensions. Random Struct. Algorithms 22(4): 440-447 (2003)
• 
  Colin Cooper, Alan M. Frieze:
  A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003)
• 
  Sanjoy Dasgupta, Anupam Gupta:
  An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1): 60-65 (2003)
• 
  Johan Håstad, Avi Wigderson:
  Simple analysis of graph tests for linearity and PCP. Random Struct. Algorithms 22(2): 139-160 (2003)
• 
  Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
  Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22(3): 248-310 (2003)
• 
  Mark Huber:
  A bounding chain for Swendsen-Wang. Random Struct. Algorithms 22(1): 43-59 (2003)
• 
  Svante Janson:
  The Wiener Index of simply generated random trees. Random Struct. Algorithms 22(4): 337-358 (2003)
• 
  Yoshiharu Kohayakawa, Vojtech Rödl:
  Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003)
• 
  Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
  On the probability of independent sets in random graphs. Random Struct. Algorithms 22(1): 1-14 (2003)
• 
  Daniela Kühn, Deryk Osthus:
  Minors in graphs of large girth. Random Struct. Algorithms 22(2): 213-225 (2003)
• 
  Neal Madras, Zhongrong Zheng:
  On the swapping algorithm. Random Struct. Algorithms 22(1): 66-97 (2003)
• 
  Colin McDiarmid:
  Random channel assignment in the plane. Random Struct. Algorithms 22(2): 187-212 (2003)
• 
  Michal Parnas, Dana Ron, Ronitt Rubinfeld:
  Testing membership in parenthesis languages. Random Struct. Algorithms 22(1): 98-138 (2003)
• 
  Nicholas Pippenger:
  The shortest disjunctive normal form of a random Boolean function. Random Struct. Algorithms 22(2): 161-186 (2003)
• 
  Jaikumar Radhakrishnan:
  A note on scrambling permutations. Random Struct. Algorithms 22(4): 435-439 (2003)
• 
  Kyle Siegrist:
  Renewal processes on partially ordered sets. Random Struct. Algorithms 22(1): 15-32 (2003)