default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDANALCO 2011: San Francisco, California, USA
- Philippe Flajolet, Daniel Panario:
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011, San Francisco, California, USA, January 22, 2011. SIAM 2011, ISBN 978-1-61197-301-3 - Hamed Amini, Moez Draief, Marc Lelarge:
Flooding and Diameter in Weighted Random Graphs. 1-15 - Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-edge Random Graphs. 16-22 - Olivier Bodini, Danièle Gardy, Bernhard Gittenberger
:
Lambda-terms of Bounded Unary Height. 23-32 - John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas:
Heapable Sequences and Subsequences. 33-44 - Brigitte Chauvin, Danièle Gardy, Cécile Mailler:
The Growing Trees Distribution on Boolean Functions. 45-56 - Robert Sedgewick:
Algorithms for the Masses. 57 - Sandrine Dasse-Hartaut, Pawel Hitczenko:
Some Properties of Random Staircase Tableaux. 58-66 - Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. 67-75 - David Eisenstat:
Random Road Networks: The Quadtree Model. 76-84 - Michael Fuchs:
The Subtree Size Profile of Plane-oriented Recursive Trees. 85-92 - Michael T. Goodrich:
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. 93-106 - Pegah Kamousi, Subhash Suri:
Stochastic Minimum Spanning Trees and Related Problems. 107-116 - Sanaa Kholfi, Hosam M. Mahmoud:
The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases. 117-126 - Guy Louchard, Conrado Martinez, Helmut Prodinger:
The Swedish Leader Election Protocol: Analysis and Variations. 127-134 - Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Cluster Algorithms for Discrete Models of Colloids with Bars. 135-149
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-11-04 00:24 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:
