default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 30
Volume 30, Numbers 1-2, January - March 2007
- Colin Cooper, Alan M. Frieze
:
The cover time of sparse random graphs. 1-16 - Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Cliff Smyth:
Randomly generated intersecting hypergraphs II. 17-34 - Svante Janson, Nicholas C. Wormald:
Rainbow Hamilton cycles in random regular graphs. 35-49 - Svante Janson, Malwina J. Luczak:
A simple solution to the k-core problem. 50-62 - Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks:
Probabilistic strategies for the partition and plurality problems. 63-77 - Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid:
Random cubic planar graphs. 78-94 - Jan Vondrák:
Shortest-path metric approximation for random subgraphs. 95-104 - József Balogh, Boris G. Pittel, Gelasio Salazar:
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. 105-130 - Francis Comets, François Delarue, René Schott:
Distributed algorithms in an ergodic Markovian environment. 131-167 - Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda:
Sampling binary contingency tables with a greedy start. 168-205 - Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth:
Probabilistic analysis for a multiple depot vehicle routing problem. 206-225 - Artur Czumaj, Christian Sohler:
Sublinear-time approximation algorithms for clustering via random sampling. 226-256 - József Balogh, Boris G. Pittel:
Bootstrap percolation on the random regular graph. 257-286 - Jennie C. Hansen, Jerzy Jaworski:
A cutting process for random mappings. 287-306
Volume 30, Number 3, May 2007
- László Lovász, Santosh S. Vempala:
The geometry of logconcave functions and sampling algorithms. 307-358 - Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
The weight of the shortest path tree. 359-379 - Hsien-Kuei Hwang:
Profiles of random trees: Plane-oriented recursive trees. 380-413 - Imre Bárány:
The chance that a convex body is lattice-point free: A relative of Buffon's needle problem. 414-426 - Amit Chakrabarti, Subhash Khot:
Improved lower bounds on the randomized complexity of graph properties. 427-440
Volume 30, Number 4, July 2007
- Simi Haber, Michael Krivelevich:
On fractional K-factors of random graphs. 441-463 - József Balogh, Robin Pemantle:
The Klee-Minty random edge chain moves with linear speed. 464-483 - Abraham D. Flaxman, Alan M. Frieze:
The diameter of randomly perturbed digraphs and some applications. 484-504 - Anton Bovier, Irina A. Kurkova:
Poisson convergence in the restricted k-partitioning problem. 505-531 - Surender Baswana, Sandeep Sen:
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. 532-563 - Bernard Ycart, Joel Ratsaby:
The VC dimension of k-uniform random hypergraphs. 564-572
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 2025-12-05 22:25 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:
