2006 Proceedings of the Third 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.
185 Deterministic Random Walks
Joshua Cooper, Benjamin Doerr, Joel Spencer, and Garbor Tardos
198 Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents
Charles Knessl and Wojciech Szpankowski
205 On the Variance of Quickselect
Jean Daligault and Conrado Martinez
211 Semirandom Models as Benchmarks for Coloring Algorithms
Michael Krivelevich and Dan Vilenchik
222 New Results and Open Problems for Deletion Channels
Michael Mitzenmacher
223 Partial Fillup and Search Time in LC Tries
Svante Janson and Wojciech Szpankowski
230 Distinct Values Estimators for Power Law Distributions
Rajeev Motwani and Sergei Vassilvitskii
238 A Random-Surfer Web-Graph Model
Avrim Blum, T-H. Hubert Chan, and Mugizi Robert Rwebangira
247 Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests
Predrag Jelenkovic and Ana Radovanovic
253 Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation
Robin Pemantle and Mark Ward
263 Permanents of Circulants: A Transfer Matrix Approach
Mordecai Golin, Yiu Cho Leung, and Yajun Wang
273 Random Partitions with Parts in the Range of a Polynomial
William Goh and Pawel Hitczenko
