Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 25
Volume 25, Number 1, August 2004
- Vojtech Rödl, Jozef Skokan
:
Regularity Lemma for k-uniform hypergraphs. 1-42 - Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data structures for maintaining set partitions. 43-67 - Mohammad R. Salavatipour:
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. 68-90 - David A. Levin, Yuval Peres:
Identifying several biased coins encountered by a hidden random walk. 91-114 - Andrew D. Barbour, Gesine Reinert:
Correction: Small worlds. 115
Volume 25, Number 2, September 2004
- Johan Håstad, Srinivasan Venkatesh:
On the advantage over a random assignment. 117-149 - Lars Engebretsen, Venkatesan Guruswami:
Is constraint satisfaction over two variables always easy? 150-178 - Alois Panholzer:
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. 179-207 - Servet Martínez:
Some bounds on the coupon collector problem. 208-226 - Michael M. Erlihson, Boris L. Granovsky:
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups. 227-245
Volume 25, Number 3, October 2004
- Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. 247-276 - Jean Bertoin:
Random covering of an interval and a variation of Kingman's coalescent. 277-292 - Christian Mazza:
Simply generated trees, B-series and Wigner processes. 293-310 - Jochen Geiger, Lars Kauffmann:
The shape of large Galton-Watson trees with possibly infinite variance. 311-335 - Timothy Prescott, Francis Edward Su:
Random walks on the torus with several generators. 336-345 - Martin E. Dyer, Catherine S. Greenhill:
Corrigendum: The complexity of counting graph homomorphisms. 346-352
Volume 25, Number 4, 2004
- Colin Cooper:
The cores of random hypergraphs with a given degree sequence. 353-375 - Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar:
Directed graphs, Hamiltonicity and doubly stochastic matrices. 376-395 - Sándor Csörgo, Wei Biao Wu:
On the clustering of independent uniform random variables. 396-420 - Fan R. K. Chung, Joshua N. Cooper:
De Bruijn cycles for covering codes. 421-431 - Tom Bohman, Alan M. Frieze, Nicholas C. Wormald:
Avoidance of a giant component in half the edge set of a random graph. 432-449
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-17 20:32 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:
