The First Workshop on
Analytic Algorithmics and Combinatorics (ANALCO04)
ANALCO 2004
Workshop on Analytic Algorithmics and Combinatorics
Astor Crowne Plaza Hotel, New Orleans
January 10, 2003
- 8:00 AM
- Continental Breakfast (Grand Ballroom A/B)
-
- 8:30 AM
- Opening Discussion
-
- 9:00 AM
- Theory and Practice of Counting Algorithms
- Philippe Flajolet, INRIA, Rocquencourt
-
- 10:00 AM
- Coffee Break (Grand Ballroom A/B)
-
- 10:30 AM
- Analysis of a Randomized Selection Algorithm Motivated by the
LZ77 Scheme (pdf)
Mark Ward and Wojciech Szpankowski, Purdue
-
- 11:00 AM
- The Complexity of Jensen’s Algorithm for Counting Polyominoes
(pdf)
Gill Barequet and Micha Moffie, Technion, Haifa
-
- 11:30 AM
- Distributional Analyses of Euclidean Algorithms (pdf)
Viviane Baladi and Brigitte Vallée, CNRS, France
-
- 12:00 PM
- Lunch (attendees on their own)
-
- 1:30 PM
- A Simple Primality Test and the rth Smallest Prime Factor (pdf)
- Daniel Panario, Carleton University, Ottowa, Bruce Richmond and Martha
Yip, University of Waterloo
-
- 2:00 PM
- Gap-free Samples of Geometric Random Variables (pdf)
- Pawel Hitczenko, Drexel, and Arnold Knopfmacher, Wits University, Johannesburg
-
- 2:30 PM
- Computation of a Class of Continued Fraction Constants (pdf)
- Loïck Lhote, Université de Caen, France
-
- 3:00 PM
- Coffee Break (Grand Ballroom A/B)
-
- 3:30 PM
- Compositions and Patricia Tries: No Fluctuations in the Variance
(pdf)
Helmut Prodinger, Wits University, Johannesburg
-
- 4:00 PM
- Quadratic Convergence for Scaling of Matrices (pdf)
Martin Fürer, Penn State
-
- 4:30 PM
- Partial Quicksort (pdf)
Conrado Martínez, Universitat Politècnica de Catalunya, Barcelona
-
- 5:00 PM
- Panel on Future Directions
-
- 6:00 PM
- SODA Welcome Reception (Grand Ballroom D)
1/7/04