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

• 1991
• 
  Noga Alon:
  A Parallel Algorithmic Version of the Local Lemma. Random Struct. Algorithms 2(4): 367-378 (1991)
• 
  Noga Alon, Colin McDiarmid, Bruce A. Reed:
  Acyclic Coloring of Graphs. Random Struct. Algorithms 2(3): 277-288 (1991)
• 
  József Beck:
  Quasi-Random 2-Colorings of Point Sets. Random Struct. Algorithms 2(3): 289-302 (1991)
• 
  József Beck:
  An Algorithmic Approach to the Lovász Local Lemma. I. Random Struct. Algorithms 2(4): 343-366 (1991)
• 
  J. van den Berg, Ronald W. J. Meester:
  Stability Properties of a Flow Process in Graphs. Random Struct. Algorithms 2(3): 335-342 (1991)
• 
  Béla Bollobás, Alan M. Frieze:
  Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms 2(2): 225-232 (1991)
• 
  Fan R. K. Chung:
  Regularity Lemmas for Hypergraphs and Quasi-randomness. Random Struct. Algorithms 2(2): 241-252 (1991)
• 
  Vasek Chvátal:
  Almost All Graphs with 1.44n Edges are 3-Colorable. Random Struct. Algorithms 2(1): 11-28 (1991)
• 
  Luc Devroye:
  Limit Laws for Local Counters in Random Binary Search Tree. Random Struct. Algorithms 2(3): 303-316 (1991)
• 
  Peter Dolan:
  A Zero-One Law for Random Subset. Random Struct. Algorithms 2(3): 317-326 (1991)
• 
  Michael Drmota, Peter Kirschenhofer:
  On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2(2): 187-208 (1991)
• 
  Martin E. Dyer, Alan M. Frieze:
  Randomized Greedy Matching. Random Struct. Algorithms 2(1): 29-46 (1991)
• 
  Martin E. Dyer, Alan M. Frieze:
  Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. Random Struct. Algorithms 2(2): 233-240 (1991)
• 
  Paul Erdös, Henry A. Kierstead, William T. Trotter:
  The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991)
• 
  William M. Y. Goh, Eric Schmutz:
  A Central Limit Theorem on GL_n /F_q). Random Struct. Algorithms 2(1): 47-54 (1991)
• 
  Svante Janson, Jan Kratochvíl:
  Proportional Graphs. Random Struct. Algorithms 2(2): 209-224 (1991)
• 
  Guy Louchard, René Schott:
  Probabilistic Analysis of Some Distributed Algorithms. Random Struct. Algorithms 2(2): 151-186 (1991)
• 
  Tomasz Luczak:
  Cycles in a Random Graph Near the Critical Point. Random Struct. Algorithms 2(4): 421-441 (1991)
• 
  Tomasz Luczak, Joel E. Cohen:
  Stability of Vertices in Random Boolean Cellular Automata. Random Struct. Algorithms 2(3): 327-334 (1991)
• 
  Robert S. Maier:
  Colliding Stacks: A Large Deviations Analysis. Random Struct. Algorithms 2(4): 379-420 (1991)
• 
  Nicholas Pippenger:
  The Blocking Probability of Spider-Web Networks. Random Struct. Algorithms 2(2): 121-150 (1991)
• 
  Hans Jürgen Prömel, Angelika Steger:
  Excluding Induced Subgraphs: Quadrilaterals. Random Struct. Algorithms 2(1): 55-72 (1991)
• 
  A. F. Sidorenko:
  Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices. Random Struct. Algorithms 2(1): 73-100 (1991)
• 
  Miklós Simonovits, Vera T. Sós:
  Szemerédi's Partition and Quasirandomness. Random Struct. Algorithms 2(1): 1-10 (1991)
• 
  Yu Zhang:
  A Power Law for Connectedness of Some Random Graphs at the Critical Point. Random Struct. Algorithms 2(1): 101-120 (1991)