2009 Proceedings of the Sixth 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. ISBN: 978-0-898719-32-1
1 Pursuit and Evasion from a Distance: Algorithms and Bounds
Anthony Bonato and Ehsan Chiniforooshan
11 Coloring Geographical Threshold Graphs
Milan Bradonjić, Tobias Müller, and Allon G. Percus
17 The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks
Talip Atajan, Naohisa Otsuka, and Xuerong Yong
23 Average Size of Unstretched Remote-Spanners
Philippe Jacquet and Laurent Viennot
34 Mathematics and Computer Science Serving/Impacting Bioinformatics
Gaston Gonnet
35 Average-case Analysis of Moves in Quick Select
Hosam M. Mahmoud
41 Maximum Likelihood Analysis of Heapsort
Ulrich Laube and Markus E. Nebel
51 Balanced And/Or Trees and Linear Threshold Functions
Hervé Fournier, Daniéle Gardy, and Antoine Genitrini
58 Multidimensional Divide-and-Conquer and Weighted Digital Sums
Y. K. Cheung, Philippe Flajolet, Mordecai Golin, and C. Y. James Lee
66 Mixing Times and lp Bounds for Oblivious Routing
Gregory Lawler and Hariharan Narayanan
75 Approximating L1-distances Between Mixture Distributions Using Random Projections
Satyaki Mahalanabis and Daniel Štefankovič
85 Prediction of Unseen Proportions in Urn Models with Restricted Sampling
Manuel E. Lladser
