Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 17
Volume 17, Number 1, August 2000
- Ehud Friedgut, Michael Krivelevich:
Sharp thresholds for certain Ramsey properties of random graphs. 1-19 - Itai Benjamini, Gideon Schechtman:
Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. 20-25 - Andrew Thomason:
Complete minors in pseudorandom graphs. 26-28 - Van H. Vu:
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help. 29-63 - Uwe Schöning:
Construction of expanders and superconcentrators using Kolmogorov complexity. 64-77
Volume 17, Number 2, September 2000
- David J. Aldous, Boris G. Pittel:
On a random graph with immigrating vertices: Emergence of the giant component. 79-102 - Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari:
Bounding the unsatisfiability threshold of random 3-SAT. 103-116 - Jeff Kahn:
Asymptotics of the list-chromatic index for multigraphs. 117-156 - Miklós Bóna, Andrew McLennan, Dennis White:
Permutations with roots. 157-167
Volume 17, Number 3-4, October-December 2000
- Hua-Huai Chern, Hsien-Kuei Hwang, Yeong-Nan Yeh:
Distribution of the number of consecutive records. 169-196 - Colin Cooper:
On the distribution of rank of a random matrix over a finite field. 197-212 - Artur Czumaj, Christian Scheideler:
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. 213-237 - Artur Czumaj, Miroslaw Kutylowski:
Delayed path coupling and generating random permutations. 238-259 - Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms. 260-289 - James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal:
Extension of Fill's perfect rejection sampling algorithm to general chains. 290-316 - Jennie C. Hansen, Jerzy Jaworski:
Large components of bipartite random mappings. 317-342 - Svante Janson:
Growth of components in random graphs. 343-356 - Mohammad Mahdian:
The strong chromatic index of C4-free graphs. 357-375 - Michael Molloy, Bruce A. Reed:
Near-optimal list colorings. 376-402 - Ralph Neininger:
Asymptotic distributions for partial match queries in K-d trees. 403-427 - Werner Schachinger:
Limiting distributions for the costs of partial match retrievals in multidimensional tries. 428-459
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-19 19:21 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:
