Random Structures & Algorithms

Copyright © 2012 Wiley Periodicals, Inc., A Wiley Company

Cover image for Random Structures & Algorithms

January 2000

Volume 16, Issue 1

Pages 1–113

    1. TEN YEARS! (pages 1–3)

      Michal Karoński and Joel Spencer

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<1::AID-RSA1>3.0.CO;2-E

    2. Improved bounds and algorithms for hypergraph 2-coloring (pages 4–32)

      Jaikumar Radhakrishnan and Aravind Srinivasan

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2

    3. Average-case complexity of shortest-paths problems in the vertex-potential model (pages 33–46)

      Colin Cooper, Alan Frieze, Kurt Mehlhorn and Volker Priebe

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<33::AID-RSA3>3.0.CO;2-0

    4. Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph (pages 47–57)

      Zhicheng Gao, Brendan D. McKay and Xiaoji Wang

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<47::AID-RSA4>3.0.CO;2-L

    5. Dependent percolation and colliding random walks (pages 58–84)

      Peter Winkler

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<58::AID-RSA5>3.0.CO;2-E

    6. How to couple from the past using a read-once source of randomness (pages 85–113)

      David Bruce Wilson

      Article first published online: 3 JAN 2000 | DOI: 10.1002/(SICI)1098-2418(200001)16:1<85::AID-RSA6>3.0.CO;2-H

SEARCH

SEARCH BY CITATION