Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 27
Volume 27, Number 1, August 2005
- Béla Bollobás, Oliver Riordan:
Slow emergence of the giant component in the growing m-out graph. 1-24 - Shahar Mendelson
:
Embedding with a Lipschitz function. 25-45 - Lars Engebretsen, Jonas Holmerin:
Three-query PCPs with perfect completeness over non-Boolean domains. 46-75 - Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
Distances in random graphs with finite variance degrees. 76-123 - Michael Molloy:
Cores in random hypergraphs and Boolean formulas. 124-135
Volume 27, Number 2, September 2005
- Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer:
Random subgraphs of finite graphs: I. The scaling window under the triangle condition. 137-184 - Luc Devroye, Wojciech Szpankowski:
Probabilistic behavior of asymmetric level compressed tries. 185-200 - Alfredo Braunstein, Marc Mézard, Riccardo Zecchina:
Survey propagation: An algorithm for satisfiability. 201-226 - Navin Goyal, Michael E. Saks:
A parallel search game. 227-234 - Philippe Robert:
On the asymptotic behavior of some algorithms. 235-250 - Uriel Feige, Eran Ofek:
Spectral techniques applied to sparse random graphs. 251-275
Volume 27, Number 3, October 2005
- Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the giant component. 277-289 - Zhi-Dong Bai, Luc Devroye, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Maxima in hypercubes. 290-309 - Serguei Popov:
Random Bulgarian solitaire. 310-330 - Remco van der Hofstad, Gordon Slade:
Asymptotic expansions in n-1 for percolation critical values on the n-Cube and Zn. 331-357 - Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes. 358-378 - Vladimir Nikiforov, Cecil C. Rousseau:
Book Ramsey numbers. I. 379-400 - William Duckworth, Bernard Mans:
Randomized greedy algorithms for finding small k-dominating sets of regular graphs. 401-412
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 21:19 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:
