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

• 2015
• 
  Enrique D. Andjel, Maria Eulalia Vares:
  First passage percolation and escape strategies. Random Struct. Algorithms 47(3): 414-423 (2015)
• 
  Ágnes Backhausz, Balázs Szegedy, Bálint Virág:
  Ramanujan graphings and correlation decay in local algorithms. Random Struct. Algorithms 47(3): 424-435 (2015)
• 
  Leonid V. Bogachev:
  Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts. Random Struct. Algorithms 47(2): 227-266 (2015)
• 
  Emmanuel Boissard, Serge Cohen, Thibault Espinasse, James Norris:
  Diffusivity of a random walk on random walks. Random Struct. Algorithms 47(2): 267-283 (2015)
• 
  Béla Bollobás, Paul Smith, Andrew J. Uzzell:
  The time of bootstrap percolation with dense initial sets for all thresholds. Random Struct. Algorithms 47(1): 1-29 (2015)
• 
  Brigitte Chauvin, Danièle Gardy, Cécile Mailler:
  A sprouting tree model for random boolean functions. Random Struct. Algorithms 47(4): 635-662 (2015)
• 
  Danila D. Cherkashin, Jakub Kozik:
  A note on random greedy coloring of uniform hypergraphs. Random Struct. Algorithms 47(3): 407-413 (2015)
• 
  Amin Coja-Oghlan, Charilaos Efthymiou:
  On independent sets in random graphs. Random Struct. Algorithms 47(3): 436-486 (2015)
• 
  Jeff Cooper, Dhruv Mubayi:
  List coloring triangle-free hypergraphs. Random Struct. Algorithms 47(3): 487-519 (2015)
• 
  Endre Csóka, Balázs Gerencsér, Viktor Harangi, Bálint Virág:
  Invariant Gaussian processes and independent sets on regular graphs of large girth. Random Struct. Algorithms 47(2): 284-303 (2015)
• 
  Nicolas Curien, Bénédicte Haas, Igor Kortchemski:
  The CRT is the scaling limit of random dissections. Random Struct. Algorithms 47(2): 304-327 (2015)
• 
  Nicolas Curien, Grégory Miermont:
  Uniform infinite planar quadrangulations with a boundary. Random Struct. Algorithms 47(1): 30-58 (2015)
• 
  Michael Damron, Charles M. Newman, Vladas Sidoravicius:
  Absence of site percolation at criticality in ℤ2×{0, 1}. Random Struct. Algorithms 47(2): 328-340 (2015)
• 
  Bobby DeMarco, Jeff Kahn:
  Mantel's theorem for random graphs. Random Struct. Algorithms 47(1): 59-72 (2015)
• 
  Bobby DeMarco, Jeff Kahn:
  Note on a problem of M. Talagrand. Random Struct. Algorithms 47(4): 663-668 (2015)
• 
  Henk Don:
  New methods to bound the critical probability in fractal percolation. Random Struct. Algorithms 47(4): 710-730 (2015)
• 
  Asaf Ferber, Michael Krivelevich, Humberto Naves:
  Generating random graphs in biased Maker-Breaker games. Random Struct. Algorithms 47(4): 615-634 (2015)
• 
  Alan M. Frieze, Simi Haber:
  An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. Random Struct. Algorithms 47(1): 73-98 (2015)
• 
  Péter Gács:
  Clairvoyant embedding in one dimension. Random Struct. Algorithms 47(3): 520-560 (2015)
• 
  Pu Gao:
  Sandwiching a densest subgraph by consecutive cores. Random Struct. Algorithms 47(2): 341-360 (2015)
• 
  Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
  A tail bound for read-k families of functions. Random Struct. Algorithms 47(1): 99-108 (2015)
• 
  Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
  Randomly coloring planar graphs with fewer colors than the maximum degree. Random Struct. Algorithms 47(4): 731-759 (2015)
• 
  Christian Hirsch:
  A Harris-Kesten theorem for confetti percolation. Random Struct. Algorithms 47(2): 361-385 (2015)
• 
  Jonas Kahn:
  How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains. Random Struct. Algorithms 47(3): 561-587 (2015)
• 
  Raphaël Lachièze-Rey:
  Realisability conditions for second-order marginals of biphased media. Random Struct. Algorithms 47(3): 588-604 (2015)
• 
  Shachar Lovett, Cristopher Moore, Alexander Russell:
  Group representations that resist random sampling. Random Struct. Algorithms 47(3): 605-614 (2015)
• 
  Eyal Lubetzky, Yufei Zhao:
  On replica symmetry of large deviations in random graphs. Random Struct. Algorithms 47(1): 109-146 (2015)
• 
  Jie Ma, Humberto Naves, Benny Sudakov:
  Discrepancy of random graphs and hypergraphs. Random Struct. Algorithms 47(1): 147-162 (2015)
• 
  Yuval Peres, Kunal Talwar, Udi Wieder:
  Graphical balanced allocations and the (1 + β)-choice process. Random Struct. Algorithms 47(4): 760-775 (2015)
• 
  Will Perkins:
  Random k-SAT and the power of two choices. Random Struct. Algorithms 47(1): 163-173 (2015)

skipping 6 more matches