AofA'2001

The Seventh Seminar on Analysis of Algorithms

1 - 7 july 2001, Tatihou (France)

News

	18 june 2001	The program has been updated. The abstracts has been added.
	7 may 2001	The list of participants has been updated. The talk informations form has been added.
	3 may 2001	The registration form has been added.
	23 april 2001	A big update of this page (information, how to get to Tatihou, provisional program).
	10 april 2001	The list of participants is available here.

Design by Mariola Szpankowska (click to enlarge)

Venue

Scope

Predicting the performance of algorithms is a likely outgrowth of ongoing research in analytic combinatorics and the analysis of random discrete structures. This workshop will bring together leading researchers in this field to focus on such problems. Probabilistic considerations on inputs and the random combinatorial structures underlying algorithmic analysis have provided an active area of modern research. One assumes some reasonable probability distribution on input instances to an algorithm as a way of understanding the inner workings of the algorithm and its "typical behavior." Experience in the field shows that it is often unwieldy to work with exact models, where on the other hand one can say something meaningful and precise on the typical "asymptotic" behavior of the algorithm, when either the underlying combinatorial structure becomes very large or when the algorithm is challenged by massive data sets. In these cases one sometimes gets simplified but exact expressions dealing with first (or higher) order expansions of averages, moments or distributions, as some parameters of the algorithmic problem grow to be very large. The focus of this workshop is the average case analysis of algorithms, and its relation to the wider areas of analytic combinatorics, exact and limiting distributions, formal techniques, probability theory, combinatorics and computer science. We identify the following areas as being of particular interest:

Properties of large randomly formed data structures,

Analytic tools for analysis of algorithms,

Probabilistic methods for analysis of algorithms,

Combinatorial methods for analysis of algorithms,

New results concerning average case analysis of classical or new algorithms,

Data compression and language-modeling methods.

Atmosphere

Following the tradition of the first four seminars, this seminar intends to bring together leading researchers in the Analysis of Algorithms and provide them with a relaxed atmosphere for interaction and discussion. Therefore, the talks will generally be brief and somewhat sparse. Long lunch breaks and one free afternoon will be purposely planned. A problem session will also be planned.

Information about the island

You can find a map to have a more precise idea of the location.

You can get general information on the island here and here

To get some informations in English on possible accomodations and tourism at Saint Vaast la Hougue which is the small town on the Continent, follow this link.

Some photographs (from personal websites) :

For remarks and comments on these web pages, please contact Julien Clément or Jérémie Bourdon.
(Last modification: 18 june, 2001)

Sections

Outils personnels

Chercher