default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 47
Volume 47, Number 1, August 2015
- Béla Bollobás, Paul Smith, Andrew J. Uzzell:
The time of bootstrap percolation with dense initial sets for all thresholds. 1-29 - Nicolas Curien, Grégory Miermont:
Uniform infinite planar quadrangulations with a boundary. 30-58 - Bobby DeMarco, Jeff Kahn:
Mantel's theorem for random graphs. 59-72 - Alan M. Frieze
, Simi Haber:
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. 73-98 - Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A tail bound for read-k families of functions. 99-108 - Eyal Lubetzky, Yufei Zhao:
On replica symmetry of large deviations in random graphs. 109-146 - Jie Ma, Humberto Naves, Benny Sudakov:
Discrepancy of random graphs and hypergraphs. 147-162 - Will Perkins:
Random k-SAT and the power of two choices. 163-173 - Oliver Riordan, Lutz Warnke:
The evolution of subcritical Achlioptas processes. 174-203
Volume 47, Number 2, September 2015
- Yufei Zhao:
Hypergraph limits: A regularity approach. 205-226 - Leonid V. Bogachev:
Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts. 227-266 - Emmanuel Boissard, Serge Cohen, Thibault Espinasse, James Norris:
Diffusivity of a random walk on random walks. 267-283 - 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. 284-303 - Nicolas Curien, Bénédicte Haas, Igor Kortchemski:
The CRT is the scaling limit of random dissections. 304-327 - Michael Damron, Charles M. Newman, Vladas Sidoravicius:
Absence of site percolation at criticality in ℤ2×{0, 1}. 328-340 - Pu Gao:
Sandwiching a densest subgraph by consecutive cores. 341-360 - Christian Hirsch:
A Harris-Kesten theorem for confetti percolation. 361-385 - Suguru Tamaki, Yuichi Yoshida:
A query efficient non-adaptive long code test with perfect completeness. 386-406
Volume 47, Number 3, October 2015
- Danila D. Cherkashin, Jakub Kozik:
A note on random greedy coloring of uniform hypergraphs. 407-413 - Enrique D. Andjel, Maria Eulalia Vares:
First passage percolation and escape strategies. 414-423 - Ágnes Backhausz, Balázs Szegedy, Bálint Virág:
Ramanujan graphings and correlation decay in local algorithms. 424-435 - Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. 436-486 - Jeff Cooper, Dhruv Mubayi:
List coloring triangle-free hypergraphs. 487-519 - Péter Gács:
Clairvoyant embedding in one dimension. 520-560 - Jonas Kahn:
How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains. 561-587 - Raphaël Lachièze-Rey:
Realisability conditions for second-order marginals of biphased media. 588-604 - Shachar Lovett, Cristopher Moore, Alexander Russell:
Group representations that resist random sampling. 605-614
Volume 47, Number 4, December 2015
- Asaf Ferber, Michael Krivelevich, Humberto Naves:
Generating random graphs in biased Maker-Breaker games. 615-634 - Brigitte Chauvin, Danièle Gardy, Cécile Mailler:
A sprouting tree model for random boolean functions. 635-662 - Bobby DeMarco, Jeff Kahn:
Note on a problem of M. Talagrand. 663-668 - Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser:
Hierarchical routing over dynamic wireless networks. 669-709 - Henk Don:
New methods to bound the critical probability in fractal percolation. 710-730 - Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree. 731-759 - Yuval Peres, Kunal Talwar, Udi Wieder:
Graphical balanced allocations and the (1 + β)-choice process. 760-775 - Jakub Przybylo:
Asymptotically optimal neighbour sum distinguishing colourings of graphs. 776-791 - Van H. Vu, Ke Wang:
Random weighted projections, random quadratic forms and random eigenvectors. 792-821
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-11 21: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:
