Random Structures and Algorithms, Volume 22

Volume 22, Number 1, January 2003

• Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
  On the probability of independent sets in random graphs. 1-14
  Electronic Edition (link) BibTeX
• Kyle Siegrist:
  Renewal processes on partially ordered sets. 15-32
  Electronic Edition (link) BibTeX
• Tom Bohman, Alan M. Frieze, Ryan Martin:
  How many random edges make a dense graph hamiltonian? 33-42
  Electronic Edition (link) BibTeX
• Mark Huber:
  A bounding chain for Swendsen-Wang. 43-59
  Electronic Edition (link) BibTeX
• Sanjoy Dasgupta, Anupam Gupta:
  An elementary proof of a theorem of Johnson and Lindenstrauss. 60-65
  Electronic Edition (link) BibTeX
• Neal Madras, Zhongrong Zheng:
  On the swapping algorithm. 66-97
  Electronic Edition (link) BibTeX
• Michal Parnas, Dana Ron, Ronitt Rubinfeld:
  Testing membership in parenthesis languages. 98-138
  Electronic Edition (link) BibTeX

Volume 22, Number 2, March 2003

• Johan Håstad, Avi Wigderson:
  Simple analysis of graph tests for linearity and PCP. 139-160
  Electronic Edition (link) BibTeX
• Nicholas Pippenger:
  The shortest disjunctive normal form of a random Boolean function. 161-186
  Electronic Edition (link) BibTeX
• Colin McDiarmid:
  Random channel assignment in the plane. 187-212
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Minors in graphs of large girth. 213-225
  Electronic Edition (link) BibTeX

Volume 22, Number 3, May 2003

• Béla Bollobás, Graham Brightwell:
  The number of k-SAT functions. 227-247
  Electronic Edition (link) BibTeX
• Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
  Integer and fractional packings in dense 3-uniform hypergraphs. 248-310
  Electronic Edition (link) BibTeX
• Colin Cooper, Alan M. Frieze:
  A general model of web graphs. 311-335
  Electronic Edition (link) BibTeX

Volume 22, Number 4, July 2003

• Svante Janson:
  The Wiener Index of simply generated random trees. 337-358
  Electronic Edition (link) BibTeX
• Yoshiharu Kohayakawa, Vojtech Rödl:
  Regular pairs in sparse random graphs I. 359-434
  Electronic Edition (link) BibTeX
• Jaikumar Radhakrishnan:
  A note on scrambling permutations. 435-439
  Electronic Edition (link) BibTeX
• Anna Carlsund:
  Notes on the variance of the number of maxima in three dimensions. 440-447
  Electronic Edition (link) BibTeX