Random Structures and Algorithms, Volume 14

Volume 14, Number 1, January 1999

Paul Balister, Béla Bollobás, Alan Stacey: Counting Boundary Paths for Oriented Percolation Clusters. 1-28
Alexander I. Barvinok: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor. 29-61
Dimitris Achlioptas, Ehud Friedgut: A Sharp Threshold for k-Colorability. 63-70
Elon Lindenstrauss: Indistinguishable Sceneries. 71-86
Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. 87-109

Yuri Rabinovich, Avi Wigderson: Techniques for bounding the convergence rate of genetic algorithms. 111-138
Pawel Hitczenko, Svante Janson, Joseph E. Yukich: On the variance of the random sphere of influence graph. 139-152
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A few logs suffice to build (almost) all trees (I). 153-184
Sylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf: On the multiplicity of parts in a random partition. 185-197

Michel Talagrand: Self averaging and the space of interactions in neural networks. 199-213
Edward A. Bender, Kevin J. Compton, L. Bruce Richmond: 0-1 laws for maps. 215-237
Gregory L. McColm: First order zero-one laws for random graphs on the circle. 239-266
C. Cooper: Asymptotics for dependent sums of random vectors. 267-292

Ravi Kannan, Prasad Tetali, Santosh Vempala: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. 293-308
Luc Devroye, Carlos Zamora-Cura: On the complexity of branch-and-bound search for random trees. 309-327
Michael Lomonosov, Yoseph Shpungin: Combinatorics of reliability Monte Carlo. 329-343
Shao C. Fang, Santosh S. Venkatesh: Learning finite binary sequences from half-space data. 345-381