External Links

    Journal: Random Struct. Algorithms

    Volume 25, Issue 4

    353 -- 375Colin Cooper. The cores of random hypergraphs with a given degree sequence
    376 -- 395Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar. Directed graphs, Hamiltonicity and doubly stochastic matrices
    396 -- 420Sándor Csörgo, Wei Biao Wu. On the clustering of independent uniform random variables
    421 -- 431Fan R. K. Chung, Joshua N. Cooper. De Bruijn cycles for covering codes
    432 -- 449Tom Bohman, Alan M. Frieze, Nicholas C. Wormald. Avoidance of a giant component in half the edge set of a random graph

    Volume 25, Issue 3

    247 -- 276Charles Knessl, Wojciech Szpankowski. On the number of full levels in tries
    277 -- 292Jean Bertoin. Random covering of an interval and a variation of Kingman s coalescent
    293 -- 310Christian Mazza. Simply generated trees, B-series and Wigner processes
    311 -- 335Jochen Geiger, Lars Kauffmann. The shape of large Galton-Watson trees with possibly infinite variance
    336 -- 345Timothy Prescott, Francis Edward Su. Random walks on the torus with several generators
    346 -- 352Martin E. Dyer, Catherine S. Greenhill. Corrigendum: The complexity of counting graph homomorphisms

    Volume 25, Issue 2

    117 -- 149Johan Håstad, Srinivasan Venkatesh. On the advantage over a random assignment
    150 -- 178Lars Engebretsen, Venkatesan Guruswami. Is constraint satisfaction over two variables always easy?
    179 -- 207Alois Panholzer. The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
    208 -- 226Servet Martínez. Some bounds on the coupon collector problem
    227 -- 245Michael M. Erlihson, Boris L. Granovsky. Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups

    Volume 25, Issue 1

    1 -- 42Vojtech Rödl, Jozef Skokan. Regularity Lemma for k-uniform hypergraphs
    43 -- 67Michael A. Bender, Saurabh Sethia, Steven Skiena. Data structures for maintaining set partitions
    68 -- 90Mohammad R. Salavatipour. A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova sz Local Lemma
    91 -- 114David A. Levin, Yuval Peres. Identifying several biased coins encountered by a hidden random walk
    115 -- 0Andrew D. Barbour, Gesine Reinert. Correction: Small worlds
    runs on