External Links

    Journal: Random Struct. Algorithms

    Volume 22, Issue 4

    337 -- 358Svante Janson. The Wiener Index of simply generated random trees
    359 -- 434Yoshiharu Kohayakawa, Vojtech Rödl. Regular pairs in sparse random graphs I
    435 -- 439Jaikumar Radhakrishnan. A note on scrambling permutations

    Volume 22, Issue 3

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

    Volume 22, Issue 2

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

    Volume 22, Issue 1

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