Volume 24, Number 1, January 2004

• 
  Alexandr V. Kostochka: Coloring uniform hypergraphs with few colors. 1-10
• 
  Bogdan S. Chlebus, Dariusz R. Kowalski: Randomization helps to perform independent tasks reliably. 11-41
• 
  Alan M. Frieze, Michael Krivelevich, Ryan Martin: The emergence of a giant component in random subgraphs of pseudo-random graphs. 42-50
• 
  Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi: A stochastic model for solitons. 51-64
• 
  Dmitry Panchenko: Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph. 65-74
• 
  Michael Drmota, Danièle Gardy, Bernhard Gittenberger: General urn models with several types of balls and Gaussian limiting fields. 75-103

Volume 24, Number 2, March 2004

• 
  Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin: Adding random edges to dense graphs. 105-117
• 
  Jean-François Marckert: The rotation correspondence is asymptotically a dilatation. 118-132
• 
  Brigitte Chauvin, Nicolas Pouyanne: m-ary Search trees when m ge 27: A strong asymptotics for the space requirements. 133-154
• 
  Ketan Dalal: Counting the onion. 155-165
• 
  Jeong Han Kim, Van H. Vu: Divide and conquer martingales and the number of triangles in a random graph. 166-174
• 
  Eldar Fischer, Ilan Newman, Jiri Sgall: Functions that have read-twice constant width branching programs are not necessarily testable. 175-193
• 
  Stefanie Gerke, Thomas Schickinger, Angelika Steger: K₅-free subgraphs of random graphs. 194-232

Volume 24, Number 3, May 2004

• 
  Svante Janson: Large deviations for sums of partly dependent random variables. 234-248
• 
  Dudley Stark: The vertex degree distribution of random intersection graphs. 249-258
• 
  Amin Coja-Oghlan, Anusch Taraz: Exact and approximative algorithms for coloring G(n, p). 259-278
• 
  Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Random sampling of 3-colorings in Z². 279-302
• 
  Graham Brightwell, Peter Winkler: A second threshold for the hard-core model on a Bethe lattice. 303-314
• 
  Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel: Phase diagram for the constrained integer partitioning problem. 315-380

Volume 24, Number 4, July 2004

• 
  Christina Goldschmidt, James Norris: Essential edges in Poisson random hypergraphs. 381-396
• 
  R. W. R. Darling, David A. Levin, James R. Norris: Continuous and discontinuous phase transitions in hypergraph processes. 397-419
• 
  Malwina J. Luczak, Peter Winkler: Building uniformly random subtrees. 420-443
• 
  Geoffrey R. Grimmett, S. N. Winkler: Negative association in uniform forests and connected graphs. 444-460
• 
  Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz: Mixing in time and space for lattice spin systems: A combinatorial view. 461-479
• 
  Jacob van den Berg, Rachel Brouwer: Self-destructive percolation. 480-501
• 
  Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin: Random MAX SAT, random MAX CUT, and their phase transitions. 502-545

last updated on Mon May 20 03:33:48 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page