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

Combinatorics

• Enumeration of planar rooted triangulations, by Jason Zhicheng Gao. Abstract. Slides [ps | pdf]. Summary [ps | pdf | html].
• Some Sharp Concentration Results about Random Planar Triangulations, Jason Zhicheng Gao. Abstract. Slides [ps | pdf]. Summary [ps | pdf | html].
• Planar Maps and Composition Schemes, by Gilles Schaeffer. Abstract.
• Coalescence: emergence of the map-Airy law, by Cyril Banderier. Abstract. Summary [ps | pdf | html].
• Enumeration of geometric configurations on a convex polygon, by Marc Noy. Abstract. Summary [ps | pdf | html].
• Tutte Polynomials in Square Grids, by Marc Noy. Abstract. Summary [ps | pdf | html].
• Random Group Automata, by Cyril Nicaud. Abstract. Summary [ps | pdf | html].
• Solving Discrete Initial- and Boundary-Value Problems, by Marko Petkovsek. Abstract. Summary [ps | pdf | html].
• Classifying ECO-Systems and Random Walks, by Cyril Banderier. Abstract. Summary [ps | pdf | html].
• Combinatorics of Harmonic Polynomials, by François Bergeron. Abstract.

Computer Algebra and Symbolic Methods

• Efficient Algorithms on Numbers, Polynomials, and Series, by Paul Zimmermann. Abstract. Summary [ps | pdf | html].
• Relax But Don't Be Too Lazy, by Joris van der Hoeven. Abstract. Slides, Part 1 [ps | pdf] and Part 2 [ps | pdf]. Summary [ps | pdf | html].
• Threshold Phenomena in Random Lattices and Reduction Algorithms, by Ali Akhavi. Abstract. Summary [ps | pdf | html].
• Eigenring and Reducibility of Difference Equations, by Raphaël Bomboy. Abstract. Summary [ps | pdf | html].
• Difference Equations with Hypergeometric Coefficients, by Manuel Bronstein. Abstract. Summary [ps | pdf | html].
• Attribute Grammars and Automatic Complexity Analysis, by Marni Mishna. Abstract. Slides [ps | pdf]. Summary [ps | pdf | html].

Analysis of Algorithms and Data Structures

• Average Bit-Complexity of Euclidean Algorithms, by Brigitte Vallée. Abstract. Summary [ps | pdf | html].
• Continued Fractions, Comparison Algorithms and Fine Structure Constants, by Philippe Flajolet. Abstract. Summary [ps | pdf | html].
• Continued Fractions and Modular Forms, by Ilan Vardi Abstract part 1. Abstract part 2. Summary [ps | pdf | html].
• Transcendence of Numbers whose Expansion in Base b or into Continued Fractions is ``Too Regular'', by Jean-Paul Allouche. Abstract. Summary [ps | pdf | html].
• Routing Permutations on Trees, by Sylvie Corteel. Abstract. Summary [ps | pdf | html].
• Synchronous Decision Diagrams: a Data Structure for Representing Finite Sequential Digital Functions, by Jean Vuillemin. Abstract. Slides [ps | pdf]. Summary [ps | pdf | html].

Computational Biology and Combinatorics of Words

• Bayesian Approach to DNA Segmentation into Regions with Different Average Nucleotide Composition, by Vsevolod Makeev. Abstract. Summary [ps | pdf | html].
• Enumeration of Autocorrelations and Computation of Their Populations, by Éric Rivals.Abstract. Summary [ps | pdf | html].
• Classification by Trees: the Shape of the Inferred Tree Depends on the Algorithmic Scheme Selected, by Olivier Gascuel. Abstract.
• Factor Oracle, Suffix Oracle, by Mathieu Raffinot. Abstract. Summary [ps | pdf | html].

Miscellany

• On random graph homomorphisms into Z, by Elchanan Mossel. Abstract.
• Distributional Analysis of Recursive Algorithms by the Contraction Method, by Ralph Neininger. Abstract Slides. Summary [ps | pdf | html].
• Analytic Information Theory and the Redundancy Rate Problem, by Wojciech Szpankowski. Abstract. Slides [ps | pdf]. Summary [ps | pdf | html].
• Queues, Stacks, and Transcendentality at the Transition to Chaos, by Cristopher Moore. Abstract. Summary [ps | pdf | html].
• Colorings, Potts Models, Height Representations, and Entropic Forces, by Cristopher Moore. Abstract.

Return to the seminar page.

Return to the other years.