2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order.
1 Flooding and Diameter in Weighted Random Graphs
Hamed Amini, Moez Draief and Marc Lelarge
16 On Vertex, Edge, and Vertex-edge Random Graphs
Elizabeth Beer, James A. Fill, Svante Janson and Edward R. Scheinerman
23 Lambda-terms of Bounded Unary Height
Olivier Bodini, Daniele Gardy and Bernhard Gittenberger
33 Heapable Sequences and Subsequences
John Byers, Brent Heeringa, Michael Mitzenmacher and Georgios Zervas
45 The Growing Trees Distribution on Boolean Functions
Brigitte Chauvin, Danièle Gardy and Cécile Mailler
57 Algorithms for the Masses
Robert Sedgewick
58 Some Properties of Random Staircase Tableaux
Sandrine Dasse-Hartaut and Pawel Hitczenko
67 Finding Hidden Cliques in Linear Time with High Probability
Yael Dekel, Ori Gurel-Gurevich and Yuval Peres
76 Random Road Networks: The Quadtree Model
David Eisenstat
85 The Subtree Size Profile of Plane-oriented Recursive Trees
Michael Fuchs
93 Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
Michael Goodrich
107 Stochastic Minimum Spanning Trees and Related Problems
Pegah Kamousi and Subhash Suri
117 The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases
Sanaa Kholfi and Hosam Mahmoud
127 The Swedish Leader Election Protocol: Analysis and Variations
Guy Louchard, Conrado Martinez and Helmut Prodinger
135 Cluster Algorithms for Discrete Models of Colloids with Bars
Sarah Miracle, Dana Randall and Amanda Pascoe Streib
