default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 56
Volume 56, Number 1, January 2020
Issue Information
- Issue information. 1-2
- Michal Karonski:
Thirty years... 3-4
- Nati Linial, Jonathan Mosheiff
:
On the weight distribution of random binary linear codes. 5-36 - Hüseyin Acan, Boris G. Pittel:
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. 37-62 - Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla, Paul Smith:
Nucleation and growth in two dimensions. 63-96 - Chris Dowden, Mihyun Kang, Michael Krivelevich:
The genus of the Erdős-Rényi random graph and the fragile genus property. 97-121 - Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
Powers of Hamiltonian cycles in randomly augmented graphs. 122-141 - Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. 142-153 - Steven Heilman:
A periodic isoperimetric problem related to the unique games conjecture. 154-168 - Felix Joos, Jaehoon Kim:
Spanning trees in randomly perturbed graphs. 169-219 - Richard W. Kenyon, Daniel Král', Charles Radin, Peter Winkler:
Permutations with fixed pattern densities. 220-250 - Yizhe Zhu:
A graphon approach to limiting spectral distributions of Wigner-type matrices. 251-279
Volume 56, Number 2, March 2020
- Issue information. 281-282
- Wojciech Samotij, Clara Shikhelman:
A generalized Turán problem in random graphs. 283-305 - Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein:
Regularity inheritance in pseudorandom graphs. 306-338 - Wiebke Bedenknecht, Christian Reiher:
Squares of Hamiltonian cycles in 3-uniform hypergraphs. 339-372 - Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang dynamics for general graphs in the tree uniqueness region. 373-400 - Nicolas Broutin, Jean-François Marckert:
The combinatorics of the colliding bullets. 401-431 - Krzysztof Burdzy, Soumik Pal:
Twin peaks. 432-460 - Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel:
Vanishing of cohomology groups of random simplicial complexes. 461-500 - Nathanaël Enriquez, Gabriel Faraud, Laurent Ménard:
Limiting shape of the depth first search tree in an Erdős-Rényi graph. 501-516 - Reza Gheissari, Eyal Lubetzky:
Quasi-polynomial mixing of critical two-dimensional random cluster models. 517-556 - Tim Hulshof, Asaf Nachmias:
Slightly subcritical hypercube percolation. 557-593
Volume 56, Number 3, May 2020
- Issue information. 595-596
- Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase transitions of the Moran process and algorithmic consequences. 597-647 - Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic:
Semi-random graph process. 648-675 - Shankar Bhamidi, Sanchayan Sen:
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees. 676-721 - Junyu Cao, Mariana Olvera-Cravioto:
Connectivity of a general class of inhomogeneous random digraphs. 722-774 - John Haslegrave, Jonathan H. Jordan, Mark Yarrow:
Condensation in preferential attachment models with location-based choice. 775-795 - Tobias Johnson, Moumanti Podder, Fiona Skerman:
Random tree recursions: Which fixed points correspond to tangible sets of trees? 796-837 - Matthew Kahle, Francisco Martinez-Figueroa:
The chromatic number of random Borsuk graphs. 838-850 - Kevin Leckey, Dieter Mitsche, Nick Wormald:
The height of depth-weighted random recursive trees. 851-866 - Ljuben R. Mutafchiev, Mladen Savov:
On the maximal multiplicity of block sizes in a random set partition. 867-891 - Marc Noy, Clément Requilé, Juanjo Rué:
Further results on random cubic planar graphs. 892-924
Volume 56, Number 4, July 2020
- Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Asymptotics in percolation on high-girth expanders. 927-947 - Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký:
Almost all trees are almost graceful. 948-987 - Michael Anastos, Alan M. Frieze:
On the connectivity of proper colorings of random graphs and hypergraphs. 988-997 - Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun assembly of random jigsaw puzzles. 998-1015 - Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
Counting restricted orientations of random graphs. 1016-1030 - Stefan Glock, Felix Joos:
A rainbow blow-up lemma. 1031-1069 - Svante Janson:
Asymptotic normality in random graphs with given vertex degrees. 1070-1116 - Mihyun Kang, Michael Moßhammer, Philipp Sprüssel:
Phase transitions in graphs on orientable surfaces. 1117-1170 - Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus:
Rainbow structures in locally bounded colorings of graphs. 1171-1204 - Hunter Spink, Marius Tiba:
Judiciously 3-partitioning 3-uniform hypergraphs. 1205-1221
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-08 09:52 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:
