This is a collection of abstracts and summaries of the talks given at the Algorithms Seminar for the year 2001-2002. All of these summaries are available in the form of a single INRIA research report. Algorithms seminar, 2001-2002 (Research Report #5003).

Combinatorics

• The Site Perimeter of Bargraphs, by Mireille Bousquet-Mélou. Abstract. Summary [ps | pdf].
• Animals, Domino Tilings, Functional Equations, by Mireille Bousquet-Mélou. Abstract. Summary [ps | pdf].
• Counting Domino Tilings of Rectangles via Resultants, by Volker Strehl. Abstract. Slides [pdf]. Summary [ps | pdf].
• Random Generation from Boltzmann Principles, by Philippe Flajolet. Abstract. Summary [ps | pdf].
• A Relaxed Approach to Tree Generation, by Philippe Duchon. Abstract. Summary [ps | pdf].
• Symmetric Functions and P-Recursiveness, by Marni Mishna. Abstract. Slides [ps | pdf]. Summary [ps | pdf].

Symbolic Computation

• Computation of the Inverse and Determinant of a Matrix, by Gilles Villard. Abstract. Slides [ps]. Summary [ps | pdf].
• Fast Algorithms for Polynomial Systems Solving, by Alin Bostan. Abstract. Slides [ps| pdf]. Summary [ps | pdf].
• Transseries Solutions of Algebraic Differential Equations, by Joris van der Hoeven. Abstract. Slides [ps]. Summary [ps | pdf].
• Recent Algorithms for Solving Second-Order Differential Equations, by Jacques-Arthur Weil. Abstract. Summary [ps | pdf].
• The Structure of Multivariate Hypergeometric Terms, by Marko Petkovsek. Abstract. Summary [ps | pdf].
• Numerical Elimination, Newton Method and Multiple Roots, by Jean-Claude Yakoubsohn. Abstract. Slides [ps | pdf]. Summary [ps | pdf].

Analysis of Algorithms, Data Structures, and Network Protocols

• Everything You Always Wanted to Know about Quicksort, but Were Afraid to Ask, by Marianne Durand. Abstract. Slides [ps | pdf]. Summary [ps | pdf].
• Travelling Waves and the Heigth of Binary Search Trees, by Michael Drmota. Abstract. Summary [ps | pdf].
• Microscopic Behavior of TCP, by Philippe Robert, Abstract. Summary [ps | pdf].
• Interaction Between Sources Controlled by TCP, by François Baccelli. Abstract. Summary [ps | pdf].
• Asymptotic Analysis of TCP Performances Under Mean-field Approximation, by Philippe Jacquet. Abstract. Slides [ps | pdf]. Summary [ps | pdf].

Asymptotics and Analysis

• A Hyperasymptotic Approach of the Multi-Dimensional Saddle-Point Method, by Éric Delabaere. Abstract. Summary [ps | pdf].
• Ramanujan's Summation, by Éric Delabaere. Abstract. Summary [ps | pdf].
• Multi-Variable $\sinc$ Integrals and the Volumes of Polyhedra, by Jonathan Borwein. Abstract. Slides [ps | pdf]. Summary [ps | pdf].

Number Theory

• $L$-Series of Squares of Squares, by Jonathan Borwein. Abstract. Slides [ps | pdf]. Summary [ps | pdf].
• Irrationality of the $\zeta$ Function on Odd Integers, by Tanguy Rivoal. Abstract. Summary [ps | pdf]. Summary [ps | pdf].
• Irrationality Measures of $\log 2$ and $\pi/\sqrt{3}$, by Nicolas Brisebarre. Abstract. Slides [ps | pdf]. Summary [ps | pdf].

Miscellany

• Approximate Matching of Secondary Structures, by Mathieu Raffinot. Abstract. Summary [ps | pdf].
• Les algorithmes évolutionnaires : état de l'art et enjeux (Evolutionary Algorithms: State of the Art and Stakes), by Marc Schoenauer. Abstract. Slides [pdf]. Summary [ps | pdf].

ALEA'2002 Lecture Notes

• Systèmes dynamiques et analyse d'algorithmes (Dynamical Systems and Algorithms), by Viviane Baladi and Brigitte Vallée. Summary [ps | pdf].
• Martingales discrètes et applications à l'analyse d'algorithmes (Discrete Martingales Applied to Algorithms Analysis), by Brigitte Chauvin. Summary [ps | pdf].
• Phase Transitions and Satisfiability Threshold, by Olivier Dubois. Summary [ps | pdf].
• Génération aléatoire (Random Generation), by Alain Denise. Summary [ps | pdf].
• Combinatorics and Random Generation, by Nicolas Bonichon. Summary [ps | pdf].

Return to the seminar page.

Return to the other years.