External Links

    Journal: Random Struct. Algorithms

    Volume 43, Issue 4

    399 -- 406Nathan Linial, Zur Luria. An upper bound on the number of Steiner triple systems
    407 -- 428Mikhail Belkin, Hariharan Narayanan, Partha Niyogi. Heat flow and a faster algorithm to compute the surface area of a convex body
    429 -- 451Bryn Garrod, Robert Morris. The secretary problem on an unknown poset
    452 -- 485Taral Guldahl Seierstad. On the normality of giant components
    486 -- 539Tatyana S. Turova. Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1

    Volume 43, Issue 3

    265 -- 312Ronitt Rubinfeld, Ning Xie. k-wise independence over product spaces and related testing results
    313 -- 337Jirí Cerný, Augusto Teixeira. Critical window for the vacant set left by random walk on random regular graphs
    338 -- 353Pu Gao. Distribution of the number of spanning regular subgraphs in random graphs
    354 -- 376Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald. Asymptotic enumeration of sparse 2-connected graphs
    377 -- 397Justin Salez. Weighted enumeration of spanning subgraphs in locally tree-like graphs

    Volume 43, Issue 2

    131 -- 138Michael Krivelevich, Benny Sudakov. The phase transition in random graphs: A simple proof
    139 -- 180Thomas P. Hayes. Local uniformity properties for glauber dynamics on graph colorings
    181 -- 200Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda. Randomly coloring constant degree graphs
    201 -- 220Nikolaos Fountoulakis, Konstantinos Panagiotou. Rumor spreading on random regular graphs and expanders
    221 -- 250Mihyun Kang, Will Perkins, Joel Spencer. The Bohman-Frieze process near criticality
    251 -- 263Alistair Sinclair, Dan Vilenchik. Delaying satisfiability for random 2SAT

    Volume 43, Issue 1

    1 -- 15Michael Krivelevich, Eyal Lubetzky, Benny Sudakov. Longest cycles in sparse random digraphs
    16 -- 48Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner. Topology discovery of sparse random graphs with few participants
    49 -- 79Boris Pittel. Counting strongly-connected, moderately sparse directed graphs
    80 -- 114Xavier Pérez-Giménez, Nicholas C. Wormald. Asymptotic enumeration of strongly connected digraphs by vertices and edges
    115 -- 130Stanislav Volkov. Random geometric subdivisions
    runs on