6:30-8:00 Reception at Prospect Gardens
Tuesday
July 21, 1998
Session V
Chair: Hosam Mahmoud
9:00-9:50
Normal convergence problem?
Two moments and a recurrence may
be the clues;
Boris Pittel
10:00-10:50
Total path length of
random recursive trees ;
James Fill
10:50-11:20
Coffee Break
Session VI
Chair: Jim Fill
11:20-11:45
Ascendents and descendents in
simply generated trees;
Bernhard Gittenberger
11:50-12:15
Stochastic processes for some
occupancy urn models;
Daniele Gardy
12:15-2:00
Lunch Break
Session VII
Chair: Boris Pittel
2:00-2:50
The complete solution to the
competitive rank selection problem;
Guy Louchard
3:00-3:25
Bounded degree spanning trees
of near minimum cost;
Eric Schmutz
3:30-3:55
A new asymptotic analysis of
the Move-To-The-Front
search cost distribution;
Predrag Jelenkovic
3:55-4:30
Coffee Break
Session VIII
Chair: Uwe Rosler
4:30-4:55
On the expected depth of random circuits;
Mordecai Golin
5:00-5:25
Lexicographical generation of
a generalized Dyck language;
Jens Liebehenschel
5:30-6:00
Problem session
7:30-
Banquet at Prospect Gardens
Wednesday
July 22, 1998
Session IX
Chair: Guy Louchard
9:00-9:50
Analysis of algorithms
by the contraction method;
Ludger Ruschendorf
10:00-10:50
The contraction method for
divide and conquer algorithms;
Uwe Rosler
10:50-11:20
Coffee Break
Session X
Chair: Ed Coffman
11:20-11:45
Analysis for design:
Fast approximate string matching;
Ricardo Baeza-Yates
11:50-12:15 A statistical distance measure
in genetic sequences analysis;
Robert Smythe
No afternoon talks scheduled today!
Thursday
July 23, 1998
Session XI
Chair: Alfredo Viola
9:00-9:50
Analysis of Algorithms for
Polynomials over finite fields;
Daniel Panario
10:00-10:50
Bandwidth packing algorithms;
Ed Coffman
10:50-11:20
Coffee Break
Session XII
Chair: Conrado Martinez
11:20-11:45
On the stack size of tries;
Markus Nebel
11:50-12:15
Algorithms for graph bisection
on the planted bisection model;
Anne Condon
12:15-2:00
Lunch Break
Session XIII
Chair: Robert Smythe
2:00-2:50
Analysis of the binary
GCD algorithm;
Brigitte Vallee
3:00-3:25
A birth-death process in binary trees;
Victor Miller
3:30-3:55
Asymptotic techniques for
random algebraic structures;
Kevin Compton
3:55-4:30
Coffee Break
Session XIV
Chair: Wojciech Szpankowski
4:30-4:55
Analysis of an algorithm to
find the nearest neigbor;
Patricio Poblete
5:00-5:25
On the analysis of
linear probing hashing;
Alfredo Viola
Friday
July 24, 1998
Session XV
Chair: Patricio Poblete
9:00-9:50
Analysis of bucket sorts
Hosam Mahmoud
10:00-10:50
Towards analytic information theory:
Evaluation of entropy-like sums
via analytic depoissonization;
Wojciech Szpankowski
10:50-11:20
Coffee Break
Session XVI:
Chair: Daniel Panario
11:20-11:45
Saddle Points in Random Matrices:
Analysis of Knuth search algorithms;
Micha Hofri
11:50-12:15
A natural (q,t)-analog of
Lagrange inversion;
Francois Bergeron
12:20-12:45
A top-down approach to the
analysis of rotations in
fringe-balanced binary search trees;
Helmut Prodinger
Previous: Call for Participation
Next: Registration
Workshop Index
DIMACS Homepage