Journal: Random Struct. Algorithms

Volume 5, Issue 5

609 -- 626Robin Pemantle. A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck
627 -- 648Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak. On the Diameter and Radius of Random Subgraphs of the Cube
649 -- 664Alan M. Frieze, Stephen Suen. On the Independence Number of Random Cubic Graphs
665 -- 702Guy Louchard. Trie Size in a Dynamic List Structure
703 -- 730Alexandru Nica. On the Number of Cycles of Given Length of a Free Word in Several Random Permutations

Volume 5, Issue 4

487 -- 512David Aldous, Jim Pitman. Brownian Bridge Asymptotics for Random Mappings
513 -- 516Philippe Biane. Some Comments on the Paper Brownian Bridge Asymptotics for Random Mappings
517 -- 534Jennie C. Hansen. Order Statistics for Decomposable Combinatorial Structures
535 -- 558Linda L. Deneen, Gary M. Shute, Clark D. Thomborson. A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees
559 -- 572Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. Near-perfect Token Distribution
573 -- 590Paul Balister, Béla Bollobás, Alan Stacey. Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions
591 -- 608Jirí Matousek. Lower Bounds for a Subexponential Optimization Algorithm

Volume 5, Issue 3

375 -- 394Saharon Shelah, Joel Spencer. Random Sparse Unary Predicates
395 -- 411Andrei Z. Broder, Alan M. Frieze, Eli Shamir. Finding Hidden Hamiltonian Cycles
411 -- 440William M. Y. Goh, Eric Schmutz. Unlabeled Trees: Distribution of the Maximum Degree
441 -- 452Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg. Low-Diameter Graph Decomposition Is in NC
453 -- 464Claire Kenyon, Valerie King. On Boolean Decision Trees with Faulty Nodes
465 -- 487Boris Pittel, Robert W. Irving. An Upper Bound for the Solvability of a Random Stable Roommates Instance

Volume 5, Issue 2

253 -- 270Vojtech Rödl, Andrzej Rucinski. Random Graphs with Monochromatic Triangles in Every Edge Coloring
271 -- 285Noga Alon, Yuval Roichman. Random Cayley Graphs and Expanders
285 -- 304Anne Condon, Diane Hernek. Random Walks on Colored Graphs
305 -- 328Luc Devroye. On Random Cartesian Trees
329 -- 336Wenceslas Fernandez de la Vega, Yannis Manoussakis. Grids in Random Graphs
337 -- 348Boris Pittel. Note on the Heights of Random Recursive Trees and Random m-ary Search Trees
349 -- 362Lars Eilstrup Rasmussen. Approximating the Permanent: A Simple Approach
363 -- 374Robert W. Robinson, Nicholas C. Wormald. Almost All Regular Graphs Are Hamiltonian

Volume 5, Issue 1

1 -- 3Alan M. Frieze, Svante Janson, Tomasz Luczak. Introduction
3 -- 12Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski. Random Recursive Forests
13 -- 24Robin Carr, William M. Y. Goh, Eric Schmutz. The Maximum Degree in a Random Tree and Related Problems
25 -- 32Colin Cooper. The Threshold for Hamilton Cycles in the Square of a Random Graph
33 -- 44Michael Drmota. The Instability Time Distribution Behavior of Slotted ALOHA
45 -- 56Alan M. Frieze, Brendan D. McKay. Multicolored Trees in Random Graphs
57 -- 73Walter J. Gutjahr. Connection Reliabilities in Stochastic Acyclic Networks
73 -- 94Jerzy Jaworski, Ljuben R. Mutafchiev. The Largest Connected in a Random Mapping
95 -- 98Jan Kärrman. An Example of a Superproportional Graph
99 -- 122Rainer Kemp. Balanced Ordered Trees
123 -- 134Peter Kirschenhofer, Helmut Prodinger. Multidimensional Digital Searching-Alternative Data Structures
135 -- 146V. F. Kolchin. Random Graphs and Systems of Linear Equations in Finite Fields
147 -- 154A. V. Kostichka. On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs
155 -- 172James F. Lynch. An Extension of 0-1 Laws
173 -- 182José Luis Palacios. Expected Hitting and Cover Times of Random Walks on Some Special Graphs
183 -- 190Vojtech Rödl, Edita Sinajová. Note on Independent Sets in Steiner Systems
191 -- 204Saharon Shelah, Joel Spencer. Can You Feel the Double Jump?
205 -- 214Ioan Tomescu. On the Number of Subtrees for Almost All Graphs
215 -- 234Jerzy Tyszkiewicz. Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic
235 -- 242Eric Schmutz. Matchings in Superpositions of (n, n)-Bipartite Trees
243 -- 252Paul Erdös, Tomasz Luczak. Change of Leadership in a Random Graph Process