MONDAY

8:50 -- 9:00 Welcome 

9:00 - 10:00 
CHAIR. B. Sedgewick

P. Flajolet
Some Airy phenomena of analytic combinatorics"

10:00 - 10:30 BREAK

10:30 - 12:00
CHAIR: B. Sedgewick 

H-K. Hwang 
"An asymptotic theory for recurrence relations based on
            minimization and maximization"

G. Schaeffer 
"Large components and random sampling of planar maps"

M. Soria 
"Singularity Composition Schemas"


12:00 - 2:00 BREAK

2:00 - 3:30
CHAIR: S. Janson

P. Chassing 
"The height and width of simple trees"

B. Gittenberger 
"The Width of Galton-Watson Trees"

A. Panholzer 
"More results about non-crossing trees on a circle"

3:30 - 4:00 BREAK

4:00 - 6:00
CHAIR: H. Prodinger

H-H. Chern  
"Limit distributions of the cost of partial match queries in random 
2-dimensional quadtrees and relaxed K-d trees"

M. Nebel 
"On the Horton-Strahler Number for Uniform Random Tries"

W. Schachinger 
"Multidimensional tries: Asymptotic normality of the costs of almost 
every partial match query"

C. Martinez 
"Combinatorics, probability and geometry or how to
analyze range queries in K-dimensional data structures"

8:00 WELCOME PARTY


TUESDAY

9:00 - 10:00 
CHAIR: M. Karonski

S. Janson
"Four methods and one theorem - another look at hashing with linear probing"

10:00- 10:30 BREAK

10:20 - 12:30
CHAIR: M. Karonski

R. Kemp 
"On the Expected Number of Leftist Nodes in Simply Generated Trees"

B. Smythe 
"Stochastic Analysis of Shell Sort"

JF. Marckert 
"Parking with density"

E. Coffman
"Probabilistic Analysis of Greedy Reservation Protocols"


12:30 - 2:00 LUNCH

2:00 - 4:00
CHAIR: C. Martinez

M. Karpinski 
"Improved Approximation of MAX-CUT on Graphs of Bounded Degree"

U. Rosler 
"A New Ultimate Convex Hull Algorithm in the Plane"

E. Sutinen
"Evaluating the average filtration efficiency of a q-gram based
            approximate pattern matching algorithm"    

M. Golin 
"New Upper and Lower Bounds on the Channel Capacity of Read/Write 
Isolated Memory


4:00-4:30 BREAK 

4:30 5:30
CHAIR: U. Rosler

D. Panario 
"Polynomials over Finite Fields Free from Large and Small Degree 
Irreducible Factors and Cryptographical Applications'

H. Wozniakowski 
"Average Case Complexity of Continuous Problems"


5:30 - 6:00 BREAK

6:00 OPEN PROBLEM SESSION
CHAIR: Flajolet

WEDNESDAY

9:00 - 10:00
CHAIR: W. Szpankowski

H. Prodinger
"Old and New results on Alternating Sums"

10:00 - 10:15 SHORT BREAK

10:15 - 12:30
CHAIR. W. Szpankowski

D. Merlini 
"A generating tree approach to schedule printing devices"

X. Yong 
"The Number Of Spanning Trees In  Circulant Graphs"

M. Nguyen 
"Distributions of Valuations on Trees"

R. Neininger 
"Sampling from the Quicksort Limit Distribution"

11:15 - 11:30 SHORT BREAK
Chair: W. Szpankowski

11:30 - 12:30

C. Banderier 
"The kernel method"

J. Clement  
"Analysis of hybrid tries"

J. Bourdon 
"Number of matches of a pattern in a random text: application
            to the stacksize of a trie."

Y. Reznik 
"On Three Classes of Tries with Adaptive Multi-Digit Branching"


EXCURSION TO GDANSK

THURSDAY

9:00 - 10:00 
CHAIR: H. Mahmoud

D. Aldous
"Zeta(2), the Random Assignment Problem, and Essential Uniqueness of 
Random Optimization Problems'


10:00 - 10:30 BREAK

10:30 12:00
CHAIR: H. Mahmoud

Y. Kontoyiannis 
"Probabilistic Phenomena in Data Compression"

P. Jacquet 
"Asymptotic Optimal Prediction Based on Pattern Matching"

A. Viola 
"Some open problems in the Combinatorial Structure of Linear 
Probing Hashing with Buckets"


12:00 -2:00 Lunch

2:00-3:30
CHAIR:  B. Vallee

G. Louchard 
"Distinctness of compositions of an integer:Probabilistic Analysis"

P. Hitczenko 
"On the distribution of distinct part sizes in random composition of integer"

H. Shachnai 
''Finding Independent Sets of Guaranteed Size in Uniform Hypergraphs''

3:30 - 4:00 BREAK

4:00 - 6:00
CHAIR: H-K. Hwang

D. Gardy 
"Dynamical urn models revisited"

H. Mahmoud 
"Urn Models with Non-square Addition Matrix"

B. Vallee 
"Average bit-complexity of Euclidean Algorithms"

A. Akhavi 
"Threshold phenomena in an "easy" class of random lattices
            and efficient reduction algorithms."

8:00 BANQUET

FRIDAY

9:00 - 10:00
CHAIR: P. Jacquet

M. Drmota
"The height and profile of binary and m-ary search trees"

10:00 - 10:30 BREAK

10:30 - 1:00 
CHAIR: P. Jacquet

B. Chauvin 
"A Martingale Method for the Profile of Binary Search Trees"

J. Fill 
"An In-depth Probabilistic Analysis of Quicksort"

M. Kubale
"Can Small Graphs be Colored Optimally"

W. Szpankowski 
"Height Distribution in Digital Trees"

2:00-9:00  DISCUSSION and SURPRISE