Keynote speakers
Persi Diaconis (Stanford, USA)
Lazlo Lovasz (Microsoft, USA)
Madhu Sudan (MIT, USA)
Wojciech Szpankowski (Purdue, USA)

Survey-Tutorial speakers
Mireille Bousquet-Mélou (LaBRI, France)
Luc Devroye (McGill, Canada)
Philippe Flajolet (INRIA, France)

Program Commitee
Alberto Apostolico (Georgia Tech, USA)
Brigitte Chauvin (U. Versailles, France)
Philippe Chassaing (U. Nancy, France)
Luc Devroye (McGill, Canada)
Michael Drmota (TU-Wien, Austria)
Alan Frieze (Carnegie-Mellon, USA)
Micha Hofri (RPI, USA)
Hsien-Kuei Hwang (Acad, Sinica, Taiwan)
Philippe Jacquet, chair (INRIA, France)
Hosam Mahmoud (G. Washington, USA)
Conrado Martinez (UPC, Spain)
Michael Mitzenmacher (Harvard, USA)
Daniel Panario (Carleton, Canada)
Nicholas Pippenger (Princeton, USA)
Helmut Prodinger (Stellenbosh, S. Africa)
Bruno Salvy (INRIA, France)
Gilles Schaeffer (E. Polytechnique, France)
Gadiel Seroussi (MSRI, USA)
Eli Upfal (Brown U., USA)
Brigitte Vallée (U. Caen, France)
Alfredo Viola (Republica University, Uruguay)
Peter Winkler (Dartmouth, USA)

Steering Commitee
Philippe Flajolet (INRIA, France)
Donald Knuth (Stanford, USA)
Robert Sedgewick (Princeton, USA)
Wojciech Szpankowski (Purdue, USA)

The 2007 Conference on Analysis of Algorithms (AofA'07), will be held in Juan les pins near Antibes and Nice, France on June 17-22, 2007.

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probably theory, and enumerative combinatorics.

We invite papers in

We welcome papers addressing problems such as: combinatorial algorithms, string searching and pattern matching, sublinear algorithms on massive data sets, network algorithms, graph algorithms, caching and memory hierarchies, indexing, data mining, data compression, coding and information theory, and computational finance. Papers are also welcome that address bridges to research in related fields such as statical physics, computational biology, computational geometry, and simulation. The scientific program will include keynote talks, survey talks on important trends in the analysis of algorithms, and contributed research papers. There will be ample time for discussion and debate.

Submissions
Authors are invited to submit 10-pages extended abstracts by 23:59 CEST, February 26th, 2007.
See http://aofa2007.org/ for a web form and further information about submissions.
Presenters must have submitted the final versions of their papers in order to be able to present them at the conference. The conference proceedings will be published electronically by DMTCS
(see http://dmtcs.loria.fr/proceedings/) with hardcopy available at the conference.