Philippe Chassaing: page d'accueil

Institut Élie Cartan Université Henri Poincaré BP 239, 54506 VANDOEUVRE-LES-NANCY CEDEX - France

Mel: chassain@iecn.u-nancy.fr Tel: +33 3 83 68 45 59 Fax: +33 3 83 68 45 04

Reverse chronological order

• Efficient estimation of the cardinality of large data sets (with L. GERIN)
  math.ST/0701347, Jan 2007.
  Extended abstract in the proceedings of the 4th Colloquium on Mathematics and Computer Science, (2006) 419-422.

• Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms (with R. MARCHAND)
  math.PR/0406094, Jun 2004.
  28 pages pdf 340Ko

• Local limit of labelled trees and expected volume growth in a random quadrangulation (with B. DURHUUS)
  (previous title: Statistical Hausdorff dimension of labelled trees and quadrangulations) math.PR/0311532, Nov 2003.
  In The Annals of Probability, Vol. 34, No. 3 - May 2006. 38 pages pdf 785Ko

• The worst-case chip problem (with L. ALONSO, E.M. REINGOLD & R. SCHOTT)
  In Information Processing Letters 89 (2004), n°6, 303-308.
  pdf 318Ko

• The center of mass of the ISE and the Wiener index of trees (with S. JANSON)
  math.PR/0309284, Sep 2003. Electron. Comm. Probab. , 9 (2004).
  11 pages pdf 178Ko

• Sorting with Unreliable Comparisons: A Probabilistic Analysis (with L. ALONSO, F. GILLET, S. JANSON, E. REINGOLD & R. SCHOTT)
  math.PR/0312437, Jan 2003. Combin. Probab. Comput., 13 (2004), n°4-5, 419-449.
  28 pages pdf 352Ko

• Random Planar Lattices and Integrated SuperBrownian Excursion (with G. SCHAEFFER)
  full text, in Probability Theory and Related Fields, 128, Feb 2004, n°2, pp. 161-212.
  45 pages pdf 920Ko
  abridged, in Proceedings of Mathematics and Computer Science 2002.
  19 pages pdf 440Ko

• Reflected Brownian Bridge area conditioned on its local time at the origin (with G. LOUCHARD)
  In Journal of Algorithms, 44, July 2002 n°1, pp. 29-51.
  15 pages pdf 292Ko
  15 pages postscript 276Ko

• Hachage, arbres, chemins et graphes (with Ph. FLAJOLET)
  In Gazette des Mathématiciens - n°95, janvier 2003.
  17 pages pdf 828Ko

• Optimal sequencing of contract algorithms (with S. ZILBERSTEIN and F. CHARPILLET)
  In Foundations of artificial intelligence VI, Ann. Math. Artif. Intell. 39 (2003), n°1-2, 1-18.
  21 pages pdf 228Ko

• The height and width of simple trees (with J.F. MARCKERT and M. YOR)
  In Proceedings of Mathematics and Computer Science 2000.
  13 pages pdf 244Ko

• A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 (with S. JANSON)
  In Annals of Probability, Oct 2001.
  24 pages pdf 504Ko

• Phase transition for parking blocks , Brownian excursion and coalescence (with G. LOUCHARD).
  In Random Structures Algorithms 21 (2002), n°1, 76-119.
  42 pages pdf 1000Ko
  Preprint 99/34, Institut Elie Cartan
  34 pages ps.gz 189Ko

• Parking functions, empirical processes and the width of rooted labeled trees, (with J.F. MARCKERT)
  In    The Electronic Journal of Combinatorics 8 (2001), R14.
  18 pages pdf 492Ko

• Real-time problem solving with contract algorithms (with S. ZILBERSTEIN and F. CHARPILLET)
  In Proceedings of the 16th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, (1999).
  ps.gz 70Ko

• A Stochastically Quasi-Optimal Algorithm (with J.F. MARCKERT & M. YOR)
  In The Annals of Applied Probability 13, n°4, November 2003.
  30 pages ps.gz 159Ko

• The chip problem (with L. ALONSO, E.M. REINGOLD & R. SCHOTT)
  In Prépublication de l'Institut Elie Cartan 1998-10-07.
  ps.gz 138Ko

• How many probes are needed to compute the maximum of a random walk ?
  In Stochastic Process. Appl. 81 (1999), n°1.
  ps.gz 105Ko

• Processus associés à l'équation des milieux poreux (with S. BENACHOUR, B. ROYNETTE & P. VALLOIS)
  In Ann. Scuola Norm. Sup. Pisa Cl. Sci. 23 (4), 1997.

• The average complexity of a coin-weighing problem (with L. ALONSO & R. SCHOTT)
  In Random Structures Algorithms 9 (1&2), 1996.
  17 pages ps.gz 712Ko

• Determining the majority: the biased case,
  In Annals of Applied Probability Vol. 7, No. 2, 1997.
  23 pages ps.gz 624Ko

• Slow diffusion for a Brownian motion with random reflecting barriers,
  In Stochastic Process. Appl. 61 (1), 1996.
  ps.gz 45Ko

• Optimality of move-to-front for self-organizing data structures with locality of references,
  In Annals of Applied Probability 3 (4), 1993.
  ps.gz 94Ko

• On a Stochastic Maintenance Problem with Multiple Constraints (with I. ILINA, M.C. PORTMANN & R. SCHOTT)
  (ps.gz  37Ko)

• Homogeneization or slow diffusion for random walks with random reflecting barriers, (with S. ALILI)
  Preprint 93/27, Institut Elie Cartan.
  (ps.gz  61Ko)

• A Kolmogorov criterion and an invariance principle in Besov spaces(with B. BOUFOUSSI  & B. ROYNETTE)
  Preprint 93/24, Institut Elie Cartan.
   (ps.gz  53Ko)

• State-transitive Markov processes and random walks on groups,
  (english  extended version of the next paper)
  (ps.gz  52Ko)

• Processus de Markov transitifs et marches aleatoires sur les groupes,
  In C.R.A.S. Ser. I Math. 312 (3), 1991.

• An optimal random number generator on Zp,
  In Statist.-Probab.-Lett. 7 (4), 1989.
  (ps.gz 21Ko)

• Convergence d'un produit semi-markovien de matrices et simplicité du spectre de la limite
  [Convergence of a semi-markovian product of matrices], unpublished.

• Brocot sequences and random walks in SL(2,R), (with G. Letac & M. Mora)
  in Probability measures on groups, VII (Oberwolfach, 1983), 36-48, Lecture Notes in Math., 1064, Springer, Berlin-New York, 1984.

• Une librairie sans cycles est-elle toujours transiente ?
  Actes des Journées "Probabilités sur les structures géométriques", 1984, Publications du Laboratoire de Statistique et Probabilités, Université Paul Sabatier, Toulouse, 13-24.