189 | -- | 209 | Alois Panholzer, Helmut Prodinger. A generating functions approach for the analysis of grand averages for multiple QUICKSELECT |
211 | -- | 228 | Ljuben R. Mutafchiev. The largest tree in certain models of random forests |
229 | -- | 248 | Joel Spencer, Katherine St. John. Random unary predicates: Almost sure theories and countable models |
249 | -- | 260 | Pontus Andersson. On the asymptotic distributions of subgraph counts in a random tournament |
261 | -- | 283 | Rainer Kemp. On the joint distribution of the nodes in uniform multidimensional binary trees |
285 | -- | 317 | Martin E. Dyer, Catherine S. Greenhill. A more rapidly mixing Markov chain for graph colorings |
319 | -- | 334 | Zhi-Dong Bai, Hsien-Kuei Hwang, Wen-Qi Liang. Normal approximations of the number of records in geometrically distributed random variables |
335 | -- | 347 | Alexandr V. Kostochka, Vojtech Rödl. Partial Steiner systems and matchings in hypergraphs |
349 | -- | 382 | Petr Savický, Alan R. Woods. The number of Boolean functions computed by formulas of a given size |
383 | -- | 407 | Bernd Kreuter. Small sublattices in random subsets of Boolean lattices |
409 | -- | 422 | József Balogh, Gábor Pete. Random disease on the square grid |
423 | -- | 438 | Bernhard Gittenberger. Convergence of branching processes to the local time of a Bessel process |
439 | -- | 456 | Daniel Panario, L. Bruce Richmond. Analysis of Ben-Or s polynomial irreducibility test |
457 | -- | 466 | Noga Alon, Michael Krivelevich, Benny Sudakov. Finding a large hidden clique in a random graph |
467 | -- | 483 | Svante Janson. New versions of Suen s correlation inequality |
485 | -- | 500 | Tomasz Luczak. Random trees and random graphs |
501 | -- | 519 | Jerzy Jaworski. Predecessors in a random mapping |
521 | -- | 533 | Béla Bollobás. Paul Erdös and probability theory |