Complexité des problèmes de decision relatifs aux algorithmes de tri.
In Automata, Languages and Programming, pages 537-548. North Holland Publishing Company, 1972.
Proceedings of 1st ICALP Colloquium, Rocquencourt, France, July 1972.
Decision problems for multihead finite automata.
In J. Gruska, B. Rovan, and J. Wiedermann, editors, Mathematical Foundations of Computer Science, pages 225-230, 1973.
Proceedings of the 1st MFCS Symposium, High Tatras, Checoslovakia, August 1973.
Une formalisation de la notion d'algorithme de tri non-récurrent.
Thèse de 3e cycle, Université de Paris VII, 1973.
289 pages. Presented jointly with J-M. Steyaert.
A class of non recursive sorting algorithms.
In E. Bianco, editor, Journées Mathématiques de la Compilation, pages 42-49. Université de Marseille, 1973.
Generalized immune sets.
Technical Report 40, Institut de Recherche en Informatique et en Automatique, November 1973.
22 pages.
On sets having only hard subsets.
In Jacques Loeckx, editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 446-456. Springer Verlag, 1974.
Proceedings of 2nd ICALP Colloquium, Saarbrücken,, Germany, July 1974.
Une généralisation de la notion d'ensemble immune.
RAIRO Theoretical Informatics and Applications, 1:37-48, 1974.
Complexity classes of languages and operators.
Technical Report 92, Institut de Recherche en Informatique et en Automatique, 1974.
13 pages.
Informatique et Philologie, Rocquencourt, France, 1975. Institut de Recherche en Informatique et en Automatique.
233 pages. Proceedings of a colloquium organized at IRIA, Rocquencourt, France, November 1974.
Linguistique formelle et linguistique historique.
In P. Flajolet, editor, Informatique et Philologie, pages 195-207. Institut de Recherche en Informatique et en Automatique, 1975.
Proceedings of a colloquium organized by IRIA, Rocquencourt, France, November 1974.
Classes de complexité et réduction entre problèmes.
In Codici, Complessità di Calcolo e Linguaggi Formali. Liguori Pub., 1975.
Hierarchies de complexité et réduction entre problèmes.
Asterisque, 38-39:53-72, 1976.
On the average number of registers required to evaluate arithmetic expressions.
In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 196-205. IEEE Computer Society Press, 1977.
Analyse d'algorithmes de manipulation de fichiers.
Technical Report 321, Institut de Recherche en Informatique et en Automatique, 1978.
On the analysis of tree-matching.
In Proc. C.A.A.P Colloquium, Lille, 1978.
Analyse d'algorithmes de manipulation d'arbres et de fichiers.
Doctorat ès sciences, Université de Paris XI, Orsay, 1979.
Deux problèmes d'analyse d'algorithmes.
In Séminaire de Théorie des Nombres Delange-Pisot-Poitou, volume 20, pages 1401-1410, 1979.
Towards analysing sequences of operations for dynamic data structures.
In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 183-195. IEEE Computer Society Press, 1979.
Computing integrated costs of data structures with applications to dictionaries.
In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pages 49-61. Association for Computing Machinery, 1979.
The number of registers required to evaluate arithmetic expressions.
Theoretical Computer Science, 9:99-125, 1979.
Dynamic data structures: Finite files, limiting profiles and variance analysis.
In Eighteenth Annual Conference on Communication, Control, and Computing, pages 223-232. The University of Illinois at Urbana-Champaign, 1980.
Combinatorial aspects of continued fractions.
Annals of Discrete Mathematics, 8:217-222, 1980.
Extended abstract. Proceedings of ``Colloque Franco-Canadien de Combinatoire'', Montreal, 1979.
Combinatorial aspects of continued fractions.
Discrete Mathematics, 32:125-161, 1980.
Reprinted in the 35th Special Anniversary Issue of Discrete Mathematics, Volume 306, Issue 10-11, Pages 992-1021 (2006).
Structures de données dynamiques en reservoir borné.
In J. Morgenstern, editor, III Journées Algorithmiques. Université de Nice, 1980.
14 pages. (Proceedings of a meeting, June 1980).
Sequence of operations analysis for dynamic data structures.
Journal of Algorithms, 1:111-141, 1980.
Exploring binary trees and other simple trees.
In Proceedings of the 21st Annual Symposium on Foundations of Computer Science, pages 207-216. IEEE Computer Society Press, 1980.
A note on Gray code and odd-even merge.
SIAM Journal on Computing, 9(1):142-158, February 1980.
On the analysis of tree matching algorithms.
In J. W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science, pages 208-219. Springer Verlag, 1980.
Proceedings of 5th ICALP Colloquium, Noordwijkerhout, The Netherlands, July 1980.
Analyse d'algorithmes de manipulation d'arbres et de fichiers, volume 34-35 of Cahiers du Bureau Universitaire de Recherche Opérationnelle.
Université Pierre et Marie Curie, Paris, 1981.
209 pages.
Analyse de structures de données dynamiques et histoires de fichiers.
Questiió, 5:31-48, 1981.
A complexity calculus for classes of recursive search programs over tree structures.
In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, pages 386-393. IEEE Computer Society Press, 1981.
On congruences and continued fractions for some classical combinatorial quantities.
Discrete Mathematics, 41:145-153, 1982.
The average height of binary trees and other simple trees.
Journal of Computer and System Sciences, 25:171-213, 1982.
A recursive partitioning process of computer science.
In Second World Conference on Mathematics at the Service of Man, pages 25-30, Las Palmas, Canary Islands, Spain, June 1982. Universidad Politecnica de Las Palmas.
Conference Proceedings. [Invited lecture].
Elements d'un calcul de complexité de programmes récursifs d'arbres.
In Les Mathématiques de l'Informatique--Mathematics for Computer Science, pages 81-92. AFCET, Paris, 1982.
[Invited lecture]. Symposium Proceedings, Paris, March 1982.
A branching process arising in dynamic hashing, trie searching and polynomial factorization.
In M. Nielsen and E. M. Schmidt, editors, Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 239-251. Springer Verlag, 1982.
Proceedings of 9th ICALP Colloquium, Aarhus, Denmark, July 1982.
On the performance evaluation of extendible hashing and trie searching.
Acta Informatica, 20:345-369, 1983.
On approximate counting.
In F. Baccelli and G. Fayolle, editors, International Seminar on Modelling and Performance Evaluation Methodology, pages 205-236. INRIA, Rocquencourt, France, January 1983.
Methods in the analysis of algorithms: evaluations of a recursive partitioning process.
In Marek Karpinski, editor, Fundations of Computation Theory, volume 158 of Lecture Notes in Computer Science, pages 141-158. Springer Verlag, 1983.
Proceedings of FCT'83, Borgholm, Sweden, August 1983 (Invited lecture).
Probabilistic counting.
In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 76-82. IEEE Computer Society Press, 1983.
Tree structures for partial match retrieval.
In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 282-288. IEEE Computer Society Press, 1983.
Digital search trees and the complexity of generating an exponentially distributed variate.
In G. Ausiello and M. Protasi, editors, CAAP'83, volume 159 of Lecture Notes in Computer Science, pages 220-235. Springer Verlag, 1983.
Proceedings of the 8th Colloquium on Trees in Algebra and Programming, L'Aquila, March 1983.
Patterns and pattern-matching in trees: an analysis.
Information and Control, 58(1-3):19-58, July 1983.
Algorithmique.
In Encyclopedia Universalis, volume 1, pages 758-763. Editions de l'E. U., 1984.
Reprinted in Dictionnaire des mathématiques,--fondements, probabilités, applications, Albin Michel, Paris, 1998.
Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations.
Mathematical Proceedings of the Cambridge Philosophical Society, 96:237-253, 1984.
Ambiguity and transcendence.
In Wilfried Brauer, editor, Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pages 179-188. Springer Verlag, 1985.
Proceedings of 12th ICALP Colloquium, Nafplion, Greece, July 1985.
Elements of a general theory of combinatorial structures.
In Lothar Budach, editor, Fundamentals of Computation Theory, volume 199 of Lecture Notes in Computer Science, pages 112-127. Springer Verlag, 1985.
Proceedings of FCT'85, Cottbus, GDR, September 1985 (Invited Lecture).
Approximate counting: A detailed analysis.
BIT, 25:113-134, 1985.
Analysis of a stack algorithm for random access communication.
IEEE Transactions on Information Theory, IT-31(2):244-254, March 1985.
(Special Issue on Random Access Communication, J. Massey editor).
Probabilistic counting algorithms for data base applications.
Journal of Computer and System Sciences, 31(2):182-209, October 1985.
Search trees and bubble memories.
RAIRO Theoretical Informatics and Applications, 19(2):137-164, 1985.
Some uses of the Mellin integral transform in the analysis of algorithms.
In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO Advance Science Institute Series. Series F: Computer and Systems Sciences, pages 241-254. Springer Verlag, 1985.
(Invited Lecture).
Algebraic methods for trie statistics.
Annals of Discrete Mathematics, 25:145-188, 1985.
In Analysis and Design of Algorithms for Combinatorial Problems, G. Ausiello and M. Lucertini Editors.
Q-ary collision resolution algorithms in random access systems with free or blocked channel access.
IEEE Transactions on Information Theory, IT-31(2):217-243, March 1985.
On a functional equation arising in the analysis of a protocol for a multiaccess broadcast channel.
Advances in Applied Probability, 18:441-472, 1986.
The evolution of two stacks in bounded space and random walks in a triangle.
In J. Gruska, B. Rovan, and J. Wiedermann, editors, Mathematical Foundations of Computer Science, volume 233 of Lecture Notes in Computer Science, pages 325-340. Springer Verlag, 1986.
Proceedings of the 12th MFCS Symposium, Bratislava, August 1986.
Register allocation for unary-binary trees.
SIAM Journal on Computing, 15(3):629-640, August 1986.
Partial match retrieval of multidimensional data.
Journal of the ACM, 33(2):371-407, 1986.
The analysis of simple list structures.
Information Sciences, 38:121-146, 1986.
The complexity of generating an exponentially distributed variate.
Journal of Algorithms, 7:463-488, 1986.
Digital search trees revisited.
SIAM Journal on Computing, 15(3):748-767, August 1986.
Prefixes of infinite words and ambiguous context-free languages.
Information Processing Letters, 25:211-216, 1987.
Mathematical tools for automatic program analysis.
Research Report 603, INRIA, 1987.
Analytic models and ambiguity of context-free languages.
Theoretical Computer Science, 49:283-309, 1987.
Analytic models for tree communication protocols.
In A. R. Odoni, L. Bianco, and G. Szegö, editors, Flow Control of Congested Networks, volume 38 of NATO Advance Science Institute Series. Series F: Computer and Systems Sciences, pages 223-234. Springer Verlag, 1987.
(Invited Lecture).
Level number sequences for trees.
Discrete Mathematics, 65:149-156, 1987.
A complexity calculus for recursive tree algorithms.
Mathematical Systems Theory, 19:301-331, 1987.
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.
Journal of the ACM, 34(2):289-325, April 1987.
Mathematical methods in the analysis of algorithms and data structures.
In Egon Börger, editor, Trends in Theoretical Computer Science, chapter 6, pages 225-304. Computer Science Press, Rockville, Maryland, 1988.
(Lecture Notes for A Graduate Course in Computation Theory, Udine, 1984).
L'analyse d'algorithmes ou le risque calculé.
In Journées Scientifiques et Prix U.A.P. 1985,1986,1987, pages 17-34. Conseil Scientifique de l'UAP, 1988.
(Text of Prize Award Lecture, 1986).
Evaluation de protocoles de communication: aspects mathématiques.
Technical Report 797, Institut National de Recherche en Informatique et en Automatique, 1988.
22 pages. Main lecture delivered at the Journée annuelle de la Société Mathématique de France, Paris, January 1988. Also published by S.M.F., pp. 1-22, 1988.
Random tree models in the analysis of algorithms.
In P.-J. Courtois and G. Latouche, editors, PERFORMANCE'87, pages 171-187. Elsevier Science Publishers (North Holland), 1988.
(Invited lecture).
Probabilistic languages and random allocations.
In Timo Lepistö and Arto Salomaa, editors, Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 239-253. Springer Verlag, 1988.
Proceedings of 15th ICALP Colloquium, Tempere, Finland, July 1988.
Deviations from uniformity in random strings.
Probability Theory and Related Fields, 80:139-150, 1988.
Analysis of
-trees: 
-trees improved by local
reorganisations.
In F. Dehne, J-R. Sack, and N. Santoro, editors, Algorithms and Data Structures, volume 382 of Lecture Notes in Computer Science, pages 24-38, 1989.
Discrepancy of sequences in discrete spaces.
In G. Halász and V. T. Sós, editors, Irregularities of Partitions, volume 8 of Algorithms and Combinatorics, pages 61-70. Springer Verlag, 1989.
Elliptic functions, continued fractions and doubled permutations.
European Journal of Combinatorics, 10:235-241, 1989.
The first cycles in an evolving graph.
Discrete Mathematics, 75:167-215, 1989.
Lambda-Upsilon-Omega: An assistant algorithms analyzer.
In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 357 of Lecture Notes in Computer Science, pages 201-212, 1989.
Proceedings AAECC'6, Rome, July 1988.
Lambda-Upsilon-Omega: The 1989 Cookbook.
Research Report 1073, Institut National de Recherche en Informatique et en Automatique, August 1989.
116 pages.
On the performance of orthogonal range queries in multiattribute and doubly chained trees.
In F. Dehne, J-R. Sack, and N. Santoro, editors, Algorithms and Data Structures, volume 382 of Lecture Notes in Computer Science, pages 218-229, 1989.
Average cost of orthogonal range queries in multiattribute trees.
Information Systems, 14(4):341-350, 1989.
Algebraically independent formal power series: a language theory interpretation.
In K. Nagasaka and E. Fouvry, editors, Analytic Number Theory, number 1434 in Lecture Notes in Mathematics, pages 11-18. Springer Verlag, 1990.
Proceedings, Tokyo 1988.
On adaptive sampling.
Computing, 34:391-400, 1990.
Random mapping statistics.
In J-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology, volume 434 of Lecture Notes in Computer Science, pages 329-354. Springer Verlag, 1990.
Proceedings of EUROCRYPT'89, Houtalen, Belgium, April 1989.
Singularity analysis of generating functions.
SIAM Journal on Algebraic and Discrete Methods, 3(2):216-240, 1990.
Non-overlapping partitions, continued fractions, Bessel functions and a divergent series.
European Journal of Combinatorics, 11:421-432, 1990.
Gaussian limiting distributions for the number of components in combinatorial structures.
Journal of Combinatorial Theory, Series A, 53:165-182, 1990.
Analytic variations on the common subexpression problem.
In M. S. Paterson, editor, Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Science, pages 220-234, 1990.
Proceedings of the 17th ICALP Conference, Warwick, July 1990.
Gauss' reduction algorithm: An average case analysis.
In Proceedings of the 31st Symposium on Foundations of Computer Science, pages 830-839. IEEE Computer Society Press, October 1990.
Analysis of algorithms and data structures.
In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 9, pages 431-524. North Holland, 1990.
Pólya festoons.
Research report, INRIA, July 1991.
7 pages.
The analysis of multidimensional searching in quad-trees.
In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 100-109, Philadelphia, 1991. SIAM Press.
Automatic average-case analysis of algorithms.
Theoretical Computer Science, 79(1):37-109, February 1991.
The cycle construction.
SIAM Journal on Discrete Mathematics, 4(1):58-60, February 1991.
Varieties of increasing trees.
In J.-C. Raoult, editor, CAAP'92, volume 581 of Lecture Notes in Computer Science, pages 24-48, 1992.
Proceedings of the 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 1992.
Analytic analysis of algorithms.
In W. Kuich, editor, Automata, Languages and Programming, number 623 in Lecture Notes in Computer Science, pages 186-210, 1992.
Proceedings of the 19th International Colloquium, Vienna, July 1992. (Invited lecture).
La calculabilité et ses limites.
In La Science au Présent, pages 216-218. Les Éditions de l'Encyclopedia Universalis, Paris, 1992.
Introduction à l'analyse d'algorithmes.
Singularité, 3(5):5-16, Mai 1992.
Birthday paradox, coupon collectors, caching algorithms, and self-organizing search.
Discrete Applied Mathematics, 39:207-229, 1992.
Generalized digital trees and their difference-differential equations.
Random Structures & Algorithms, 3(3):305-320, 1992.
Algorithms seminar, 1991-1992.
Research Report 1779, Institut National de Recherche en Informatique et en Automatique, 1992.
192 pages.
Page usage in a quadtree index.
BIT, 32:384-402, 1992.
The distribution of heights of binary trees and other simple trees.
Combinatorics, Probability and Computing, 2:145-156, 1993.
Exact asymptotics of divide-and-conquer recurrences.
In S. Carlsson A. Lingas, R. Karlsson, editor, Automata, Languages, and Programming, number 700 in Lecture Notes in Computer Science, pages 137-149, 1993.
Proceedings of the 20th ICALP Conference, Lund, July 1993.
Analytic variations on quadtrees.
Algorithmica, 10(7):473-500, December 1993.
Sur une famille de polynômes issus de l'analyse numérique.
Gazette des Mathématiciens, 55:67-78, January 1993.
Average Case Analysis of Algorithms, number 68 in Dagtuhl Seminar Reports. IBFI GmbH Schloß Dagstuhl, 1993.
Summary of talks presented at a seminar, Wadern, Germany, July 12-16, 1993.
A finite sum of products of binomial coefficients.
SIAM Review, 35(4):645-646, 1993.
Solution to Problem 92-18 by C. C. Grosjean.
The average case analysis of algorithms: Counting and generating functions.
Research Report 1888, Institut National de Recherche en Informatique et en Automatique, 1993.
116 pages.
The average case analysis of algorithms: Complex asymptotics and generating functions.
Research Report 2026, Institut National de Recherche en Informatique et en Automatique, 1993.
100 pages.
General combinatorial schemas: Gaussian limit distributions and exponential tails.
Discrete Mathematics, 114:159-180, 1993.
A calculus of random generation.
In Thomas Lengauer, editor, Algorithms--ESA'93, number 726 in Lecture Notes in Computer Science, pages 169-180, 1993.
Proceedings of the First European Symposium on Algorithms, Bad Honnef, September 1993.
An analysis of the Gaussian algorithm for lattice reduction.
In L. Adleman, editor, Algorithmic Number Theory Symposium, number 877 in Lecture Notes in Computer Science, pages 144-158, 1994.
Proceedings of ANTS'94.
Mellin transforms and asymptotics: The mergesort recurrence.
Acta Informatica, 31:673-696, 1994.
Mellin transforms and asymptotics: Digital sums.
Theoretical Computer Science, 123(2):291-314, 1994.
Search costs in quadtrees and singularity perturbation asymptotics.
Discrete and Computational Geometry, 12(4):151-175, 1994.
The average case analysis of algorithms: Saddle point asymptotics.
Research Report 2376, Institut National de Recherche en Informatique et en Automatique, 1994.
55 pages.
A calculus for the random generation of labelled combinatorial structures.
Theoretical Computer Science, 132(1-2):1-35, 1994.
Mellin transforms and asymptotics: Harmonic sums.
Theoretical Computer Science, 144(1-2):3-58, June 1995.
On Ramanujan's
-function.
Journal of Computational and Applied Mathematics, 58(1):103-116, March 1995.
Hypergeometrics and the cost structure of quadtrees.
Random Structures & Algorithms, 7(2):117-144, 1995.
Computer algebra libraries for combinatorial structures.
Journal of Symbolic Computation, 20:653-671, 1995.
Mellin transforms and asymptotics: finite differences and Rice's integrals.
Theoretical Computer Science, 144(1-2):101-124, June 1995.
Asymptotique des récurrences mahleriennes: le cas cyclotomique.
Journal de Théorie des Nombres de Bordeaux, 8(1):1-30, June 1996.
Analytic variations on quadtrees.
In Notes of the Seminar on Probabilistic Methods in Algorithmics, number 5 in Quaderns, Centre de Recerca Matemàtica, pages 44-53, Barcelona, 1996.
(Summary written by Nicola Galesi).
Random polynomials and polynomial factorization.
In F. Meyer auf der Heide and B. Monien, editors, Automata, Languages, and Programming, number 1099 in Lecture Notes in Computer Science, pages 232-243, 1996.
Proceedings of the 23rd ICALP Conference, Paderborn, July 1996.
Average Case Analysis of Algorithms, number 119 in Dagtuhl Seminar Reports. IBFI GmbH Schloß Dagstuhl, 1996.
Summary of talks presented at a seminar, Wadern, Germany, July 3-7, 1995.
The average case analysis of algorithms: Mellin transform asymptotics.
Research Report 2956, Institut National de Recherche en Informatique et en Automatique, 1996.
93 pages.
An Introduction to the Analysis of Algorithms.
Addison-Wesley Publishing Company, 1996.
Introduction à l'analyse des algorithmes.
International Thomson Publishing, France, 1996.
492 pages. A translation of the original English version (ISBN 2-84180-957-9).
An average-case analysis of the Gaussian algorithm for lattice reduction.
Combinatorics, Probability and Computing, 6(4):397-433, December 1997.
Review of Micha Hofri's book ``Analysis of Algorithms''.
SIAM Review, 39(2):341-345, June 1997.
Adaptive sampling.
In M. Hazewinkel, editor, Encyclopaedia of Mathematics, volume Supplement I, page 28. Kluwer Academic Publishers, Dordrecht, 1997.
Patterns in random binary search trees.
Random Structures & Algorithms, 11(3):223-244, October 1997.
The SIGSAM Challenges: Symbolic asymptotics in practice.
SIGSAM Bulletin, 31(4):36-47, December 1997.
The average case analysis of algorithms: Multivariate asymptotics and limit distributions.
Research Report 3162, Institut National de Recherche en Informatique et en Automatique, 1997.
123 pages.
Analysis of algorithms.
Random Structures & Algorithms, 10(1-2):1-3, January 1997.
Average-Case Analysis of Algorithms, volume 10(1-2) of Random Structures and Algorithms. John Wiley, 1997.
Special issue of the the journal, 302 pages.
The analysis of hybrid trie structures.
In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 531-539, Philadelphia, 1998. SIAM Press.
The maximum of a random walk and its application to rectangle packing.
Probability in Engineering and Informational Sciences, 12:373-386, 1998.
On the analysis of linear probing hashing.
Algorithmica, 22(4):490-515, December 1998.
Euler sums and contour integral representations.
Experimental Mathematics, 7(1):15-35, 1998.
Continued fraction algorithms, functional operators, and structure constants.
Theoretical Computer Science, 194(1-2):1-34, March 1998.
An analytic approach to smooth polynomials over finite fields.
In J. P. Buhler, editor, Algorithmic Number Theory Symposium (ANTS), volume 1423 of Lecture Notes in Computer Science, pages 226-236. Springer Verlag, 1998.
On generating functions of generating trees.
In C. Martínez, M. Noy, and O. Serra, editors, Formal Power Series and Algebraic Combinatorics, pages 40-52. Universitat Politècnica de Catalunya, June 1999.
(Proceedings of FPSAC'99, Barcelona. Also available as INRIA Res. Rep. 3661, April 1999.).
Random triangulations.
Discrete and Computational Geometry, 22(1), 1999.
Singularity analysis and asymptotics of Bernoulli sums.
Theoretical Computer Science, 215(1-2):371-381, 1999.
Analytic combinatorics of non-crossing configurations.
Discrete Mathematics, 204(1-3):203-229, 1999.
(Selected papers in honor of Henry W. Gould).
On Stirling numbers for complex argument and Hankel contours.
SIAM Journal on Discrete Mathematics, 12(2):155-159, 1999.
Motif statistics.
In J. Nešetril, editor, Algorithms, ESA'99, volume 1643 of Lecture Notes in Computer Science, pages 194-211, 1999.
Planar maps and Airy phenomena.
In U. Montanari, J. Rolim, and E. Welzl, editors, Automata, Languages, and Programming, number 1853 in Lecture Notes in Computer Science, pages 388-402, 2000.
Proceedings of the 27th ICALP Conference, Geneva, July 2000.
The formal theory of birth-and-death processes, lattice path combinatorics, and continued fractions.
Advances in Applied Probability, 32:750-778, 2000.
Trade-offs between density and robustness in random interconnection graphs.
In J van Leeuwen, O. Watanabe, M. Hagiya, P. D. Moses, and T. Ito, editors, IFIP International Conference on Theoretical Computer Science, volume 1872 of Lecture Notes in Computer Science, pages 152-168, August 2000.
(Proceedings of IFIP TCS'2000, Sendai, August 2000.).
Analytic combinatorics of chord diagrams.
In A. V. Mikhalev D. Krob, A. A. Mikhalev, editor, Formal Power Series and Algebraic Combinatorics, pages 191-201. Springer, 2000.
(Proceedings of the 12th International Conference, FPSAC'2000; June 2000, Moscow.).
Analytic variations on the redundancy rate of renewal processes.
In 2000 IEEE International Symposium on Information Theory, page 499. IEEE Information Theory Society, 2000.
(Short abstract).
Continued fractions, comparison algorithms, and fine structure constants.
In Michel Théra, editor, Constructive, Experimental, and Nonlinear Analysis, volume 27 of Canadian Mathematical Society Conference Proceedings, pages 53-82, Providence, 2000. American Mathematical Society.
Data compression via binary decision diagrams.
In 2000 IEEE International Symposium on Information Theory, page 296. IEEE Information Theory Society, 2000.
(Short abstract).
Analytic variations on bucket selection and sorting.
Acta Informatica, 36(9-10):735-760, 2000.
Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
Random Structures & Algorithms, 19(3/4):194-246, 2001.
Dynamical sources in information theory: A general analysis of trie structures.
Algorithmica, 29(1/2):307-369, 2001.
.
Random Structures & Algorithms, 19(3/4):150-162, 2001.
Introduction to special volume on ``Analysis of Algorithms'' dedicated to D. E. Knuth.
The complete analysis of a polynomial factorization algorithm over finite fields.
Journal of Algorithms, 40(1):37-81, 2001.
Hidden pattern statistics.
In F. Orejas, P. Spirakis, and J. van Leeuwen, editors, Automata, Languages, and Programming, number 2076 in Lecture Notes in Computer Science, pages 152-165. Springer Verlag, 2001.
Proceedings of the 28th ICALP Conference, Crete, July 2001.
Analytic variations on the Airy distribution.
Algorithmica, 31(3):361-377, 2001.
Analytic combinatorics: Functional equations, rational and algebraic functions.
Research Report 4103, INRIA, 2001.
98 pages.
Generating functions of generating trees.
Discrete Mathematics, 246(1-3):29-55, March 2002.
Basic analytic combinatorics of directed lattice paths.
Theoretical Computer Science, 281(1-2):37-80, 2002.
Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities.
Trends in Mathematics. Birkhäuser Verlag, Basel, 2002.
560 pages. Proceedings of a Colloquium held at Versailles, September 2002.
Random sampling from Boltzmann principles.
In P. Widmayer et al., editor, Automata, Languages, and Programming, number 2380 in Lecture Notes in Computer Science, pages 501-513. Springer Verlag, 2002.
Singular combinatorics.
In Li Tatsien (Li Daqian), editor, Proceedings of the International Congress of Mathematicians, volume III, pages 561-571. World Scientific, 2002.
Invited lecture, ICM02, Beijing, China, 20-28 August 2002.
On the robustness of interconnections in random graphs: A symbolic approach.
Theoretical Computer Science, 287(2):513-534, 2002.
Analytic variations on redundancy rates of renewal processes.
IEEE Transactions on Information Theory, 48(11):2911-2921, 2002.
Motif statistics.
Theoretical Computer Science, 287(2):593-617, 2002.
Hachage, arbres, chemins, et graphes.
Gazette des Mathématiciens, pages 29-49, 2003.
LOGLOG counting of large cardinalities.
In G. Di Battista and U. Zwick, editors, Annual European Symposium on Algorithms (ESA03), volume 2832 of Lecture Notes in Computer Science, pages 605-617, 2003.
And/Or Trees Revisited.
Combinatorics, Probability and Computing, 13(4-5):501-513, 2004.
Special issue on Analysis of Algorithms.
Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities.
Trends in Mathematics (Mathematics, Computer Science). Birkhäuser Verlag, 2004.
554 pages.
Boltzmann samplers for the random generation of combinatorial structures.
Combinatorics, Probability and Computing, 13(4-5):577-625, 2004.
Special issue on Analysis of Algorithms.
Counting by coin tossings.
In M. Maher, editor, Proceedings of ASIAN'04 (Ninth Asian Computing Science Conference), volume 3321 of Lecture Notes in Computer Science, pages 1-12, 2004.
(Text of Opening Keynote Address.).
Airy phenomena and analytic combinatorics of connected graphs.
Electronic Journal of Combinatorics, 11(2:#R34):1-30, 2004.
Singularity analysis, Hadamard products, and tree recurrences.
Journal of Computational and Applied Mathematics, 174:271-313, February 2005.
Analytic urns.
Annals of Probability, 33(3):1200-1233, 2005.
Available from ArXiv:math.PR/0407098.
On the non-holonomic character of logarithms, powers, and the
th
prime function.
Electronic Journal of Combinatorics, 11(2)(A1):1-16, 2005.
Fast computation of special resultants.
Journal of Symbolic Computation, 41(1):1-29, January 2006.
The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion.
Séminaire Lotharingien de Combinatoire, 54(B54g):1-44, 2006.
The ubiquitous digital tree.
In Bruno Durand and Wolfgang Thomas, editors, STACS 2006, volume 3884 of Lecture Notes in Computer Science, pages 1-22, 2006.
Proceedings of 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, February 2006.
Some exactly solvable models of urn process theory.
In Philippe Chassaing, editor, Discrete Mathematics and Computer Science Proceedings, volume AG, pages 59-118, 2006.
Proceedings of Mathematics and Computer Science Conference. Invited Lecture.
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics.
Electronic Journal of Combinatorics, 13(1:R103):1-35, 2006.
The scientific works of Rainer Kemp (1949-2004).
Theoretical Computer Science, 355(3):371-381, April 2006.
Hidden word statistics.
Journal of the ACM, 53(1):147-183, January 2006.
On differences of zeta values.
Preprint arXiv:math.CA/0611332, November 2006.
Submitted to Journal of Computational and Applied Mathematics.
Analytic combinatorics--a calculus of discrete structures.
In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 137-148. SIAM Press, 2007.
Invited Lecture.
Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm.
In Philippe Jacquet, editor, Analysis of Algorithms 2007 (AofA07), Discrete Mathematics and Theoretical Computer Science Proceedings, 2007.
In press.
Boltzmann sampling of unlabelled structures.
In David Appelgate et al., editor, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics, pages 201-211. SIAM Press, 2007.
Proceedings of the New Orleans Conference.
Analytic Combinatorics.
2007.
Chapters I-IX of a book to be published by Cambridge University Press, 751p.+x, available electronically from P. Flajolet's home page.