default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 5
Volume 5, Number 1, January 1994
- Alan M. Frieze
, Svante Janson, Tomasz Luczak:
Introduction. 1-3 - Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski:
Random Recursive Forests. 3-12 - Robin Carr, William M. Y. Goh, Eric Schmutz:
The Maximum Degree in a Random Tree and Related Problems. 13-24 - Colin Cooper:
The Threshold for Hamilton Cycles in the Square of a Random Graph. 25-32 - Michael Drmota:
The Instability Time Distribution Behavior of Slotted ALOHA. 33-44 - Alan M. Frieze, Brendan D. McKay:
Multicolored Trees in Random Graphs. 45-56 - Walter J. Gutjahr:
Connection Reliabilities in Stochastic Acyclic Networks. 57-73 - Jerzy Jaworski, Ljuben R. Mutafchiev:
The Largest Connected in a Random Mapping. 73-94 - Jan Kärrman:
An Example of a Superproportional Graph. 95-98 - Rainer Kemp:
Balanced Ordered Trees. 99-122 - Peter Kirschenhofer, Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures. 123-134 - Valentin F. Kolchin:
Random Graphs and Systems of Linear Equations in Finite Fields. 135-146 - A. V. Kostichka:
On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs. 147-154 - James F. Lynch:
An Extension of 0-1 Laws. 155-172 - José Luis Palacios:
Expected Hitting and Cover Times of Random Walks on Some Special Graphs. 173-182 - Vojtech Rödl, Edita Sinajová:
Note on Independent Sets in Steiner Systems. 183-190 - Saharon Shelah, Joel Spencer:
Can You Feel the Double Jump? 191-204 - Ioan Tomescu:
On the Number of Subtrees for Almost All Graphs. 205-214 - Jerzy Tyszkiewicz:
Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic. 215-234 - Eric Schmutz:
Matchings in Superpositions of (n, n)-Bipartite Trees. 235-242 - Paul Erdös, Tomasz Luczak:
Change of Leadership in a Random Graph Process. 243-252
Volume 5, Number 2, April 1994
- Vojtech Rödl, Andrzej Rucinski:
Random Graphs with Monochromatic Triangles in Every Edge Coloring. 253-270 - Noga Alon, Yuval Roichman:
Random Cayley Graphs and Expanders. 271-285 - Anne Condon, Diane Hernek:
Random Walks on Colored Graphs. 285-304 - Luc Devroye:
On Random Cartesian Trees. 305-328 - Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Grids in Random Graphs. 329-336 - Boris G. Pittel:
Note on the Heights of Random Recursive Trees and Random m-ary Search Trees. 337-348 - Lars Eilstrup Rasmussen:
Approximating the Permanent: A Simple Approach. 349-362 - Robert W. Robinson, Nicholas C. Wormald:
Almost All Regular Graphs Are Hamiltonian. 363-374
Volume 5, Number 3, Juli 1994
- Saharon Shelah, Joel Spencer:
Random Sparse Unary Predicates. 375-394 - Andrei Z. Broder, Alan M. Frieze, Eli Shamir:
Finding Hidden Hamiltonian Cycles. 395-411 - William M. Y. Goh, Eric Schmutz:
Unlabeled Trees: Distribution of the Maximum Degree. 411-440 - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Low-Diameter Graph Decomposition Is in NC. 441-452 - Claire Kenyon, Valerie King:
On Boolean Decision Trees with Faulty Nodes. 453-464 - Boris G. Pittel, Robert W. Irving:
An Upper Bound for the Solvability of a Random Stable Roommates Instance. 465-487
Volume 5, Number 4, October 1994
- David J. Aldous, Jim Pitman:
Brownian Bridge Asymptotics for Random Mappings. 487-512 - Philippe Biane:
Some Comments on the Paper "Brownian Bridge Asymptotics for Random Mappings". 513-516 - Jennie C. Hansen:
Order Statistics for Decomposable Combinatorial Structures. 517-534 - Linda L. Deneen, Gary M. Shute, Clark D. Thomborson:
A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees. 535-558 - Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. 559-572 - Paul Balister, Béla Bollobás, Alan Stacey:
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. 573-590 - Jirí Matousek:
Lower Bounds for a Subexponential Optimization Algorithm. 591-608
Volume 5, Number 5, December 1994
- Robin Pemantle:
A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck. 609-626 - Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
On the Diameter and Radius of Random Subgraphs of the Cube. 627-648 - Alan M. Frieze, Stephen Suen:
On the Independence Number of Random Cubic Graphs. 649-664 - Guy Louchard:
Trie Size in a Dynamic List Structure. 665-702 - Alexandru Nica:
On the Number of Cycles of Given Length of a Free Word in Several Random Permutations. 703-730
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
