External Links

    Journal: Random Struct. Algorithms

    Volume 16, Issue 4

    293 -- 313Claudia Bertram-Kretzberg, Hanno Lefmann. MOD::p::-tests, almost independence and small probability spaces
    314 -- 332Wenceslas Fernandez de la Vega, Marek Karpinski. Polynomial time approximation of dense weighted instances of MAX-CUT
    333 -- 343Johan Jonasson, Elchanan Mossel, Yuval Peres. Percolation in a dependent random environment
    344 -- 363Van H. Vu. On the concentration of multivariate polynomials with small expectation
    364 -- 368Noga Alon. Degrees and choice numbers
    369 -- 401Colin Cooper, Alan M. Frieze. Hamilton cycles in random graphs and directed graphs

    Volume 16, Issue 3

    233 -- 239Petr Savický. On random orderings of variables for parity ordered binary decision diagrams
    240 -- 259Susanne Albers, Michael Mitzenmacher. Average-case analyses of first fit and random fit bin packing
    260 -- 276Tomasz Luczak. On triangle-free random graphs
    277 -- 292Stéphane Boucheron, Gábor Lugosi, Pascal Massart. A sharp concentration inequality with applications

    Volume 16, Issue 2

    131 -- 142Johan Jonasson. Lollipop graphs are extremal for commute times
    143 -- 155Christopher Hoffman. Energy of flows on Z2 percolation clusters
    156 -- 176James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen. Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
    177 -- 194Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus. The length of random subsets of Boolean lattices
    195 -- 208Uriel Feige, Robert Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph
    209 -- 232Colin Cooper. On the rank of random matrices

    Volume 16, Issue 1

    1 -- 3Michal Karonski, Joel Spencer. Ten Years!
    4 -- 32Jaikumar Radhakrishnan, Aravind Srinivasan. Improved bounds and algorithms for hypergraph 2-coloring
    33 -- 46Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe. Average-case complexity of shortest-paths problems in the vertex-potential model
    47 -- 57Zhicheng Gao, Brendan D. McKay, Xiaoji Wang. Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
    58 -- 84Peter Winkler. Dependent percolation and colliding random walks
    85 -- 113David Bruce Wilson. How to couple from the past using a read-once source of randomness
    runs on