External Links

    Journal: Random Struct. Algorithms

    Volume 35, Issue 2

    137 -- 162Gergely Ambrus, Imre Bárány. Longest convex chains
    163 -- 193Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman. Testing low-degree polynomials over prime fields
    194 -- 215Fabrice Guillemin, Philippe Robert. Analysis of Steiner subtrees of random trees for traceroute algorithms
    216 -- 221András Pluhár. Greedy colorings of uniform hypergraphs
    222 -- 249Catherine S. Greenhill, Brendan D. McKay. Random dense bipartite graphs and directed graphs with specified degrees
    250 -- 270Elchanan Mossel, Allan Sly. Rapid mixing of Gibbs sampling on graphs that are sparse on average
    runs on