default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 6
Volume 6, Number 1, January 1995
- Vojtech Rödl, Robin Thomas:
On the Genus of a Random Graph. 1-12 - Noga Alon, Benny Sudakov:
Disjoint Systems. 13-20 - Hans Jürgen Prömel, Angelika Steger:
Random I-Cororable Graphs. 21-38 - Joseph Naor, Ron M. Roth:
Constructions of Permutation Arrays for Certain Scheduling Cost Measures. 39-50 - Uriel Feige:
A Tight Upper Bound on the Cover Time for Random Walks on Graphs. 51-54 - Jonathan Aronson, Martin E. Dyer
, Alan M. Frieze, Stephen Suen:
Randomized Greedy Matching II. 55-74 - Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. 75-88 - E. Rodney Canfield, L. H. Harper:
Large Antichains in the Partition Lattice. 89-104 - John Preater:
A Passage Time for Greedy-Coloring Cycles. 105-112 - Ron Blei, Yuval Peres, James H. Schmerl:
Fractional Products of Sets. 113-120
Volume 6, Number 2/3, March-May 1995
- Rainer Kemp:
On the Inner Structure of Multidimensional Simply Generated Trees. 121-146 - Valentin F. Kolchin:
On Classification in Presence of Measurement Errors. 147-160 - Michael Molloy, Bruce A. Reed:
A Critical Point for Random Graphs with a Given Degree Sequence. 161-180 - Jerzy Tyszkiewicz:
Probabilities in First-Order Logic of a Unary Function and a Binary Relation. 181-192 - David A. Grable:
The Diameter of a Random Graph with Bounded Diameter. 193-200 - Lars Holst:
The General Birthday Problem. 201-208 - Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
On Uncrowded Hypergraphs. 209-212 - Svante Janson:
Hamilton Cycles in a Random Tournament. 213-220 - Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
Connectivity Properties of Random Subgraphs of the Cube. 221-230 - Graham R. Brightwell:
Random Graph Orders Do Not Satisfy a 0-1 Law. 231-238 - James F. Lynch:
On the Threshold of Chaos in Random Boolean Cellular Automata. 239-260 - Noga Alon, Zsolt Tuza:
The Acyclic Orientation Game on Random Graphs. 261-268 - Alexandr V. Kostochka:
The Number of Spanning Trees in Graphs with Given Degree Sequence. 269-274 - Andrew M. Odlyzko:
Search for the Maximum of a Random Walk. 275-296 - Wojciech Kordecki:
Maximal Full Subspaces in Random Projective Spaces- Thresholds and Poisson Approximation. 297-308 - Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph. 309-318 - Paul Erdös, Vojtech Rödl:
Covering of r-Graphs by Complete r-Partite Subgraphs. 319-322 - Zsolt Tuza:
How to Make A Random Graph Irregular. 323-330 - Robert S. Maier:
The Shape of Stretched Planar Trees. 331-340 - Svante Janson:
A Graph Fourier Transform and Proportional Graphs. 341-352 - Béla Bollobás, Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs. 353-356 - Michael Drmota:
Correlations on the Strata of a Random Mapping. 357-366
Volume 6, Number 4, July 1995
- Tomasz Luczak, Saharon Shelah:
Convergence in Homogeneous Random Graphs. 371-393 - Takeshi Tokuyama, Jun Nakano:
Geometric Algorithms for the Minimum Cost Assignment Problem. 393-406 - Petr Savický:
Improved Boolean Formulas for the Ramsey Graphs. 407-416 - Penny E. Haxell, Yoshiharu Kohayakawa:
On the Anti-Ramsey Property of Ramanujan Graphs. 417-432 - Uriel Feige:
A Tight Lower Bound on the Cover Time for Random Walks on Graphs. 433-438 - Colin Cooper:
On the 2-Cyclic Property in 2-Regular Digraphs. 439-448 - Vlado Dancík, Mike Paterson:
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. 449-458 - Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. 459-478
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 2024-10-31 20:19 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:
