[Monkey Saddle picture]

Eighth Seminar on Analysis of Algorithms


Below you can find the program for the week.

Sunday, June 23
19:00 cold dinner
Monday, June 24
09:05-10:05Philippe Jacquet (INRIA Rocquencourt): Poissonization and Depoissonization of Generating Functions
10:05-10:30coffee break
10:30-11:00Stéphane Boucheron (Université Paris Sud): About the Size of the Giant Component in a Random Graph with Given Degree Distribution
11:00-11:30Andreas Weiermann (Westfälische Wilhelms-Universität Münster): Some Applications of Analytic Combinatorics in Logic
11:45-12:15Christian Krattenthaler (Universität Wien): Asymptotic Analysis of Stars and Watermelons
12:15-12:45Donatella Merlini (Universitá degli Studi di Firenze): On Some Tiling Games
13:00-15:30lunch and free time
15:30-16:00Brigitte Chauvin (Université de Versailles): AND/OR Trees Revisited
16:00-16:30Rainer Kemp (Johann Wolfgang Goethe-Universität): On the Representation of Simply Generated Trees by Leftist Trees
16:30-17:00Wojtek Szpankowski (Purdue University): The Precise Minimax Redundancy
17:00-17:30coffee break
17:30-18:00Philippe Chassaing (Institut Elie Cartan): Cutting a Random Tree (and UNION-FIND Algorithms)
18:00-18:30Hadas Shachnai (Bell Labs and The Technion): Probabilistic Tools in the Analysis of Randomized Parallel Algorithms
Tuesday, June 25
09:00-10:00Robin Pemantle (Ohio State University): Automatic Asymptotics for Multivariate Generating Functions
10:00-10:30coffee break
10:30-11:00Nevin Kapur (The John Hopkins University): Singularity Analysis for Hadamard products, with Applications
11:00-11:30Cyril Banderier (INRIA Rocquencourt): Discrete Smooth Analysis
11:45-12:15Alfredo Viola (INCO): On Worst-Case Robin Hood Hashing
12:15-12:45Marianne Durand (INRIA Rocquencourt): A Probabilistic Counting Algorithm
13:00-14:00lunch and free time
14:00-18:30excursion to Bad Ischl (Kaiservilla) and Hallstatt
20:00-21:00problem session
Wednesday, June 26
09:00-10:00Harald Niederreiter (National University of Singapore): Complexity Measures for Binary Sequences
10:00-10:30coffee break
10:30-11:00Gerhard Larcher (Universität Linz): On the Tractability of the Brownian Bridge Algorithm
11:00-11:30Peter Grabner (Technische Universität Graz): Digital Sums and Divide-and-Conquer Recurrences: Fourier Expansions and Absolute Convergence
11:45-12:15Clemens Heuberger (Technische Universität Graz): Symmetric Signed Digit Expansions: Minimality, Algorithms, Quantitative Analysis, and Extensions
12:15-12:45Wolfgang Steiner (Technische Universität Wien): Central Limit Theorems for Digital Expansions
13:00-15:30lunch and free time
15:30-15.50Brigitte Vallée (Université de Caen): The Concept of "Dynamical Analysis"
15:50-16:10Jérémie Bourdon (Université de Caen): Generalized Pattern Matching Statistics
16:20-16:40Benoît Daireaux (Université de Caen): Dynamical Analysis of the Truncated Euclidean Algorithm
16:40-17:00Brigitte Vallée (Université de Caen): Instances of Dynamical Analyses Using More Complex Dynamical Systems
17:00-17:30coffee break
17:30-18:30Poster Session
Anne-Elisabeth Baert (LaRIA): Broadcasting Algorithm in Cellular Networks Based on Voronoï Diagram and Delaunay Triangulation
Frédérique Bassino (Université de Marne-la-Vallée): The Average Lengths of the Factors of the Standard Factorization of Lyndon Words
Julien Clément (Université de Marne-la-Vallée): The Average Lengths of the Factors of the Standard Factorization of Lyndon Words
Michael Drmota (Technische Universität Wien): The Random Bisection Problem and the Distribution of the Height of Binary Search Trees
Michael Fuchs (Technische Universität Wien): Metric Theory of Continued Fraction Expansions and Diophantine Approximations
Leonidas Georgiadis (Aristotle University of Thessaloniki): Algorithms for Two Optimization Problems on Directed Graphs
Bernhard Gittenberger (Technische Universität Wien): On the Profile of Random Forests
John Kieffer (University of Minnesota Twin Cities): Asymptotics of Viterbi Algorithm Encoded Trellis Coded Quantizers
Thomas Klausner (Technische Universität Wien): 2-admissible Functions and Gaussian Limiting Distribution
Gyesik Lee (Westfälische Wilhelms-Universität Münster): Friedman Style Independence Results for Kruskal's Theorem
Manuel E. Lladser (The Ohio State University): What Is the Order of $a_{r,r+o(r)}$, When $a_{r,r}$ Decays Polynomially but $a_{r,d\cdot r}$ ($d\ne1$) Decays Exponentially?
Jean-François Marckert (Université de Versailles): Ladder Variables, Internal Structure of Simple Trees and Finite Branching Random Walks
Michel Nguyen-The (École Polytechnique): Distribution of the Size of Simplified or Reduced Trees
Pierre Nicodème (CNRS - La Genopole): Proteome Analysis Based on Motif Statistics
Thursday, June 27
09:00-10:00Kevin Compton (University of Michigan): Probabilistic Transforms in the Analysis of Algorithms
10:00-10:30coffee break
10:30-11:00Yuri Reznik (RealNetworks, Inc.): On Time/Space Performance of Tries with Adaptive Branching
11:00-11:30Werner Schachinger (Universität Wien): Concentration of Distribution Results for Trie-Based Sorting of Continued Fractions
11:45-12:15Ralph Neininger (McGill University): Rates of Convergence for Some Recurrences
12:15-12:45Ludger Rüschendorf (Universität Freiburg): Asymptotics of First Moments, the Clue for the Asymptotics of the Distribution of Recursive Sequences
13:00-14:00lunch and free time
14:00-18:30excursion to Salzburg
or -22:30excursion to Salzburg with concert
Friday, June 28
09:00-10:00Steve Lalley (University of Chicago): Random Walks on Regular Languages and Algebraic Systems of Generating Functions
10:00-10:30coffee break
10:30-11:00Helmut Prodinger (University of the Witwatersrand): Two Applications of the Kernel Method: A Simple Guessing Game and a Functional Equation
11:00-11:30Philippe Flajolet (INRIA Rocquencourt): Random Sampling from Boltzmann Principles
11:45-12:15Gilles Schaeffer (LORIA): Random Quadrangulations and Aldous' ISE
12:15-12:45Jim Fill (Johns Hopkins University): Knockin' 'em Down, One After Another
13:00-15:30lunch and free time
15:30-16:30Alois Panholzer (Technische Universität Wien): About Multiple Quickselect and the Spanning Tree Size in Binary Search Trees
16:30-17:00coffee break
17:00-17:30Nicolas Pouyanne (Université de Versailles): What Happens When $m\geq 27$?
17:30-18:00Uwe Rösler (Mathematisches Seminar zu Kiel): FIND Revisited
18:00-18:30Tsung-Hsi Tsai (Academia Sinica): Berry-Esseen Bounds for the Number of Maxima
19:00conference dinner
Saturday, June 29
09:30-10:00Hsien-Kuei Hwang (Academia Sinica): Partial Match Queries in Random $k$-$d$ trees
10:00-10:30Hua-Huai Félix Chern (Taipei Municipal Teacher's College): Partial Match Queries in Random Quadtrees
10:30-10:50coffee break
10:50-11:20Markus Nebel (Johann Wolfgang Goethe-Universität): On the Application of Generating Functions in the Context of Realistic RNA Secondary Structures
11:20-11:50Christian Mauduit (Université de la Méditerranée): Measures of Pseudorandomness for Finite Binary Sequences
11:50-12:20Vladimir Vatutin (Steklov Institute of Mathematics): Limit Theorems for a Catalytic Branching Random Walk

Back to main page.

Comments please to Thomas Klausner.

Last modified: Mon Jul 1 16:41:09 CEST 2002