default search action
Random Structures and Algorithms, Volume 49
Volume 49, Number 1, August 2016
- Boris G. Pittel, Daniel J. Poole:
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs. 3-64 - Michel Bode, Nikolaos Fountoulakis
, Tobias Müller:
The probability of connectivity in a hyperbolic model of complex networks. 65-94 - Nicolas Broutin, Olivier Devillers
Efficiently navigating a random Delaunay triangulation. 95-136 - Josep Díaz, Leslie Ann Goldberg, David Richerby
Absorption time of the Moran process. 137-159 - Nathanaël Enriquez, Laurent Ménard:
Spectra of large diluted but bushy random graphs. 160-184 - Abbas Mehrabian, Ali Pourmiri
Randomized rumor spreading in poorly connected small-world networks. 185-208
Volume 49, Number 2, September 2016
- Omer Angel, Asaf Nachmias, Gourab Ray:
Random walks on stochastic hyperbolic half planar triangulations. 213-234 - Alessandro Arlotto, Elchanan Mossel, J. Michael Steele:
Quickest online selection of an increasing subsequence of specified size. 235-252 - Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen:
Juntas in the ℓ1-grid and Lipschitz maps between discrete tori. 253-279 - Eli Ben-Sasson, Michael Viderman:
A combinatorial characterization of smooth LTCs and applications. 280-307 - Maurício Collares Neto, Robert Morris:
Maximum-size antichains in random set-systems. 308-321 - David G. Harris, Ehab Morsy, Gopal Pandurangan
Efficient computation of sparse structures. 322-344 - Dan Hefetz
Random directed graphs are robustly Hamiltonian. 345-362 - John Lenz, Dhruv Mubayi, Richard Mycroft:
Hamilton cycles in quasirandom hypergraphs. 363-378 - Sayan Mukherjee, John Steenbergen:
Random walks on simplicial complexes and harmonics. 379-405
Volume 49, Number 3, October 2016
- Robin Pemantle, Yuval Peres, Igor Rivin:
Four random permutations conjugated by an adversary generate Sn with high probability. 409-428 - Paul Balister
Barrier Coverage. 429-478 - Patrick Bennett
A note on the random greedy independent set algorithm. 479-502 - Sébastien Bubeck, Jian Ding, Ronen Eldan, Miklós Z. Rácz:
Testing for high-dimensional geometry in random graphs. 503-532 - Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in random graphs. 533-557 - Rajko Nenadov
On the threshold for the Maker-Breaker H-game. 558-578 - Kenta Oono, Yuichi Yoshida:
Testing properties of functions on finite groups. 579-598 - Neal Madras, Lerna Pehlivan
Structure of random 312-avoiding permutations. 599-631
Volume 49, Number 4, December 2016
Research Articles
- Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding Hamilton cycles in random graphs with few queries. 635-668 - József Balogh, Theodore Molla, Maryam Sharifzadeh:
Triangle factors of graphs without large independent sets and of weighted graphs. 669-693 - Victor Bapst, Amin Coja-Oghlan:
Harnessing the Bethe free energy. 694-741 - Varsha Dani
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. 742-765 - Jonas Groschwitz, Tibor Szabó:
Sharp thresholds for half-random games I. 766-794 - Amanda Lohss:
The asymptotic distribution of symbols on diagonals of random weighted staircase tableaux. 795-818 - Olaf Parczyk
Spanning structures and universality in sparse hypergraphs. 819-844 - József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Applications of graph containers in the Boolean lattice. 845-872
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-12-31 21:50 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: