Random Structures and Algorithms, Volume 21

Volume 21, Number 1, August 2002

• Don Coppersmith, David Gamarnik, Maxim Sviridenko:
  The diameter of a long-range percolation graph. 1-13
  
• Gunnar Andersson, Lars Engebretsen:
  Property testers for dense constraint satisfaction programs on finite domains. 14-32
  
• Marshall W. Buck, Clara S. Chan, David P. Robbins:
  On the expected value of the minimum assignment. 33-58
  
• Robert T. Smythe, J. A. Wellner:
  Asymptotic analysis of (3, 2, 1)-shell sort. 59-75
  
• Philippe Chassaing, Guy Louchard:
  Phase transition for Parking blocks, Brownian excursion and coalescence. 76-119
  

Volume 21, Number 2, September 2002

• Raphael Yuster:
  The decomposition threshold for bipartite graphs with minimum degree one. 121-134
  
• Ben J. Morris:
  Improved bounds for sampling contingency tables. 135-146
  
• William Duckworth, Nicholas C. Wormald:
  Minimum independent dominating sets of random cubic graphs. 147-161
  
• Marcos A. Kiwi, Martin Loebl:
  Largest planar matching in random bipartite graphs. 162-181
  
• David Bruce Wilson:
  On the critical exponents of random k-SAT. 182-195
  

Volume 21, Number 3-4, October-December 2002

• Michel Talagrand:
  Gaussian averages, Bernoulli averages, and Gibbs' measures. 197-204
  
• Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen:
  On the discrepancy of combinatorial rectangles. 205-215
  
• Jeong Han Kim, Benny Sudakov, Van H. Vu:
  On the asymmetry of random regular graphs and random graphs. 216-224
  
• Svante Janson, Dana Randall, Joel Spencer:
  Random dyadic tilings of the unit square. 225-251
  
• Markus E. Nebel:
  A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. 252-277
  
• David Eppstein, George S. Lueker:
  The minimum expectation selection problem. 278-292
  
• Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
  On characterizing hypergraph regularity. 293-335
  
• Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan:
  Nonrepetitive colorings of graphs. 336-346
  
• Joel Spencer, Géza Tóth:
  Crossing numbers of random graphs. 347-358
  
• Noga Alon:
  Testing subgraphs in large graphs. 359-370
  
• Nadine Guillotin-Plantard, René Schott:
  Distributed algorithms with dynamical random transitions. 371-396
  
• Sheng Bau, Nicholas C. Wormald, Sanming Zhou:
  Decycling numbers of random regular graphs. 397-413
  
• Béla Bollobás, Alex D. Scott:
  Problems and results on judicious partitions. 414-430