Journal: Random Struct. Algorithms

Volume 17, Issue 3-4

169 -- 196Hua-Huai Chern, Hsien-Kuei Hwang, Yeong-Nan Yeh. Distribution of the number of consecutive records
197 -- 212Colin Cooper. On the distribution of rank of a random matrix over a finite field
213 -- 237Artur Czumaj, Christian Scheideler. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
238 -- 259Artur Czumaj, Miroslaw Kutylowski. Delayed path coupling and generating random permutations
260 -- 289Martin E. Dyer, Catherine S. Greenhill. The complexity of counting graph homomorphisms
290 -- 316James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal. Extension of Fill s perfect rejection sampling algorithm to general chains
317 -- 342Jennie C. Hansen, Jerzy Jaworski. Large components of bipartite random mappings
343 -- 356Svante Janson. Growth of components in random graphs
357 -- 375Mohammad Mahdian. The strong chromatic index of C4-free graphs
376 -- 402Michael Molloy, Bruce A. Reed. Near-optimal list colorings
403 -- 427Ralph Neininger. Asymptotic distributions for partial match queries in K-d trees
428 -- 459Werner Schachinger. Limiting distributions for the costs of partial match retrievals in multidimensional tries

Volume 17, Issue 2

79 -- 102David Aldous, Boris Pittel. On a random graph with immigrating vertices: Emergence of the giant component
103 -- 116Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari. Bounding the unsatisfiability threshold of random 3-SAT
117 -- 156Jeff Kahn. Asymptotics of the list-chromatic index for multigraphs
157 -- 167Miklós Bóna, Andrew McLennan, Dennis White. Permutations with roots

Volume 17, Issue 1

1 -- 19Ehud Friedgut, Michael Krivelevich. Sharp thresholds for certain Ramsey properties of random graphs
20 -- 25Itai Benjamini, Gideon Schechtman. Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z
26 -- 28Andrew Thomason. Complete minors in pseudorandom graphs
29 -- 63Van H. Vu. New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
64 -- 77Uwe Schöning. Construction of expanders and superconcentrators using Kolmogorov complexity