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

• 1999
• 
  Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson:
  Scaling limits for minimal and random spanning trees in two dimensions. Random Struct. Algorithms 15(3-4): 319-367 (1999)
• 
  David J. Aldous, Jim Pitman:
  A family of random trees with random edge lengths. Random Struct. Algorithms 15(2): 176-195 (1999)
• 
  Tom Bohman, Janko Gravner:
  Random threshold growth dynamics. Random Struct. Algorithms 15(1): 93-111 (1999)
• 
  Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer:
  Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Struct. Algorithms 15(3-4): 368-413 (1999)
• 
  Jennifer T. Chayes, Dana Randall:
  Foreword. Random Struct. Algorithms 15(3-4): 209 (1999)
• 
  Colin Cooper, Alan M. Frieze:
  Mixing properties of the Swendsen-Wang process on classes of graphs. Random Struct. Algorithms 15(3-4): 242-261 (1999)
• 
  Don Coppersmith, Gregory B. Sorkin:
  Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algorithms 15(2): 113-144 (1999)
• 
  Hans Garmo:
  The asymptotic distribution of long cycles in random regular graphs. Random Struct. Algorithms 15(1): 43-92 (1999)
• 
  Olle Häggström, Robin Pemantle:
  On near-critical and dynamical percolation in the tree case. Random Struct. Algorithms 15(3-4): 311-318 (1999)
• 
  Richard M. Karp, Claire Kenyon, Orli Waarts:
  Error-resilient DNA computation. Random Struct. Algorithms 15(3-4): 450-466 (1999)
• 
  Guy Louchard:
  Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes. Random Struct. Algorithms 15(1): 1-23 (1999)
• 
  Michael Luby, Eric Vigoda:
  Fast convergence of the Glauber dynamics for sampling independent sets. Random Struct. Algorithms 15(3-4): 229-241 (1999)
• 
  Heinrich Matzinger:
  Reconstructing a three-color scenery by observing it along a simple random walk path. Random Struct. Algorithms 15(2): 196-207 (1999)
• 
  Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror Troyansky:
  2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. Random Struct. Algorithms 15(3-4): 414-435 (1999)
• 
  S. Nanda, Charles M. Newman:
  Random nearest neighbor and influence graphs on Z^d. Random Struct. Algorithms 15(3-4): 262-278 (1999)
• 
  Ralph Neininger, Ludger Rüschendorf:
  On the internal path length of d-dimensional quad trees. Random Struct. Algorithms 15(1): 25-41 (1999)
• 
  Mathew D. Penrose:
  On k-connectivity for a geometric random graph. Random Struct. Algorithms 15(2): 145-164 (1999)
• 
  Boris G. Pittel, Robert S. Weishaar:
  The random bipartite nearest neighbor graphs. Random Struct. Algorithms 15(3-4): 279-310 (1999)
• 
  Wansoo T. Rhee:
  Some exact rates for the random weighted interval packing problem. Random Struct. Algorithms 15(2): 165-175 (1999)
• 
  Michel Talagrand:
  Intersecting random half cubes. Random Struct. Algorithms 15(3-4): 436-449 (1999)
• 
  Dominic Welsh:
  The Tutte polynomial. Random Struct. Algorithms 15(3-4): 210-228 (1999)