This is a collection of abstracts and summaries of the talks given
at the
Algorithms Seminar
for the year 1997-1998. All of these summaries are available in the
form of a single INRIA research report.
Algorithms seminar, 1997-1998 (Research Report #3504).
Combinatorics
- Comment énumérer des chemins, des polyominos ou des
animaux, by Dominique
Gouyou-Beauchamps.
Abstract.
Summary [ps |
pdf |
html].
- Permutations triées et/ou triables, by Mireille
Bousquet-Mélou.
Abstract.
Summary [ps |
pdf |
html].
- From Motzkin to Catalan permutations: a ``discrete continuity'',
by Renzo Pinzani.
Abstract.
Summary [ps |
pdf |
html].
- Produits de permutations et cartes combinatoires,
by Gilles Schaeffer.
Abstract.
Summary [ps |
pdf |
html].
- Multivariate Lagrange Inversion, by Bruce Richmond.
Abstract.
Summary [ps |
pdf |
html].
- Une formule combinatoire pour les coefficients de séries
algebriques, by Michèle Soria.
Abstract.
Summary [ps |
pdf |
html].
- Transcendance de séries génératrices,
by Jean-Paul Allouche.
Abstract.
Summary [ps |
pdf |
html].
- Special Values of Multidimensional Polylogarithms, by David M. Bradley.
Abstract.
Summary [ps |
pdf |
html].
- Monodromie des polylogs, by Minh Hoang Ngoc.
Slides.
Abstract.
Summary [ps |
pdf |
html].
- A Combinatorial Approach to Golomb Trees
by Mordecai Golin.
Abstract.
Summary [ps |
pdf |
html].
- The asymptotics of colouring rules for finite trees, by
Alan Woods.
Abstract.
Summary [ps |
pdf |
html].
- Fraïssé-Ehrenfeucht Games and Asymptotics, by
Alan Woods.
Abstract.
Summary [ps |
pdf |
html].
- Physique statistique des systèmes désordonnés
et problèmes combinatoires aléatoires. Le graphe
aléatoire, by Rémi Monasson. Abstract.
Summary [ps |
pdf |
html].
- Physique statistique des systèmes désordonnés
et problèmes combinatoires aléatoires. Le
problème de $K$-satisfiabilité aléatoire, by
Rémi Monasson.
Abstract.
Summary [ps |
pdf |
html].
Symbolic Computation
- q-WZ-Theory and Bailey Chains,
by Peter
Paule.
Abstract.
Summary [ps. |
pdf. |
html]..
- Développements asymptotiques $q$-Gevrey et
sommabilité des séries entières
solutions formelles d'une équation aux $q$-différences,
by Changgui Zhang.
Abstract.
Summary [ps |
pdf |
html].
- ISOLDE --- a package for the symbolic resolution of systems
of linear differential equations,
by Eckhard Pflügel.
Abstract.
Summary [ps |
pdf |
html].
- Algèbre différentielle et applications en
Maple, by Évelyne
Hubert.
Abstract.
Examples.
Summary [ps |
pdf |
html].
- Résolution effective d'équations diophantiennes,
by Guillaume Hanrot.
Abstract.
Summary [ps |
pdf |
html].
- Solution of Polynomial Equations, by Victor Pan.
Abstract.
Summary [ps |
pdf |
html].
- Un test probabiliste d'irréductibilité absolue des
polynômes à coefficients dans ${\mathbb Q}$,
by Jean-François Ragot.
Abstract.
Summary [ps |
pdf |
html].
- La réduction d'Hermite paresseuse, by Manuel
Bronstein.
Abstract.
Summary [ps |
pdf |
html].
- Primalité et courbes elliptiques ou le retour d'ECPP,
by François Morain.
Abstract.
Summary [ps |
pdf |
html].
- Primalité cyclotomique, by Preda
Mihailescu. Abstract.
Summary not available.
Analysis of Algorithms and Data Structures
- Analyse du hachage avec essais linéaires,
by Philippe
Flajolet. Abstract.
Slides.
Summary [ps |
pdf |
html].
- Smallest components in combinatorial structures,
by Daniel Panario.
Abstract.
Summary [ps |
pdf |
html].
- Analysis of hybrid tries,
by Julien Clément.
Abstract.
Summary [ps |
pdf |
html].
- Pólya urn models in random trees,
by Hosam Mahmoud.
Abstract.
Summary [ps |
pdf |
html].
- A Top-Down Analysis of Fringe-Balanced Binary Search Trees, by Helmut
Prodinger.
Abstract.
Summary [ps |
pdf |
html].
- Binary Search Trees and 1-Dimensional Random Packing, by
Yoshiaki Itoh.
Abstract.
Summary [ps |
pdf |
html].
- On Tree-Growing Search Strategies,
by Hosam Mahmoud.
Abstract.
Summary [ps |
pdf |
html].
- Dynamics of the Binary Euclidean Algorithm: Functional
Analysis and Operators, by Brigitte
Vallée.
Abstract.
Summary [ps |
pdf |
html].
- Skip lists directionnelles et recherche de voisins sur
hyper-cube. Applications au ``drug design'',
by Frédéric Cazals.
Abstract.
Summary [ps |
pdf |
html].
- Greedy algorithms for the shortest common superstring that are
asymptotically optimal, by Wojciech Szpankowski.
Abstract.
Summary not available.
- Two not-that-dull functional equations arising in the
analysis of algorithms, by Wojciech Szpankowski.
Abstract.
Summary [ps |
pdf |
html].
Slides [ps |
pdf |
html].
Probabilistic Methods
Return to the seminar page.
Return to the other years.