External Links

    Journal: Random Struct. Algorithms

    Volume 33, Issue 4

    409 -- 433Benny Sudakov, Van H. Vu. Local resilience of graphs
    434 -- 451Enrica Duchi, Gilles Schaeffer. A combinatorial approach to jumping particles: The parallel TASEP
    452 -- 479Antar Bandyopadhyay, David Gamarnik. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
    480 -- 496Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto. Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
    497 -- 514Lars Engebretsen, Jonas Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
    515 -- 532Charles Bordenave. Eigenvalues of Euclidean random matrices
    533 -- 535Simi Haber, Michael Krivelevich. Corrigendum: On fractional K-factors of random graphs
    536 -- 0Fan Chung Graham, Ronald L. Graham. Erratum: Quasi-random graphs with given degree sequences

    Volume 33, Issue 3

    269 -- 285Kevin P. Costello, Van H. Vu. The rank of random graphs
    286 -- 309Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless. The cycle structure of two rows in a random Latin square
    310 -- 332Hamed Hatami, Michael Molloy. Sharp thresholds for constraint satisfaction problems and homomorphisms
    333 -- 355Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie. Random walks on the vertices of transportation polytopes with constant number of sources
    356 -- 376David Galvin. Sampling independent sets in the discrete torus
    377 -- 408Federico Camia. Universality in two-dimensional enhancement percolation

    Volume 33, Issue 2

    127 -- 141Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus. The order of the largest complete minor in a random graph
    142 -- 156Jirí Matousek. On variants of the Johnson-Lindenstrauss lemma
    157 -- 186Ronen Shaltiel. How to get more mileage from randomness extractors
    187 -- 218Adam Kirsch, Michael Mitzenmacher. Less hashing, same performance: Building a better Bloom filter
    219 -- 251Predrag R. Jelenkovic, Ana Radovanovic. The persistent-access-caching algorithm
    252 -- 267Jirí Cerný, Véronique Gayrard. Hitting time of large subsets of the hypercube

    Volume 33, Issue 1

    1 -- 28Anders Johansson, Jeff Kahn, Van H. Vu. Factors in random graphs
    29 -- 43Mark Huber. Perfect simulation with exponential tails on the running time
    44 -- 67Shirley Halevy, Eyal Kushilevitz. Testing monotonicity over graph products
    68 -- 86Nikolaos Fountoulakis, Bruce A. Reed. The evolution of the mixing rate of a simple random walk on the giant component of a random graph
    87 -- 104Noga Alon, Uri Stav. What is the furthest graph from a hereditary property?
    105 -- 126Jennie C. Hansen, Jerzy Jaworski. Random mappings with exchangeable in-degrees
    runs on