Random Structures and Algorithms, Volume 34

Volume 34, Number 1, January 2009

• Imre Z. Ruzsa:
  Sumsets and entropy. 1-10
  
• Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos:
  Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. 11-23
  
• Ronitt Rubinfeld, Rocco A. Servedio:
  Testing monotone high-dimensional distributions. 24-44
  
• Noga Alon, Alexandr V. Kostochka:
  Induced subgraphs with distinct sizes. 45-53
  
• Pu Gao, Nicholas C. Wormald:
  Short cycle distribution in random regular graphs recursively generated by pegging. 54-86
  
• Jennie C. Hansen, Jerzy Jaworski:
  A random mapping with preferential attachment. 87-111
  
• Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
  A sharp threshold for the Hamilton cycle Maker-Breaker game. 112-122
  
• Peter Keevash:
  A hypergraph regularity method for generalized Turán problems. 123-164
  
• Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
  Avoiding small subgraphs in Achlioptas processes. 165-195
  

Volume 34, Number 2, March 2009

• Svante Janson, Malwina J. Luczak:
  A new approach to the giant component problem. 197-216
  
• Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Chandra Nair:
  Proof of the local REM conjecture for number partitioning. I: Constant energy scales. 217-240
  
• Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Chandra Nair:
  Proof of the local REM conjecture for number partitioning. II. Growing energy scales. 241-284
  
• Codina Cotar, Alexander E. Holroyd, David Revelle:
  A percolating hard sphere model. 285-299
  
• Colin Cooper, Alan M. Frieze:
  Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. 300-304
  

Volume 34, Number 3, May 2009

• József Balogh, Béla Bollobás, Miklós Simonovits:
  The typical structure of graphs without given excluded subgraphs. 305-318
  
• Michael Drmota, Alex Iksanov, Martin Moehle, Uwe Roesler:
  A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. 319-336
  
• Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
  Multiple choice tries and distributed hash tables. 337-367
  
• Nati Linial, Adi Shraibman:
  Lower bounds in communication complexity based on factorization norms. 368-394
  
• Ravi Montenegro:
  The simple random walk and max-degree walk on a directed graph. 395-407
  
• R. Meshulam, N. Wallach:
  Homological connectivity of random k-dimensional complexes. 408-417