2007 Proceedings of the Fourth 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 Fast Sorting and Pattern-avoiding Permutations
David Arthur
175 Analysis of Insertion Costs in Priority Trees
Markus Kuba and Alois Panholzer
183 The Average Profile of Suffix Trees
Mark Ward
194 On the Average Cost of Insertions on Random Relaxed K-d Trees
Amalia Duch and Conrado Martinez
201 Boltzmann Sampling of Unlabeled Structures
Philippe Flajolet, Eric Fusy and Carine Pivoteau
212 LRU Caching with Moderately Heavy Request Distributions
Predrag Jelenkovic and Xiaozhu Kang
223 Estimating the Number of Active Flows in a Data Stream over a Sliding
Window
Eric Fusy and Frederic Giroire
232 A Characterization of the Degree Sequences of 2-trees
Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat
Morin, David R. Wood and Stefanie Wuhrer
242 The Asymptotic Number of Spanning Trees in Circulant Graphs
Mordecai J. Golin, Xuerong Yong and Yuanping Zhang
250 Smoothed Analysis of Probabilistic Roadmaps
Siddhartha Chaudhuri and Vladlen Koltun
265 On the Reduction of a Random Basis
Ali Akhavi, Jean-Francois Marckert and Alain Rouault
271 Analysis of Fast Versions of the Euclid Algorithm
Eda Cesaratto, Benoit Daireaux, Loick Lhote, Veronique Maume and Brigitte
Vallee
