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

• 2022
• 
  Dylan J. Altschuler, Jonathan Niles-Weed:
  The discrepancy of random rectangular matrices. Random Struct. Algorithms 60(4): 551-593 (2022)
• 
  Michael Anastos, Alan M. Frieze:
  A scaling limit for the length of the longest cycle in a sparse random digraph. Random Struct. Algorithms 60(1): 3-24 (2022)
• 
  Martin Balko, Manfred Scheucher, Pavel Valtr:
  Holes and islands in random point sets. Random Struct. Algorithms 60(3): 308-326 (2022)
• 
  Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot:
  Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms 60(2): 166-200 (2022)
• 
  Jason A. Behrstock, Victor Falgas-Ravry, Tim Susse:
  Square percolation and the threshold for quadratic divergence in random right-angled Coxeter groups. Random Struct. Algorithms 60(4): 594-630 (2022)
• 
  Gabriel Berzunza, Cecilia Holmgren:
  The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. Random Struct. Algorithms 60(4): 631-652 (2022)
• 
  Shankar Bhamidi, Ruituo Fan, Nicolas Fraiman, Andrew B. Nobel:
  Community modulated recursive trees and population dependent branching processes. Random Struct. Algorithms 60(2): 201-232 (2022)
• 
  Bhaswar B. Bhattacharya, Xiao Fang, Han Yan:
  Normal approximation and fourth moment theorems for monochromatic triangles. Random Struct. Algorithms 60(1): 25-53 (2022)
• 
  François Bienvenu, Amaury Lambert, Mike A. Steel:
  Combinatorial and stochastic properties of ranked tree-child networks. Random Struct. Algorithms 60(4): 653-689 (2022)
• 
  Elia Bisi, Fabio Deelan Cunden, Shane Gibbons, Dan Romik:
  The oriented swap process and last passage percolation. Random Struct. Algorithms 60(4): 690-715 (2022)
• 
  Matija Bucic, Jacob Fox, Benny Sudakov:
  Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60(3): 327-338 (2022)
• 
  Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
  Factors in randomly perturbed hypergraphs. Random Struct. Algorithms 60(2): 153-165 (2022)
• 
  Nikolaos Fountoulakis, Michal Przykucki:
  Algebraic and combinatorial expansion in random simplicial complexes. Random Struct. Algorithms 60(3): 339-366 (2022)
• 
  Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
  Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms 60(3): 289-307 (2022)
• 
  Robert Hancock, Andrew Treglown:
  An asymmetric random Rado theorem for single equations: The 0-statement. Random Struct. Algorithms 60(4): 529-550 (2022)
• 
  Benjamin T. Hansen, Tobias Müller:
  The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2. Random Struct. Algorithms 60(1): 54-67 (2022)
• 
  Remco van der Hofstad, Júlia Komjáthy, Viktória Vadon:
  Phase transition in random intersection graphs with communities. Random Struct. Algorithms 60(3): 406-461 (2022)
• 
  Shu Kanazawa:
  Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes. Random Struct. Algorithms 60(1): 68-105 (2022)
• 
  Mihyun Kang, Michael Missethan:
  Longest and shortest cycles in random planar graphs. Random Struct. Algorithms 60(3): 462-505 (2022)
• 
  Lázaro Alberto Larrauri, Tobias Müller, Marc Noy:
  Limiting probabilities of first order properties of random sparse graphs and hypergraphs. Random Struct. Algorithms 60(3): 506-526 (2022)
• 
  Mikolaj Marciniak:
  Hydrodynamic limit of the Robinson-Schensted-Knuth algorithm. Random Struct. Algorithms 60(1): 106-116 (2022)
• 
  Frank Mousset, Nemanja Skoric, Milos Trujic:
  Covering cycles in sparse graphs. Random Struct. Algorithms 60(4): 716-748 (2022)
• 
  Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
  Approximating the distance to monotonicity of Boolean functions. Random Struct. Algorithms 60(2): 233-260 (2022)
• 
  Cosmin Pohoata, Oliver Roche-Newton:
  Four-term progression free sets with three-term progressions in all large subsets. Random Struct. Algorithms 60(4): 749-770 (2022)
• 
  Gonzalo Fiz Pontiveros, Simon Griffiths, Matheus Secco, Oriol Serra:
  Deviation probabilities for arithmetic progressions and other regular discrete structures. Random Struct. Algorithms 60(3): 367-405 (2022)
• 
  Michal Przykucki, Alexander Roberts, Alex Scott:
  Shotgun reconstruction in the hypercube. Random Struct. Algorithms 60(1): 117-150 (2022)
• 
  Benny Sudakov, István Tomon, Adam Zsolt Wagner:
  Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022)