Seminars from 1999-2000

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

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

Computer Algebra and Symbolic Methods

• Threshold Phenomena in Random Lattices and Reduction Algorithms, by Ali Akhavi (November 08, 1999). Abstract. Summary [ pdf | ps | html ].
• Eigenring and Reducibility of Difference Equations, by Raphaël Bomboy (March 06, 2000). Abstract. Summary [ pdf | ps | html ].
• Difference Equations with Hypergeometric Coefficients, by Manuel Bronstein (March 03, 2000). Abstract. Summary [ pdf | ps | html ].
• Attribute Grammars and Automatic Complexity Analysis, by Marni Mishna (June 19, 2000). Abstract. Slides. Summary [ pdf | ps | html ].
• Relax But Don't Be Too Lazy, by Joris van der Hoeven (January 24, 2000). Abstract. Summary [ pdf | ps | html ].
• Efficient Algorithms on Numbers, Polynomials, and Series, by Paul Zimmermann (January 24, 2000). Abstract. Summary [ pdf | ps | html ].

Analysis of Algorithms and Data Structures

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

Computational Biology and Combinatorics of Words

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

Miscellany

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

Return to the seminar page.

Return to the other years.