Random Structures and Algorithms, Volume 27

Volume 27, Number 1, August 2005

• Béla Bollobás, Oliver Riordan:
  Slow emergence of the giant component in the growing m-out graph. 1-24
  Electronic Edition (link) BibTeX
• Shahar Mendelson:
  Embedding with a Lipschitz function. 25-45
  Electronic Edition (link) BibTeX
• Lars Engebretsen, Jonas Holmerin:
  Three-query PCPs with perfect completeness over non-Boolean domains. 46-75
  Electronic Edition (link) BibTeX
• Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
  Distances in random graphs with finite variance degrees. 76-123
  Electronic Edition (link) BibTeX
• Michael Molloy:
  Cores in random hypergraphs and Boolean formulas. 124-135
  Electronic Edition (link) BibTeX

Volume 27, Number 2, September 2005

• Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer:
  Random subgraphs of finite graphs: I. The scaling window under the triangle condition. 137-184
  Electronic Edition (link) BibTeX
• Luc Devroye, Wojciech Szpankowski:
  Probabilistic behavior of asymmetric level compressed tries. 185-200
  Electronic Edition (link) BibTeX
• Alfredo Braunstein, Marc Mézard, Riccardo Zecchina:
  Survey propagation: An algorithm for satisfiability. 201-226
  Electronic Edition (link) BibTeX
• Navin Goyal, Michael E. Saks:
  A parallel search game. 227-234
  Electronic Edition (link) BibTeX
• Philippe Robert:
  On the asymptotic behavior of some algorithms. 235-250
  Electronic Edition (link) BibTeX
• Uriel Feige, Eran Ofek:
  Spectral techniques applied to sparse random graphs. 251-275
  Electronic Edition (link) BibTeX

Volume 27, Number 3, October 2005

• Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin:
  Embracing the giant component. 277-289
  Electronic Edition (link) BibTeX
• Zhi-Dong Bai, Luc Devroye, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
  Maxima in hypercubes. 290-309
  Electronic Edition (link) BibTeX
• Serguei Popov:
  Random Bulgarian solitaire. 310-330
  Electronic Edition (link) BibTeX
• Remco van der Hofstad, Gordon Slade:
  Asymptotic expansions in n^-1 for percolation critical values on the n-Cube and Zⁿ. 331-357
  Electronic Edition (link) BibTeX
• Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
  Lower bounds for adaptive locally decodable codes. 358-378
  Electronic Edition (link) BibTeX
• Vladimir Nikiforov, Cecil C. Rousseau:
  Book Ramsey numbers. I. 379-400
  Electronic Edition (link) BibTeX
• William Duckworth, Bernard Mans:
  Randomized greedy algorithms for finding small k-dominating sets of regular graphs. 401-412
  Electronic Edition (link) BibTeX