ACI Arbres, chemins: probabilités et algorithmes

ACI NIM

Arbres, chemins: probabilités et algorithmes

Publications
Présentation détaillée
Membres de l'ACI

Rencontres
Rapport final
Accueil

Publications

Akhavi, Marckert et Rouault. On the Lovasz reduction of a random basis.
Version courte conférence Analco 2007. Version longue à paraître à ESAIM P&S (2008). Ici.
Alonso, Chassaing, Gillet, Janson, Reingold et Schott. Sorting with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing, 13, 4-5 (2004) 419--449. Ici.
Alonso, Chassaing, Reingold et Schott. The worst-case chip problem.
Information Processing Letters, 89, 6 (2004) 303-308. Ici.
Auber, Delest, Domenger, Duchon et Fédou. New Strahler Numbers for Rooted Plane Trees.
Proceedings of the Third Colloquium on Mathematics and Computer Science, Vienna, Birkhauser (2004). Ici.
Baladi et Vallée. Distributional Analyses of Euclidean Algorithms.
Proceedings ALENEX/ANALCO 2004 (New Orleans), SIAM Press, pages 170--184. Ici.
Bardet, Faugère & Salvy. On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations.
Proceedings of the International Conference on Polynomial System Solving (2004) 71--74. Ici.
Bardet, Faugère, Salvy et Yang. Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems.
In MEGA'05, 2005. Eighth International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia (Italy). Ici.
Bernardi. On triangulations with high vertex degree.
Soumis à FPSAC 2005. A paraître dans Annals of Combinatorics. Ici.
Bernardi. Bijective counting of Kreweras walks and loopless triangulations.
Journal of Combinatorial Theory - Series A, Vol 114(5) p. 931-956 (2007). Ici.
Bernardi. Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Electronic Journal of Combinatorics, Vol 14, R9 (2007). Ici.
Bernardi. A characterization of the Tutte polynomial via combinatorial embeddings.
A paraître dans Annals of Combinatorics, Special volume on the Tutte polynomial. Ici.
Bernardi et Bonichon. Catalan intervals and realizers of triangulations.
Résumé étendu, Actes de la conférence FPSAC 2007. Ici.
Bertoin et Rouault. Discretization methods for homogeneous fragmentations.
Journal of the London Math. Society, Vol 72, n 1, (2005). Ici.
Bostan, Flajolet, Salvy et Schost. Fast Computation of Special Resultants.
Journal of Symbolic Computation, Volume 41, Issue 1, Pages 1--29 (January 2006). Ici.
Bousquet-Mélou. Walks in the quarter plane: Kreweras' algebraic model.
Annals of Applied Probability, 15 No. 2 (2005) 1451-1491. Ici.
Bousquet-Mélou. Three osculating walkers.
Journal of Physics: Conference Series 42 (2006) 35--46. Ici.
Bousquet-Mélou. Rational and algebraic series in combinatorial enumeration.
Invited paper for the International Congress of Mathematicians 2006. Proceedings of the ICM. Session lectures, pp. 789--826. Ici.
Bousquet-Mélou. Limit laws for embedded trees. Applications to the integrated superBrownian excursion.
Random Structures and Algorithms 29 Number 4, (2006) 475--523. Ici.
Bousquet-Mélou et Janson. The density of the ISE and local limit laws for embedded trees.
Annals Applied Proba. 16 No. 3 (2006) 1597--1632. Ici.
Bousquet-Mélou et Jehanne. Polynomial equations with one catalytic variable, algebraic series and map enumeration.
J. Combin. Theory Ser. B 96 (2006) 623--672. Ici.
Bousquet-Mélou et Petkovsek. Walks confined in a quadrant are not always D-finite.
Theoret. Comput. Sci. 307 (2003) 257-276. Ici.
Bousquet-Mélou et Ponty. Culminating paths.
A paraître dans Discrete Math and Theoretical Computer Science. Ici.
Chassaing et Durhuus. Local limit of labelled trees and expected volume growth in a random quadrangulation.
The Annals of Probability, Vol. 34, No. 3 - May 2006. Ici.
Chassaing et Gerin. Efficient estimation of the cardinality of large data sets.
DMTCS Proceedings - 4th Colloquium on Mathematics and Computer Science, France (2006) Ici.
Chassaing et Gerin. Asynchronous Cellular Automata and Brownian Motion.
DMTCS-Proceedings of AofA'07 - 2007 Conference on Analysis of Algorithms (AofA'07), Antibes : France (2007) Ici.
Chassaing et Janson. The center of mass of the ISE and the Wiener index of trees.
Electronic Communications in Probability, 9 (2004). Ici.
Chassaing et Schaeffer. Random Planar Lattices and Integrated SuperBrownian Excursion.
Probability Theory and Related Fields, 128, 2 (2004) 161-212. Ici.
Chauvin et Drmota. The Random Multisection Problem, Travelling Waves, and the Distribution of the Height of m-Ary Search Trees.
Algorithmica, Volume 46, Numbers 3-4, 299-327, (2006). Ici.
Chauvin, Gardy, Gittenberger, et Flajolet. And/Or trees revisited.
Combinatorics, Probability & Computing, Vol 13, 4-5, 475-497, 2004. Ici.
Chauvin, Klein, Marckert et Rouault. Martingales and Profile of Binary Search Trees.
Electronic Journal of Probability, 2005. Ici.
Chauvin et Pouyanne. m-ary search trees when m>26 : a strong asymptotics for the space requirements.
Random Structures and Algorithms, 24 (2004) 133--154. Ici.
Chauvin et Rouault. Connecting Yule process, Bisection and Binary Search Tree via Martingales
JIRSS, Vol 3, 2, (2004) 88-116. Ici.
Chyzak, Mishna et Salvy. Effective scalar products of D-finite symmetric functions.
Journal of Combinatorial Theory, Series A, 112(1), pages 1--43, October 2005. Ici.
Conrad et Flajolet. The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion.
Séminaire Lotharingien de Combinatoire (SLC) volume 54 (2006), 44 pages. Ici.
Daireaux, Maume-Deschamps et Vallée. The Lyapunov Tortoise and the Dyadic Hare.
Discrete Mathematics and Theoretical Computer Science Proceedings (DMTCS), vol AD (2005), pages 71--94. Ici.
Drmota et Marckert. Reinforced weak convergence of stochastic processes.
Statistics and Probability Letters, 71, 3 (2005) 283--294. Ici.
Drmota, Flajolet, Gardy et Gittenberger (editeurs). Mathematics and Computer Science : Algorithms, trees, combinatorics and probability.
Birkhauser 2004, Actes du troisieme colloque Mathematics and Computer Science, 13-17 sept 2004, Wien, Autriche. Ici.
Drmota, Gardy et Gittenberger. General urn models with several types of balls and Gaussian limiting fields.
Random Structures and Applications, 24, 1, (2004). Ici.
Duchon, Flajolet, Louchard et Schaeffer. Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Combinatorics, Probability and Computing 13, 4-5 (2004) 577-625. Outstanding Simulation Publication Award 2007 (an award of the Simulation Society). Ici.
Duchon, Hanusse, Saheb et Zemmari Broadcast in the Rendezvous Model.
Proceedings of STACS 2004, Lecture Notes in Computer Science 2996 (2004). Ici.
Duchon, Hanusse et Tixeuil. Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings.
Proceedings of DISC 2004, Lecture Notes in Computer Science 3274 (2004). Ici.
Durand & Flajolet. Loglog Counting of Large Cardinalities.
Proceedings of the 11th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol 2832, pp.605-617. Ici.
Fayolle. An Average-case Analysis of Basic Parameters of the Suffix Tree.
Proceedings of the Third Colloquium on Mathematics and Computer Science, pages 217--228. Vienna, Birkhauser (2004). Ici.
Fayolle et Ward. Analysis of the average depth in a suffix tree under a Markov model.
Discrete Mathematics and Theoretical Computer Science Proceedings (DMTCS), vol AD (2005), pages 95--104. Ici.
Fekete. Arms and feet nodes level polynomial in binary search trees.
Proceedings of the Third Colloquium on Mathematics and Computer Science, Vienna, Birkhauser (2004). Ici.
Fill, Flajolet & Kapur. Singularity Analysis, Hadamard Products, and Tree Recurrences.
Journal of Computational and Applied Mathematics 174 (2005), 271--313. Ici.
Flajolet. Counting by coin tossings.
Proceedings of the Ninth Asian Computing Science Conference, December 2004. Lecture Notes in Computer Science, vol 3321 (2004), 1--12. Ici.
Flajolet. The Ubiquitous Digital Tree.
In STACS 2006, Volume 3884 of Lecture Notes in Computer Science, B. Durand and W. Thomas Ed., pp. 1-22. Ici.
Flajolet, Dumas et Puyhaubert. Some exactly solvable models of urn process theory.
Discrete Mathematics and Computer Science, vol. AG, pp. 59--118 (2006). Proceedings of Fourth Colloquium on Mathematics and Computer Science, Ph. Chassaing Editor. Ici.
Flajolet, Gabarró et Pekari. Analytic Urns.
The Annals of Probability, Volume 33(3), April 2005, pages 1200-1233. Ici.
Flajolet, Gerhold et Salvy. On the non-holonomic character of logarithms, powers, and the nth prime function.
Electronic Journal of Combinatorics, Volume 11(2), 2004-2005, pages A2:1--16. Ici.
Flajolet, Salvy & Schaeffer. Airy phenomena and analytic combinatorics of connected graphs.
The Electronic Journal of Combinatorics, vol. 11, n°1, May 2004, page R34. Ici.
Flajolet, Szpankowski et Vallée. Hidden Word Statistics.
Journal of the ACM, Volume 53:1, January 2006, pages 147--183. Ici.
Fusy. Quadratic exact-size and linear approximate-size random generation of planar graphs.
Discrete Mathematics and Theoretical Computer Science Proceedings (DMTCS), vol AD (2005), pages 125--138. Ici.
Fusy. Transversal Structures on Triangulations, with Application to Straight-Line Drawing.
In Graph Drawing 2005, Lecture Notes in Computer Science 3843, 2006, pages 177--188. Ici.
Fusy. Straight-Line Drawing of Quadrangulations.
In Graph Drawing 2006, Lecture Notes in Computer Science 4372, pages 234--239 Ici.
Fusy, Poulalhon et Schaeffer. Dissections and trees, with applications to optimal mesh encoding and to random sampling.
In Proceedings of ACM-SIAM SODA Conference, 2005, pages 690-699. Ici.
Gardy et Woods. And/Or tree probabilities of Boolean functions.
First Colloquium on the Analysis of Algorithms, Barcelona, June 2005. DMTCS Proceedings Volume AD, 139-146 (2005) Ici.
Giroire. Order statistics and estimating cardinalities of massive data sets.
Discrete Mathematics and Theoretical Computer Science Proceedings (DMTCS), vol AD (2005), pages 157--166. Ici.
Labarbe et Marckert. Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks.
Electronic Journal of Probability (2007), p. 229-261. Ici.
Lavault, Marckert et Ravelomanana Quasi-Optimal Energy-Efficient Leader Election.
Algorithms in Radio Networks, Information and Computation, Vol. 205, Issue 5, (2007), p. 679-693 Ici.
Le Borgne. Counting upper interactions in Dyck paths.
Version courte, actes de la conférence FPSAC 05. Version longue : Séminaire Lotharingien de Combinatoire, volume 54 (2006/07) 17 pages. Ici.
Le Borgne. An algorithm to describe bijections involving Dyck paths.
Version courte, actes de la conférence FPSAC 06. Ici.
Le Borgne et Marckert. Directed Animals and Gas Models Revisited.
The Electronic Journal of Combinatorics, R71, (2007). Ici.
Marchand et Zohoorian-Azad. Limit Law of the Length of the Standard Right Factor of a Lyndon Word.
Combin. Probab. Comput. 16 (2007), no. 3, 417-434. Ici.
Marckert. The rotation correspondence is asymptotically a dilatation.
Random Structures and Algorithms 24, 2, (2004) 118--132. Ici.
Marckert. One more approach to the convergence of the empirical process to the Brownian bridge.
Electronic Journal of Statistics. Vol.2. (2008) p.118-126. Ici.
Marckert. The lineage process in Galton-Watson trees and globally centered discrete snakes.
Annals of Applied Probability, Vol. 18, No. 1, 209-244, (2007) Ici.
Marckert et Janson. Convergence of Discrete Snakes.
Journal of Theoretical Probability, 18, No. 3 , 615-645 (2005) Ici.
Marckert et Miermont. Invariance principles for random bipartite planar maps.
The Annals of Probability, (2007), Vol. 35, No.5, p. 1642-1705 Ici.
Marckert et Mokkadem. Ladder variables, Internal structure of Galton-Watson trees and Finite branching random walks.
Journal of Applied Probability 40, 3 (2003). Ici.
Marckert et Mokkadem. States spaces of the snake and of its tour -- Convergence of the discrete snake.
Journal of Theoretical Probability, 16, 4, (2003) 1015--1046. Ici.
Marckert et Mokkadem. Limit of Normalized Quadrangulations: the Brownian map.
The Annals of Probability, Vol. 34, No.6, p. 2144-2202, (2006) Ici.
Mohamed et Robert. A probabilistic analysis of some tree algorithms.
Annals of Applied Probability, 15(4): pages 2445--2471, November 2005. Ici.
Pouyanne. Classification of large Pólya-Eggenberger urns with regard to their asymptotics.
First Colloquium on the Analysis of Algorithms, Barcelona, June 2005. DMTCS Proceedings Volume AD,275-286 (2005) Ici.
Pouyanne. An algebraic approach to Pólya processes,
Annales de l'Institut Henri Poincaré, 2008, Vol. 44, No. 2, 293-323. Ici.
Puyhaubert. Generating functions and the satisfiability threshold.
Discrete Mathematics Theoretical Computer Science 6(2): pages 425--436 (2004). Ici.
Robert. On the asymptotic behavior of some algorithms.
Random Structures and Algorithms, 27(2): pages 235--250, September 2005. Ici.
Rouault. Large deviations for cascades and cascades of large deviations.
Proceedings of the Third Colloquium on Mathematics and Computer Science, Vienna, Birkhauser (2004). Ici.