default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 43
Volume 43, Number 1, August 2013
- Michael Krivelevich, Eyal Lubetzky
, Benny Sudakov:
Longest cycles in sparse random digraphs. 1-15 - Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology discovery of sparse random graphs with few participants. 16-48 - Boris G. Pittel:
Counting strongly-connected, moderately sparse directed graphs. 49-79 - Xavier Pérez-Giménez, Nicholas C. Wormald:
Asymptotic enumeration of strongly connected digraphs by vertices and edges. 80-114 - Stanislav Volkov:
Random geometric subdivisions. 115-130
Volume 43, Number 2, September 2013
- Michael Krivelevich, Benny Sudakov:
The phase transition in random graphs: A simple proof. 131-138 - Thomas P. Hayes:
Local uniformity properties for glauber dynamics on graph colorings. 139-180 - Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. 181-200 - Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor spreading on random regular graphs and expanders. 201-220 - Mihyun Kang, Will Perkins, Joel Spencer:
The Bohman-Frieze process near criticality. 221-250 - Alistair Sinclair, Dan Vilenchik:
Delaying satisfiability for random 2SAT. 251-263
Volume 43, Number 3, October 2013
- Ronitt Rubinfeld, Ning Xie:
Robust characterizations of k-wise independence over product spaces and related testing results. 265-312 - Jirí Cerný, Augusto Teixeira:
Critical window for the vacant set left by random walk on random regular graphs. 313-337 - Pu Gao:
Distribution of the number of spanning regular subgraphs in random graphs. 338-353 - Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald:
Asymptotic enumeration of sparse 2-connected graphs. 354-376 - Justin Salez:
Weighted enumeration of spanning subgraphs in locally tree-like graphs. 377-397
Volume 43, Number 4, December 2013
- Nathan Linial, Zur Luria:
An upper bound on the number of Steiner triple systems. 399-406 - Mikhail Belkin, Hariharan Narayanan, Partha Niyogi:
Heat flow and a faster algorithm to compute the surface area of a convex body. 407-428 - Bryn Garrod, Robert Morris:
The secretary problem on an unknown poset. 429-451 - Taral Guldahl Seierstad:
On the normality of giant components. 452-485 - Tatyana S. Turova:
Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1. 486-539
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-11-13 00:06 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:
