Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 3
Volume 3, Number 1, Spring 1992
- Noga Alon:
The String Chromatic Number of a Graph. 1-8 - William M. Y. Goh, Eric Schmutz:
Gap-Free Set Partitions. 9-18 - James F. Lynch:
Probabilities of Sentences about Very Sparse Random Graphs. 33-54 - Béla Bollobás, Yoshiharu Kohayakawa
, Tomasz Luczak:
The Evaluation of Random Subgraphs of the Cube. 55-90 - Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Volumes Spanned by Random Points in the Hypercube. 91-106 - Wenceslas Fernandez de la Vega, L. Marquez Gordones:
The Forwarding Indeces of Random Graphs. 107-116
Volume 3, Number 2, Summer 1992
- Robert W. Robinson, Nicholas C. Wormald:
Almost All Cubic Graphs Are Hamiltonian. 117-126 - Svante Janson, Joel Spencer:
Probabilistic Construction of Proportional Graphs. 127-138 - Christian Mazza:
Parallel Simulated Annealing. 139-148 - Sergei A. Zuyev:
Estimates for Distributions of the Voronoi Polygon's Geometric Characteristics. 149-162 - Oded Goldreich, Hugo Krawczyk:
Sparse Pseudorandom Distributions. 163-174 - Vojtech Rödl, Zsolt Tuza:
Rainbow Subgraphs in Properly Edge-colored Graphs. 175-182 - Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs. 183-202 - Luc Devroye:
A Note on the Probabilistic Analysis of Patricia Trees. 203-214 - Neil J. Calkin, Alan M. Frieze, Ludek Kucera:
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. 215-222 - James B. Shearer:
A Note on Bipartite Subgraphs of Triangle-Free Graphs. 223-226
Volume 3, Number 3, Fall 1992
- Wansoo T. Rhee:
On the Travelling Salesperson Problem in Many Dimensions. 227-234 - Alan M. Frieze, Stephen Suen:
Counting the Number of Hamilton Cycles in Random Digraphs. 235-242 - Charles M. Newman:
Chain Lengths in Certain Random Directed Graphs. 243-254 - Hosam M. Mahmoud, Robert T. Smythe:
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. 255-266 - Andrew D. Barbour:
Refined Approximation for the Ewens Sampling Forumla. 267-276 - Colin Cooper:
1-Pancyclic Hamilton Cycles in Random Graphs. 277-288 - Noga Alon, Oded Goldreich, Johan Håstad, René Peralta:
Simple Construction of Almost k-wise Independent Random Variables. 289-304 - Philippe Flajolet, L. Bruce Richmond:
Generalized Digital Trees and Their Difference-Differential Equations. 305-320 - Richard Arratia, Simon Tavaré:
Limit Theorems for Combinatorial Structures via Discrete Process Approximations. 321-346
Volume 3, Number 4, Winter 1992
- Mark Jerrum:
Large Cliques Elude the Metropolis Process. 347-360 - Walter J. Gutjahr:
The Variance of Level Numbers in Certain Families of Trees. 361-374 - Hans Jürgen Prömel, Angelika Steger:
Coloring Clique-free Graphs in Linear Expected Time. 375-402 - Ljuben R. Mutafchiev:
Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures. 403-426 - Nancy Eaton, Vojtech Rödl:
A Canonical Ramsey Theorem. 427-444 - Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald:
Enumeration of Almost-Convex Polygons on the Square Lattice. 445-462
a service of 
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-04-22 20:03 CEST 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:
