default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 45
Volume 45, Number 1, August 2014
- Lionel Levine
, Yuval Peres:
The looping constant of ℤd. 1-13 - Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Selection by rank in K-dimensional binary search trees. 14-37 - Mirko Ebbers, Holger Knöpfel, Matthias Löwe, Franck Vermet:
Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model. 38-77 - Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved inapproximability results for counting independent sets in the hard-core model. 78-110 - Mark Holmes, Thomas S. Salisbury:
Degenerate random environments. 111-137
Volume 45, Number 2, September 2014
- Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. 139-184 - Michael Borokhovich, Chen Avin, Zvi Lotker:
Bounds for algebraic gossip on graphs. 185-217 - Demetres Christofides, Klas Markström:
The thresholds for diameter 2 in random Cayley graphs. 218-235 - Nicolas Curien, Igor Kortchemski:
Random non-crossing plane configurations: A conditioned Galton-Watson tree approach. 236-260 - Thomas Feierl:
Asymptotics for the number of walks in a Weyl chamber of type B. 261-305 - Eyal Heiman, Gideon Schechtman, Adi Shraibman:
Deterministic algorithms for matrix completion. 306-317 - Tobias Müller, Milos Stojakovic:
A threshold for the Maker-Breaker clique game. 318-341
Volume 45, Number 3, October 2014
- Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. 343-361 - Emmanuel Abbe, Andrea Montanari:
On the concentration of the number of solutions of random satisfiability formulas. 362-382 - Itai Benjamini, Gady Kozma, Nicholas C. Wormald:
The mixing time of the giant component of a random graph. 383-407 - Luc Devroye, Nicolas Fraiman:
Connectivity of inhomogeneous random graphs. 408-420 - Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger:
Stochastic service systems, random interval graphs and search algorithms. 421-442 - Alan M. Frieze:
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three. 443-497 - Michael Molloy:
Sets that are connected in two random graphs. 498-512 - Michael E. Picollelli:
The diamond-free process. 513-551
Volume 45, Number 4, December 2014
Research Articles
- Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic:
Maker-breaker games on random geometric graphs. 553-607 - David Conlon, Jacob Fox, Benny Sudakov:
Cycle packing. 608-626 - Colin Cooper, Alan M. Frieze, Eyal Lubetzky:
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. 627-674 - Colin Cooper, Alan M. Frieze, Ryuhei Uehara:
The height of random k-trees and related branching processes. 675-702 - Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. 703-725 - Svante Janson, Malwina J. Luczak, Peter Windridge:
Law of large numbers for the SIR epidemic on a random graph with given degrees. 726-763 - Oliver Riordan:
Long cycles in random subgraphs of graphs with large minimum degree. 764-767
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-10-31 20:19 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:
