External Links

    Journal: Random Struct. Algorithms

    Volume 46, Issue 4

    599 -- 613David Gamarnik, Dmitriy Katz, Sidhant Misra. Strong spatial mixing of list coloring of graphs
    614 -- 634Michel Benaïm, Itai Benjamini, Jun Chen, Yuri Lima. A generalized Pólya's urn with graph based interactions
    635 -- 650Steffen Dereich, Peter Mörters. Cycle length distributions in random permutations with diverging cycle weights
    651 -- 676Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor. Biased games on random boards
    677 -- 687Michael Fuchs. A note on the quicksort asymptotics
    688 -- 706Alexander Gnedin, Vadim Gorin. Record-dependent measures on the symmetric groups
    707 -- 738Hsien-Kuei Hwang, Vytas Zacharovas. Limit distribution of the coefficients of polynomials with only unit roots
    739 -- 761Shuji Kijima, Kentaro Koga, Kazuhisa Makino. Deterministic random walks on finite graphs
    762 -- 800John Lenz, Dhruv Mubayi. The poset of hypergraph quasirandomness

    Volume 46, Issue 3

    397 -- 445Fiachra Knox, Daniela Kühn, Deryk Osthus. Edge-disjoint Hamilton cycles in random graphs
    446 -- 465Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person. Tight Hamilton cycles in random hypergraphs
    466 -- 477Amir Barghi, Peter Winkler. Firefighting on a random geometric graph
    478 -- 493Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz. Hats, auctions and derandomization
    494 -- 530David Ellis, Yuval Filmus, Ehud Friedgut. n
    531 -- 540Hilary Finucane, Ron Peled, Yariv Yaari. t-wise uniform permutations
    541 -- 571Konstantin Makarychev, Warren Schudy, Maxim Sviridenko. Concentration inequalities for nonlinear matroid intersection
    572 -- 598Michael Viderman. A combination of testability and decodability by tensor products

    Volume 46, Issue 2

    197 -- 231Dimitris Achlioptas, Michael Molloy. The solution space geometry of random linear equations
    232 -- 260Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira. A unified framework for testing linear-invariant properties
    261 -- 273A. E. Costa, Michael Farber. The asphericity of random 2-dimensional complexes
    274 -- 299Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski 0001. An improved upper bound on the density of universal random graphs
    300 -- 319Aurélien Garivier. Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm
    320 -- 345Michael Krivelevich, Choongbum Lee, Benny Sudakov. Long paths and cycles in random subgraphs of graphs with large minimum degree
    346 -- 361Ralph Neininger. Refined quicksort asymptotics
    362 -- 390Ross G. Pinsky. Probabilistic and combinatorial aspects of the card-cyclic to random insertion shuffle
    391 -- 395Oliver Riordan, Lutz Warnke. The Janson inequalities for general up-sets

    Volume 46, Issue 1

    1 -- 25Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
    26 -- 35Lior Aronshtam, Nathan Linial. When does the top homology of a random simplicial complex vanish?
    36 -- 54Petra Berenbrink, Colin Cooper, Tom Friedetzky. Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
    55 -- 116Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang. Aggregation models with limited choice and the multiplicative coalescent
    117 -- 141Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne. Uncommon suffix tries
    142 -- 159Uriel Feige, Daniel Reichman. Recoverable values for independent sets
    160 -- 196Alan M. Frieze, Gregory B. Sorkin. Efficient algorithms for three-dimensional axial and planar random assignment problems
    runs on