default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 1
Volume 1, Number 1, Spring 1990
- Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. 1-14 - Svante Janson:
A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics. 15-38 - Neil J. Calkin
, Alan M. Frieze:
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. 39-50 - Persi Diaconis, Ronald L. Graham, John A. Morrison:
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions. 51-72 - Richard M. Karp:
The Transitive Closure of a Random Digraph. 73-94 - Béla Bollobás:
Complete Matchings in Random Subgraphs on the Cube. 95-104 - Fan R. K. Chung, Ronald L. Graham:
Quasi-Random Hypergraphs. 105-124
Volume 1, Number 2, Summer 1990
- Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. 127-170 - Tomasz Luczak:
On the Number of Sparse Connected Graphs. 171-174 - Noga Alon:
The Number of Spanning Trees in Regular Graphs. 175-182 - Zoltán Füredi:
Competition Graphs and Clique Dimensions. 183-190 - Luc Devroye:
On the Height of Random m-ary Search Trees. 191-204 - Joel Spencer:
Countable Sparse Random Graphs. 205-214 - Géza Bohus:
On the Discrepancy of 3 Permutations. 215-220 - Svante Janson:
Poisson Approximation for Large Deviations. 221-230 - Stephen Suen:
A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph. 231-242
Volume 1, Number 3, Fall 1990
- Paul Erdös, Prasad Tetali:
Representations of Integers as the Sum of k Terms. 245-262 - Graham R. Brightwell, Peter Winkler:
Maximum itting Time for Random Walks on Graphs. 263-276 - Alexandr V. Kostochka:
Matchings in Random Spanning Subgraphs of Cubelike Graphs. 277-286 - Tomasz Luczak:
Component Behavior Near the Critical Point of the Random Graph Process. 287-310 - Boris G. Pittel:
On Tree Census and the Giant Component in Sparse Random Graphs. 311-342 - Zoltán Szabó:
An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number. 343-360
Volume 1, Number 4, Winter 1990
- Fan R. K. Chung:
Quasi-Random Classes of Hypergraphs. 363-382 - David J. Aldous:
A Random Tree Model Associated with Random Graphs. 383-402 - Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski:
Small Cliques in Random Graphs. 403-434 - Colin McDiarmid:
On the Chromatic Number of Random Graphs. 435-442 - Colin McDiarmid, Bruce A. Reed:
Linear Arboricity of Random Regular Graphs. 443-447 - Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. 447-460
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-12-04 22:09 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:
