Random Structures and Algorithms, Volume 37

Volume 37, Number 1, August 2010

• Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
  Hamiltonicity thresholds in Achlioptas processes. 1-24
  
• Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong:
  An approximation algorithm for counting contingency tables. 25-66
  
• Clément Dombry, Christian Mazza:
  Some remarks on Betti numbers of random polygon spaces. 67-84
  
• Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer:
  Percolation of arbitrary words in one dimension. 85-99
  
• Nati Linial, Doron Puder:
  Word maps and spectra of random graph lifts. 100-135
  

Volume 37, Number 2, September 2010

• Geoffrey R. Grimmett, Svante Janson:
  Random graphs with forbidden vertex degrees. 137-175
  
• Shankar Bhamidi, Ram Rajagopal, Sébastien Roch:
  Network delay inference from additive metrics. 176-203
  
• Christian Borgs, Jennifer T. Chayes, Ayalvadi Ganesh, Amin Saberi:
  How to distribute antidote to control epidemics. 204-222
  
• Elia Liitiäinen, Amaury Lendasse, Francesco Corona:
  A boundary corrected expansion of the moments of nearest neighbor distributions. 223-247
  
• Gábor Elek:
  Parameter testing in bounded degree graphs of subexponential growth. 248-270
  

Volume 37, Number 3, October 2010

• David J. Aldous, Shankar Bhamidi:
  Edge flows in the complete random-lengths network. 271-311
  
• Yuri Bakhtin:
  Thermodynamic limit for large random trees. 312-331
  
• Charles Bordenave, Marc Lelarge:
  Resolvent of large random graphs. 332-352
  
• Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
  Deterministic random walks on regular trees. 353-366
  
• Jeff Kahn, M. Neiman:
  Negative correlation and log-concavity. 367-388
  
• Fedor Petrov, Anatoly Vershik:
  Uncountable graphs and invariant measures on the set of universal countable graphs. 389-406
  

Volume 37, Number 4, December 2010

• Ehud Friedgut, Vojtech Rödl, Mathias Schacht:
  Ramsey properties of random discrete structures. 407-436
  
• Michael R. Capalbo:
  Explicit sparse almost-universal graphs for G(n, k/n). 437-454
  
• Javier Cilleruelo, Sándor Z. Kiss, Imre Z. Ruzsa, Carlos Vinuesa:
  Generalization of a theorem of Erdos and Rényi on Sidon sequences. 455-464
  
• Kevin Fleming, Nicholas Pippenger:
  Large deviations and moments for the Euler characteristic of a random surface. 465-476
  
• Toshiya Itoh, Osamu Watanabe:
  Weighted random popular matchings. 477-494
  
• Gregory Valiant, Tim Roughgarden:
  Braess's Paradox in large random graphs. 495-515
  
• Tomasz Luczak, Pawel Pralat:
  Chasing robbers on random graphs: Zigzag theorem. 516-524
  
• Terence Tao, Van H. Vu:
  A sharp inverse Littlewood-Offord theorem. 525-539
  

Last update Tue May 21 19:32:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page