


default search action
Random Structures and Algorithms, Volume 39
Volume 39, Number 1, August 2011
- Bruno Salvy:

In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics. iii-iv - Béla Bollobás, Oliver Riordan:

Sparse graphs: Metrics and random models. 1-38 - Yael Dekel, James R. Lee, Nathan Linial:

Eigenvectors of random graphs: Nodal Domains. 39-58 - Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky:

A new perspective on implementation by voting trees. 59-82 - Pietro Caputo

, Fabio Martinelli
, Fabio Lucio Toninelli
:
Convergence to equilibrium of biased plane Partitions. 83-114 - Tobias Friedrich

, Thomas Sauerwald, Dan Vilenchik:
Smoothed analysis of balancing networks. 115-138 
Volume 39, Number 2, September 2011
- Jian Ding, Jeong Han Kim, Eyal Lubetzky

, Yuval Peres:
Anatomy of a young giant component in the random graph. 139-178 - Andrew D. Barbour, Gesine Reinert:

The shortest distance in random multi-type intersection graphs. 179-209 - Marek Biskup:

Graph diameter in long-range percolation. 210-227 - Shirshendu Chatterjee, Rick Durrett:

Persistence of activity in threshold contact processes, an "Annealed approximation" of random Boolean networks. 228-246 - Adrien Joseph:

A phase transition for the heights of a fragmentation tree. 247-274 
Volume 39, Number 3, October 2011
- Peter Keevash:

A hypergraph blow-up lemma. 275-376 - Noga Alon, Alexandr V. Kostochka:

Hypergraph list coloring and Euclidean Ramsey theory. 377-390 - Aicke Hinrichs, Jan Vybíral

:
Johnson-Lindenstrauss lemma for circulant matrices. 391-398 - Svante Janson, Oliver Riordan:

Duality in inhomogeneous random graphs, and the cut metric. 399-411 
Volume 39, Number 4, December 2011
- Péter Gács:

Clairvoyant scheduling of random walks. 413-485 - Sven Erick Alm, Svante Janson, Svante Linusson:

Correlations for paths in random orientations of G(n, p) and G(n, m). 486-506 - Phong Châu, Louis DeBiasio, Hal A. Kierstead:

Pósa's conjecture for graphs of order at least 2 × 108. 507-525 - Van Vu:

Singular vectors under random perturbation. 526-538 - Guy Wolfovitz:

Triangle-free subgraphs in the triangle-free process. 539-543 

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














