2008 Proceedings of the Fifth 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.
169 On the Convergence of Upper Bound Techniques for the Average Length of Longest
Common Subsequences
George
S. Lueker
183 Markovian Embeddings
of General Random Strings
Manuel
E. Lladser
191 Nearly Tight Bounds
on the Encoding Length of the Burrows-Wheeler Transform
Ankur
Gupta, Roberto Grossi, and Jeffrey Scott Vitter
203 Bloom Maps
David
Talbot and John Talbot
213 Augmented Graph
Models for Small-World Analysis with Geographic Factors
Van
Nguyen and Chip Martel
228 Exact Analysis of
the Recurrence Relations Generalized from the Tower of Hanoi
Akihiro
Matsuura
234 Generating Random
Derangements
Conrado
Martínez, Alois Panholzer, and Helmut Prodinger
241 On the Number of
Hamilton Cycles in Bounded Degree Graphs
Heidi
Gebauer
249 Analysis of the
Expected Number of Bit Comparisons Required by Quickselect
James
Allen Fill and Takéhiko Nakama
