• 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

• 2011
• 
  Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi:
  On the solution-space geometry of random constraint satisfaction problems. Random Struct. Algorithms 38(3): 251-268 (2011)
• 
  József Balogh, Jane Butterfield:
  Excluding induced subgraphs: Critical graphs. Random Struct. Algorithms 38(1-2): 100-120 (2011)
• 
  József Balogh, Béla Csaba, Wojciech Samotij:
  Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38(1-2): 121-139 (2011)
• 
  Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
  Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011)
• 
  Béla Bollobás, Svante Janson, Oliver Riordan:
  On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011)
• 
  Béla Bollobás, Svante Janson, Oliver Riordan:
  Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011)
• 
  Colin Cooper, Alan M. Frieze:
  The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011)
• 
  Colin Cooper, Pawel Pralat:
  Scale-free graphs of increasing degree. Random Struct. Algorithms 38(4): 396-421 (2011)
• 
  Andrzej Czygrinow, Brendan Nagle:
  On random sampling in uniform hypergraphs. Random Struct. Algorithms 38(4): 422-440 (2011)
• 
  Luc Devroye, Svante Janson:
  Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. Random Struct. Algorithms 38(4): 381-395 (2011)
• 
  Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
  First-passage percolation on a ladder graph, and the path cost in a VCG auction. Random Struct. Algorithms 38(3): 350-364 (2011)
• 
  Jacob Fox, Benny Sudakov:
  Dependent random choice. Random Struct. Algorithms 38(1-2): 68-99 (2011)
• 
  Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu:
  Nonrepetitive list colourings of paths. Random Struct. Algorithms 38(1-2): 162-173 (2011)
• 
  Mihyun Kang, Colin McDiarmid:
  Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38(1-2): 174-204 (2011)
• 
  Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald:
  Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011)
• 
  Krzysztof Latuszynski, Ioannis Kosmidis, Omiros Papaspiliopoulos, Gareth O. Roberts:
  Simulating events of unknown probabilities via reverse time martingales. Random Struct. Algorithms 38(4): 441-452 (2011)
• 
  Mohammad Mahdian, Ying Xu:
  Stochastic kronecker graphs. Random Struct. Algorithms 38(4): 453-466 (2011)
• 
  Jean-François Marckert, Grégory Miermont:
  The CRT is the scaling limit of unordered binary trees. Random Struct. Algorithms 38(4): 467-501 (2011)
• 
  Wesley Pegden:
  Highly nonrepetitive sequences: Winning strategies from the local lemma. Random Struct. Algorithms 38(1-2): 140-161 (2011)
• 
  Ron Peled, Ariel Yadin, Amir Yehudayoff:
  The maximal probability that k-wise independent bits are all 1. Random Struct. Algorithms 38(4): 502-525 (2011)
• 
  Katarzyna Rybarczyk:
  Equivalence of a random intersection graph and G(n, p). Random Struct. Algorithms 38(1-2): 205-234 (2011)
• 
  Linh V. Tran:
  Piercing random boxes. Random Struct. Algorithms 38(3): 365-380 (2011)