default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 55
Volume 55, Number 1, August 2019
- Issue information. 1-2
- Remco van der Hofstad
, Svante Janson, Malwina J. Luczak:
Component structure of the configuration model: Barely supercritical case. 3-55 - Arvind Ayyer, Svante Linusson:
Reverse juggling processes. 56-72 - Eric Blais, Yuichi Yoshida:
A characterization of constant-sample testable properties. 73-88 - Maurits de Graaf, Richard J. Boucherie, Johann L. Hurink, Jan-Kees C. W. van Ommeren:
An average case analysis of the minimum spanning tree heuristic for the power assignment problem. 89-103 - Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. 104-124 - Michael Drmota, Emma Yu Jin, Benedikt Stufler:
Graph limits of random graphs from a subset of connected k-trees. 125-152 - Vance Faber, David G. Harris:
Edge-coloring linear hypergraphs with medium-sized edges. 153-159 - Bernardo N. B. de Lima, Leonardo T. Rolla, Daniel Valesin:
Monotonicity and phase diagram for multirange percolation on oriented trees. 160-172 - Christian Táfula:
An extension of the Erdős-Tetali theorem. 173-214 - Alessandro Zocca:
Tunneling of the hard-core model on finite triangular lattices. 215-246
Volume 55, Number 2, September 2019
- Issue information. 247-248
- Svante Janson:
Patterns in random permutations avoiding the pattern 321. 249-270 - Matthew Coulson, Guillem Perarnau:
Rainbow matchings in Dirac bipartite graphs. 271-289 - Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. 290-312 - Shirshendu Ganguly, Fabio Martinelli:
Upper triangular matrix walk: Cutoff for finitely many columns. 313-341 - Alexander V. Gnedin, Vadim Gorin:
Spherically symmetric random permutations. 342-355 - Mark Huber:
An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance. 356-370 - Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
On the optimality of the uniform random strategy. 371-401 - Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for forbidden order patterns in an array. 402-426 - Elie de Panafieu:
Analytic combinatorics of connected graphs. 427-495 - Benedikt Stufler:
The continuum random tree is the scaling limit of unlabeled unrooted trees. 496-528
Volume 55, Number 3, October 2019
- Issue information. 529-530
- Hüseyin Acan, Jeff Kahn:
Disproof of a packing conjecture of Alon and Spencer. 531-544 - Daniel Ahlberg, Maria Deijfen, Svante Janson:
Competing first passage percolation on random graphs with finite variance degrees. 545-559 - Marek Biskup, Jeffrey Lin:
Sharp asymptotic for the chemical distance in long-range percolation. 560-583 - Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial mixing and nonlocal Markov chains. 584-614 - Ariane Carrance:
Uniform random colored complexes. 615-648 - Alan M. Frieze, Wesley Pegden:
Traveling in randomly embedded random graphs. 649-676 - Nati Linial, Yuval Peled:
Enumeration and randomized constructions of hypertrees. 677-695 - Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Asymmetry and structural information in preferential attachment graphs. 696-718 - Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random d-regular graphs. 719-741 - Sigurdur Örn Stefánsson, Benedikt Stufler:
Geometry of large Boltzmann outerplanar maps. 742-771
Volume 55, Number 4, December 2019
- Issue information. 773-774
- Matas Sileikis, Lutz Warnke:
A counterexample to the DeMarco-Kahn upper tail conjecture. 775-794 - Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota:
Powers of tight Hamilton cycles in randomly perturbed hypergraphs. 795-807 - Carina Betken, Hanna Döring, Marcel Ortgiese:
Fluctuations in a general preferential attachment model via Stein's method. 808-830 - Bhaswar B. Bhattacharya, Sumit Mukherjee:
Limit theorems for monochromatic stars. 831-853 - Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person:
Universality for bounded degree spanning trees in randomly perturbed graphs. 854-864 - Colin Cooper, Alan M. Frieze, Wesley Pegden:
Minors of a random binary matroid. 865-880 - Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger:
Bootstrap percolation with inhibition. 881-925 - Zur Luria, Michael Simkin:
On the threshold problem for Latin boxes. 926-949 - Arès Méroueh, Andrew Thomason:
List colorings of multipartite hypergraphs. 950-979 - Ali Pourmiri:
Balanced allocation on graphs: A random walk approach. 980-1009
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
