default search action
Random Structures and Algorithms, Volume 24
Volume 24, Number 1, January 2004
- Alexandr V. Kostochka:
Coloring uniform hypergraphs with few colors. 1-10 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Randomization helps to perform independent tasks reliably. 11-41 - Alan M. Frieze
, Michael Krivelevich, Ryan R. Martin
The emergence of a giant component in random subgraphs of pseudo-random graphs. 42-50 - Yoshiaki Itoh, Hosam M. Mahmoud
A stochastic model for solitons. 51-64 - Dmitry Panchenko:
Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph. 65-74 - Michael Drmota, Danièle Gardy, Bernhard Gittenberger
General urn models with several types of balls and Gaussian limiting fields. 75-103
Volume 24, Number 2, March 2004
- Tom Bohman
Adding random edges to dense graphs. 105-117 - Jean-François Marckert:
The rotation correspondence is asymptotically a dilatation. 118-132 - Brigitte Chauvin, Nicolas Pouyanne:
m-ary Search trees when m ge 27: A strong asymptotics for the space requirements. 133-154 - Ketan Dalal:
Counting the onion. 155-165 - Jeong Han Kim, Van H. Vu:
Divide and conquer martingales and the number of triangles in a random graph. 166-174 - Eldar Fischer, Ilan Newman, Jirí Sgall
Functions that have read-twice constant width branching programs are not necessarily testable. 175-193 - Stefanie Gerke, Thomas Schickinger, Angelika Steger:
K5-free subgraphs of random graphs. 194-232
Volume 24, Number 3, May 2004
- Svante Janson:
Large deviations for sums of partly dependent random variables. 234-248 - Dudley Stark
The vertex degree distribution of random intersection graphs. 249-258 - Amin Coja-Oghlan, Anusch Taraz:
Exact and approximative algorithms for coloring G(n, p). 259-278 - Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
Random sampling of 3-colorings in Z2. 279-302 - Graham R. Brightwell, Peter Winkler
A second threshold for the hard-core model on a Bethe lattice. 303-314 - Christian Borgs
Phase diagram for the constrained integer partitioning problem. 315-380
Volume 24, Number 4, July 2004
- Christina Goldschmidt
Essential edges in Poisson random hypergraphs. 381-396 - R. W. R. Darling, David A. Levin
Continuous and discontinuous phase transitions in hypergraph processes. 397-419 - Malwina J. Luczak
Building uniformly random subtrees. 420-443 - Geoffrey R. Grimmett, Stephan N. Winkler:
Negative association in uniform forests and connected graphs. 444-460 - Martin E. Dyer
Mixing in time and space for lattice spin systems: A combinatorial view. 461-479 - Jacob van den Berg, Rachel Brouwer:
Self-destructive percolation. 480-501 - Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
Random MAX SAT, random MAX CUT, and their phase transitions. 502-545
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-12-23 19:20 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: