ANALCO Program Schedule
8:00 AM
Continental Breakfast
8:30 AM
Fast Sorting and Pattern-avoiding Permutations
David Arthur
8:50 AM
Analysis of Insertion Costs in Priority Trees
Markus Kuba and Alois Panholzer
9:10 AM
The Average Profile of Suffix trees
Mark Ward
9:30 AM
On the Average Cost of Insertions on Random Relaxed K-d Trees
Amalia Duch and Conrado Martinez
9:50 AM
Boltzmann Sampling of Unlabeled Structures
Philippe Flajolet, Eric Fusy and Carine Pivoteau
10:10 AM
Coffee Break
10:30 AM
ALENEX Invited Plenary Speaker: Madhav Marathe, Virginia Polytechnic
Institute and State University
Algorithmic Considerations in Modeling and Simulation of Large Societal
Infrastructures
11:30 AM
Lunch Break (attendees on their own)
1:00 PM
ANALCO Invited Plenary Speaker: Luc Devroye, McGill University, Canada
Weighted Heights of Random Trees
2:00 PM
Intermission
2:15 PM
LRU Caching with Moderately Heavy Request Distributions
Predrag Jelenkovic and Xiaozhu Kang
2:35 PM
Estimating the Number of Active Flows in a Data Stream over a Sliding
Window
Eric Fusy and Frederic Giroire
2:55 PM
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
3:15 PM
The Asymptotic Number of Spanning Trees in Circulant Graphs
Mordecai J. Golin, Xuerong Yong and Yuanping Zhang
3:35 PM
Smoothed Analysis of Probabilistic Roadmaps
Siddhartha Chaudhuri and Vladlen Koltun
3:55 PM
Coffee Break
4:15 PM
On the Reduction of a Random Basis
Ali Akhavi, Jean-Francois Marckert and Alain Rouault
4:35 PM
Analysis of Fast Versions of the Euclid Algorithm
Eda Cesaratto, Benoit Daireaux, Loick Lhote, Veronique Maume and Brigitte
Vallee
4:55 PM
No further ANALCO presentations scheduled. See ALENEX presentation
schedule.
6:00 PM
Business Meeting
6:30 PM
Welcome Reception
Poster Session
No poster session is scheduled for ANALCO07