Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 33
Volume 33, Number 1, August 2008
- Anders Johansson, Jeff Kahn, Van H. Vu:
Factors in random graphs. 1-28 - Mark Huber:
Perfect simulation with exponential tails on the running time. 29-43 - Shirley Halevy, Eyal Kushilevitz:
Testing monotonicity over graph products. 44-67 - Nikolaos Fountoulakis
, Bruce A. Reed:
The evolution of the mixing rate of a simple random walk on the giant component of a random graph. 68-86 - Noga Alon, Uri Stav:
What is the furthest graph from a hereditary property? 87-104 - Jennie C. Hansen, Jerzy Jaworski:
Random mappings with exchangeable in-degrees. 105-126
Volume 33, Number 2, September 2008
- Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph. 127-141 - Jirí Matousek:
On variants of the Johnson-Lindenstrauss lemma. 142-156 - Ronen Shaltiel:
How to get more mileage from randomness extractors. 157-186 - Adam Kirsch, Michael Mitzenmacher:
Less hashing, same performance: Building a better Bloom filter. 187-218 - Predrag R. Jelenkovic, Ana Radovanovic:
The persistent-access-caching algorithm. 219-251 - Jirí Cerný, Véronique Gayrard:
Hitting time of large subsets of the hypercube. 252-267
Volume 33, Number 3, October 2008
- Kevin P. Costello, Van H. Vu:
The rank of random graphs. 269-285 - Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless:
The cycle structure of two rows in a random Latin square. 286-309 - Hamed Hatami, Michael Molloy:
Sharp thresholds for constraint satisfaction problems and homomorphisms. 310-332 - Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie:
Random walks on the vertices of transportation polytopes with constant number of sources. 333-355 - David J. Galvin:
Sampling independent sets in the discrete torus. 356-376 - Federico Camia:
Universality in two-dimensional enhancement percolation. 377-408
Volume 33, Number 4, December 2008
- Benny Sudakov, Van H. Vu:
Local resilience of graphs. 409-433 - Enrica Duchi, Gilles Schaeffer:
A combinatorial approach to jumping particles: The parallel TASEP. 434-451 - Antar Bandyopadhyay, David Gamarnik:
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models. 452-479 - Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. 480-496 - Lars Engebretsen, Jonas Holmerin:
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. 497-514 - Charles Bordenave:
Eigenvalues of Euclidean random matrices. 515-532 - Simi Haber, Michael Krivelevich:
Corrigendum: On fractional K-factors of random graphs. 533-535
- Fan Chung Graham, Ronald L. Graham:
Erratum: Quasi-random graphs with given degree sequences. 536
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-18 20: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:
