Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 19
Volume 19, Number 1, August 2001
- Risto Kaila:
On probabilistic elimination of generalized quantifiers. 1-36 - Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:
On the structure of clique-free graphs. 37-53 - Andrew D. Barbour, Gesine Reinert:
Small worlds. 54-74 - Tom Bohman
, Alan M. Frieze:
Avoiding a giant component. 75-85
Volume 19, Number 2, September 2001
- Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali:
On the chromatic number of set systems. 87-98 - Shi Lingsheng:
Cube Ramsey numbers are polynomial. 99-101 - Itai Benjamini, Noam Berger:
The diameter of long-range percolation clusters on finite cycles. 102-111 - Jean Jabbour-Hattab:
Martingales and large deviations for binary search trees. 112-127 - Robert W. Robinson, Nicholas C. Wormald:
Hamilton cycles containing randomly selected edges in random regular graphs. 128-147
Volume 19, Number 3-4, October-December 2001
- Philippe Flajolet:
D·E·K=(1000)8. 150-162 - Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria:
Random maps, coalescing saddles, singularity analysis, and Airy phenomena. 194-246 - Christian Borgs, Jennifer T. Chayes, Boris G. Pittel:
Phase transition and finite-size scaling for the integer partitioning problem. 247-288 - Jérémie Bourdon:
Size and path length of Patricia tries: Dynamical sources context. 289-315 - Hua-Huai Chern, Hsien-Kuei Hwang:
Phase changes in random m-ary search trees and generalized quicksort. 316-358 - Luc Devroye:
Analysis of random LC tries. 359-375 - James Allen Fill, Svante Janson:
Approximating the limiting Quicksort distribution. 376-406 - Pawel Hitczenko, Guy Louchard:
Distinctness of compositions of an integer: A probabilistic analysis. 407-437 - Svante Janson:
Asymptotic distribution for the cost of linear probing hashing. 438-471 - Conrado Martínez, Xavier Molinero:
A generic approach for the unranking of labeled combinatorial classes. 472-497 - Ralph Neininger:
On a multivariate contraction method for random recursive structures with applications to Quicksort. 498-524 - Daniel Panario, Boris G. Pittel, L. Bruce Richmond, Alfredo Viola:
Analysis of Rabin's irreducibility test for polynomials over finite fields. 525-551 - Helmut Prodinger:
Some applications of the q-Rice formula. 552-557
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 20:20 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:
