default search action
Random Structures and Algorithms, Volume 42
Volume 42, Number 1, January 2013
- Christian Borgs
, Jennifer T. Chayes
Left and right convergence of graphs with bounded degree. 1-28 - Peter Allen, Julia Böttcher
Turánnical hypergraphs. 29-58 - David Coupier, Viet-Chi Tran
The 2D-directed spanning forest is almost surely a tree. 59-72 - Sandrine Dasse-Hartaut, Pawel Hitczenko
Greek letters in random staircase tableaux. 73-96 - Gianluca De Marco
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness. 97-109 - Linh V. Tran, Van H. Vu, Ke Wang
Sparse random graphs: Eigenvalues and eigenvectors. 110-134
Volume 42, Number 2, March 2013
- Colin Cooper, Alan M. Frieze
Component structure of the vacant set induced by a random walk on a random graph. 135-158 - Jose H. Blanchet, Alexandre Stauffer
Characterizing optimal sampling of binary contingency tables via the configuration model. 159-184 - Tobias Friedrich, Lionel Levine
Fast simulation of large-scale growth models. 185-213 - Jaroslaw Grytczuk
New approach to nonrepetitive sequences. 214-225 - Günter Last
Percolation and limit theory for the poisson lilypond model. 226-249 - Will Perkins
The forgetfulness of balls and bins. 250-267
Volume 42, Number 3, May 2013
- Subhash Khot, Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities. 269-300 - Alexander I. Barvinok, J. A. Hartigan:
The number of graphs and a random graph with a given degree sequence. 301-348 - Frédérique Bassino
Statistical properties of subgroups of free groups. 349-373 - Andrzej Dudek, Alan M. Frieze
Tight Hamilton cycles in random uniform hypergraphs. 374-385 - Yakir Reshef, Salil P. Vadhan:
On extractors and exposure-resilient functions for sublogarithmic entropy. 386-401
Volume 42, Number 4, July 2013
- Persi Diaconis, Philip Matchett Wood:
Random doubly stochastic tridiagonal matrices. 403-437 - Omer Giménez, Marc Noy, Juan José Rué
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. 438-479 - Remco van der Hofstad
Critical behavior in inhomogeneous random graphs. 480-508 - Shoham Letzter
The property of having a k -regular subgraph has a sharp threshold. 509-519 - Mario Ullrich
Comparison of Swendsen-Wang and heat-bath dynamics. 520-535
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 2024-11-04 20:33 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: