From mathinfo@prism.uvsq.fr Fri Jun 30 16:50:26 2000 Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by nuits.inria.fr (8.8.8/8.7.3) with ESMTP id QAA31167 for ; Fri, 30 Jun 2000 16:50:26 +0200 (MET DST) Received: from soleil.uvsq.fr (soleil.uvsq.fr [193.51.24.1]) by concorde.inria.fr (8.10.0/8.10.0) with ESMTP id e5UEoM524643; Fri, 30 Jun 2000 16:50:22 +0200 (MET DST) Received: from lucifer.prism.uvsq.fr (lucifer.prism.uvsq.fr [193.51.25.7]) by soleil.uvsq.fr (8.9.3/jtpda-5.3.3) with ESMTP id QAA75167 ; Fri, 30 Jun 2000 16:50:22 +0200 (CEST) Received: from fraisier.prism.uvsq.fr (fraisier.prism.uvsq.fr [193.51.25.60]) by lucifer.prism.uvsq.fr (8.9.3/jtpda-5.3.2) with ESMTP id QAA18738 for ; Fri, 30 Jun 2000 16:48:20 +0200 (MET DST) From: mathinfo@prism.uvsq.fr (Colloque MATH-INFO2000) Received: from (mathinfo@localhost) by fraisier.prism.uvsq.fr (8.8.7/jtpda-5.2) id QAA11946 for mathinfo.tous@prism.uvsq.fr; Fri, 30 Jun 2000 16:34:44 +0200 (MET DST) Date: Fri, 30 Jun 2000 16:34:44 +0200 (MET DST) Message-Id: <200006301434.QAA11946@fraisier.prism.uvsq.fr> To: mathinfo.tous@prism.uvsq.fr MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Status: R CALL FOR PARTICIPATION Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities University of Versailles-St Quentin (FRANCE) September 18-20, 2000. The colloquium is organized jointly by the Mathematics and Computer Science laboratories (LAMA and PRISM) of the University of Versailles St-Quentin. The aim of the colloquium is to bring together researchers on subjects at the intersection of fundamental Computer Science and Mathematics. The topics covered are : trees and analysis of algorithms, enumerative combinatorics and random generation, algorithms and optimization, performance evaluation, probabilities and statistics. The proceedings will be published by Birkhauser in the collection "Trends in Mathematics" *************************************************************** * * * The registration form can be downloaded from the Web site * * of the Colloquium at * * http://www.prism.uvsq.fr/complex/confs/mathinfo2000/ * * * *************************************************************** Scientific committee : ---------------------- D. Aldous (UCB Berkeley), F. Baccelli (ENS), P. Cartier (IHES), B. Chauvin (UVSQ), P. Flajolet (INRIA), J.M. Fourneau (UVSQ), D. Gardy (UVSQ), D. Gouyou-Beauchamps (U. Paris-Sud), R. Kenyon (U. Paris-Sud), J.F. Le Gall (ENS Ulm), C. Lemaréchal (INRIA), R. Lyons (Indiana U.), A. Mokkadem (UVSQ), A. Rouault (UVSQ), C. Roucairol (UVSQ). LIST OF TALKS ============= M. BENMAMOUN, N. PEKERGIN Computing closed-form stochastic bounds on the stationary distribution of Markov chains J. BERARD, A. BIENVENUE Convergence of a genetic algorithm with finite population M. BOUSQUET, C. CHAUVE, G. LABELLE, P. LEROUX A bijective proof of the arborescent form of the multivariate Lagrange's inversion formula M. BOUSQUET-MELOU, G. SCHAEFFER Counting paths on the slit plane P. CHASSAING, J.F. MARCKERT, M. YOR The height and width of simple trees T. DAYAR Effects of reordering and lumping in the analysis of discrete-time SANs A. DE LA FORTELLE, F. DELCOIGNE Large deviations for polling systems M. DEKKING, S. de GRAAF, L.E. MESTER On the node structure of binary search trees A. DENISE, O. ROCQUES, M. TERMIER Random generation of words of context-free languages according to the frequencies of letters B. DERRIDA , S.C. MANRUBIA, D.H. ZANETTE Distribution of repetitions of ancestors in genealogical trees L. DEVROYE Rawa trees M. DRMOTA The saturation level in binary search tree M. DROR, D. FORTIN, C. ROUCAIROL Complexity issues for a redistribution problem G. FAYOLLE, J.M. LASGOUTTES A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network J. FILL, S. JANSON Smoothness and decay properties of the limiting quicksort density function P. FLAJOLET Analytic Combinatorics of Parking and Hashing J. GEIGER A new proof of Yaglom's exponential limit law B. GITTENBERGER The number of descendants in simply generated random trees P. JACQUET, W. SZPANKOWSKI, I. APOSTOL An universal predictor based on pattern matching, preliminary results Q. LIU The branching measure, Hausdorff and packing measures on the Galton-Watson tree E. LOCHERBACH Likelihood ratio processes and asymptotic statistics for systems of interacting diffusions with branching and immigration G. LOUCHARD Probabilistic analysis of a Schroder walk generation algorithm V. MALYSHEV Gibbs families C. MAZZA, D. PIAU On the rate of escape of a mutation-selection algorithm D. MERLINI, R. SPRUGNOLI, M. C. VERRI An algebra for generating trees Y. METIVIER, N. SAHEB, A. ZEMMARI Randomized rendezvous R. PEMANTLE Generating functions with high-order poles are nearly polynomial Y. PERES Information flow on trees E. PERGOLA, R. PINZANI, S. RINALDI A set of well-defined operations on succession rules J. SPENCER Ultrahigh moments for a Brownian excursion B. YCART, M.C. ROUSSET A zero-one law for random sentences in description logics X. VIENNOT (to be announced)