default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 38
Volume 38, Numbers 1-2, January - March 2011
- Tom Bohman
, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Ramsey games with giants. 1-32 - Béla Bollobás, Svante Janson, Oliver Riordan:
On covering by translates of a set. 33-67 - Jacob Fox, Benny Sudakov:
Dependent random choice. 68-99 - József Balogh, Jane Butterfield:
Excluding induced subgraphs: Critical graphs. 100-120 - József Balogh, Béla Csaba, Wojciech Samotij:
Local resilience of almost spanning trees in random graphs. 121-139 - Wesley Pegden:
Highly nonrepetitive sequences: Winning strategies from the local lemma. 140-161 - Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu:
Nonrepetitive list colourings of paths. 162-173 - Mihyun Kang, Colin McDiarmid:
Random unlabelled graphs containing few disjoint cycles. 174-204 - Katarzyna Rybarczyk:
Equivalence of a random intersection graph and G(n, p). 205-234
Volume 38, Number 3, May 2011
- Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald:
Regular induced subgraphs of a random Graph. 235-250 - Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi:
On the solution-space geometry of random constraint satisfaction problems. 251-268 - Béla Bollobás, Svante Janson, Oliver Riordan:
Sparse random graphs with clustering. 269-323 - Colin Cooper, Alan M. Frieze:
The cover time of random geometric graphs. 324-349 - Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
First-passage percolation on a ladder graph, and the path cost in a VCG auction. 350-364 - Linh V. Tran:
Piercing random boxes. 365-380
Volume 38, Number 4, July 2011
- Luc Devroye, Svante Janson:
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. 381-395 - Colin Cooper, Pawel Pralat:
Scale-free graphs of increasing degree. 396-421 - Andrzej Czygrinow, Brendan Nagle:
On random sampling in uniform hypergraphs. 422-440 - Krzysztof Latuszynski, Ioannis Kosmidis, Omiros Papaspiliopoulos, Gareth O. Roberts:
Simulating events of unknown probabilities via reverse time martingales. 441-452 - Mohammad Mahdian, Ying Xu:
Stochastic kronecker graphs. 453-466 - Jean-François Marckert, Grégory Miermont:
The CRT is the scaling limit of unordered binary trees. 467-501 - Ron Peled, Ariel Yadin, Amir Yehudayoff:
The maximal probability that k-wise independent bits are all 1. 502-525
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-04 01:29 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:
