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

• 1999
• 
  Dimitris Achlioptas, Ehud Friedgut:
  A Sharp Threshold for k-Colorability. Random Struct. Algorithms 14(1): 63-70 (1999)
• 
  Paul Balister, Béla Bollobás, Alan Stacey:
  Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999)
• 
  Alexander I. Barvinok:
  Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor. Random Struct. Algorithms 14(1): 29-61 (1999)
• 
  Edward A. Bender, Kevin J. Compton, L. Bruce Richmond:
  0-1 laws for maps. Random Struct. Algorithms 14(3): 215-237 (1999)
• 
  Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
  Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999)
• 
  Colin Cooper:
  Asymptotics for dependent sums of random vectors. Random Struct. Algorithms 14(3): 267-292 (1999)
• 
  Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf:
  On the multiplicity of parts in a random partition. Random Struct. Algorithms 14(2): 185-197 (1999)
• 
  Luc Devroye, Carlos Zamora-Cura:
  On the complexity of branch-and-bound search for random trees. Random Struct. Algorithms 14(4): 309-327 (1999)
• 
  Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow:
  A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14(2): 153-184 (1999)
• 
  Shao C. Fang, Santosh S. Venkatesh:
  Learning finite binary sequences from half-space data. Random Struct. Algorithms 14(4): 345-381 (1999)
• 
  Pawel Hitczenko, Svante Janson, Joseph E. Yukich:
  On the variance of the random sphere of influence graph. Random Struct. Algorithms 14(2): 139-152 (1999)
• 
  Ravi Kannan, Prasad Tetali, Santosh S. Vempala:
  Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14(4): 293-308 (1999)
• 
  Elon Lindenstrauss:
  Indistinguishable Sceneries. Random Struct. Algorithms 14(1): 71-86 (1999)
• 
  Michael Lomonosov, Yoseph Shpungin:
  Combinatorics of reliability Monte Carlo. Random Struct. Algorithms 14(4): 329-343 (1999)
• 
  Gregory L. McColm:
  First order zero-one laws for random graphs on the circle. Random Struct. Algorithms 14(3): 239-266 (1999)
• 
  Yuri Rabinovich, Avi Wigderson:
  Techniques for bounding the convergence rate of genetic algorithms. Random Struct. Algorithms 14(2): 111-138 (1999)
• 
  Michel Talagrand:
  Self averaging and the space of interactions in neural networks. Random Struct. Algorithms 14(3): 199-213 (1999)