Complete Papers of Philippe Flajolet assembled by Mark Daniel Ward (version of March 25, 2012)
1 Papers [PF001]–[PF208] Listed by Co-Author
Philippe Flajolet as sole author: [PF014, PF015a, PF015b, PF016, PF017, PF022, PF023a, PF023b, PF029, PF032, PF037, PF038, PF039, PF044b, PF046, PF047, PF048, PF056, PF063, PF064, PF069, PF070, PF071, PF072, PF084, PF092, PF097, PF098, PF099, PF108b, PF108c, PF126, PF128b, PF133, PF134, PF148, PF162, PF171, PF180, PF187, PF192, PF203b, L02, P01, P07, P08, M01, M02, M03, M04, M05, M06, P03, RR0153, RR0397, RR0398, RR0400, RR0483, RR0518, RR0729, RR1025, RR1644, RR3401] (Should add the uncollected papers to this list too.)
1. Allouche, Jean-Paul [PF083]
2. Autebert, Jean-Michel [PF062, RR0492]
3. Bacher, Roland [PF203a]
4. Banderier, Cyril [PF146, PF152, PF160, PF167, PF168, RR3661, TR006, TR007, TR009]
5. Beaton, Nicholas R. [PF204, P06]
6. Bergeron, Fran¸cois[PF096, RR1583]
7. Blasiak, Pawel [PF205]
8. B´ona,Mikl´os[PF198]
9. Bostan, Alin [PF185, RR4579]
10. Bousquet-M´elou,Mireille [PF146, PF167, RR3661, TR006]
11. Broutin, Nicolas [PF195, PF206]
12. Chassaing, Philippe [PF175, P04]
13. Chauvin, Brigitte [PF177]
14. Ch´eno,Laurent [PF021]
15. Cheung, Y. K. [PF199]
16. Cl´ement, Julien [PF140, PF161, PF202, RR3295, RR3645]
17. Coffman, Edward G. [PF141, RR3223]
18. Conrad, Eric van Fossen [PF186]
19. Cunto, Walter [PF075]
20. Daud´e,Herv´e[PF114, PF132, RR2243, RR2798]
21. Denise, Alain [PF146, PF167, RR3661, TR006]
1 22. Devroye, Luc [PF147]
23. Duchon, Philippe [PF170, PF179, TR010, TR014]
24. Dumas, Philippe [PF120, PF125, PF188, U04, RR2163, RR2369]
25. Durand, Marianne [TR017, PF176]
26. Fayolle, Guy [PF049, PF055, RR0131, RR0245]
27. Fill, James Allen [PF202, TR016, PF182]
28. Flatto, Leopold [PF141, RR3223]
29. Fran¸con,Jean [PF018, PF019, PF021, PF024, PF025, PF077, RR0346, RR0758]
30. Fusy, Eric´ [PF189, PF193, PF194]
31. Gabarr´o,Joaquim [PF062, PF183, RR0492, TR015]
32. Gandouet, Olivier [PF193]
33. Gao, Zhicheng [PF104, RR1749]
34. Gardy, Dani`ele [PF073, PF081, PF082, PF100, PF146, PF167, PF177, RR0720, RR0892, RR3661, TR006]
35. Gerhold, Stefan [PF184, PF207]
36. Gittenberger, Bernhard [PF177]
37. Golin, Mordecai [PF105, PF115, PF199, RR1612]
38. Gonnet, Gaston [PF093, PF106, RR1336]
39. Gourdon, Xavier [PF107, PF120, PF127, PF135, PF145, PF163, PF189, RR1857, RR2369, RR2852, RR2997, RR3370, TR002]
40. Gouyou-Beauchamps, Dominique [PF146, PF167, RR3661, TR006]
41. Grabner, Peter J. [PF116, PF121, RR1498, RR1760]
42. Greenberg, Albert G. [PF068, RR0333]
43. Guillemin, Fabrice [PF153, RR3667]
44. Guivarc’h, Yves [PF164, TR008]
45. Guttmann, Anthony J. [PF204, P06]
46. Hatzis, Kostas [PF154, PF172, RR4069, TR004]
47. Hofri, Micha [PF049, PF055, PF141, RR0131, RR0245, RR3223]
48. Hoshi, Mamoru [PF103, RR1434]
49. Huet, G´erard[P05]
2 50. Huillet, Thierry [PF196]
51. Hurtado, Ferran [PF147]
52. Jacquet, Philippe [PF049, PF065, PF159, RR0245, RR0648, RR3399]
53. Kapur, Nevin [TR016, PF182]
54. Kherlakian, Jean-Pierre [PF010]
55. Kieffer, John [PF158, U03]
56. Kirschenhofer, Peter [PF074, PF076, PF116, PF121, RR0719, RR1498, RR1760]
57. Knuth, Donald E. [PF078, RR0888, A01]
58. Labelle, Gilbert [PF122, RR2249]
59. Ladner, Richard E. [PF068, RR0333]
60. Lafforgue, Thomas [PF117, RR1862]
61. Laforest, Louise [PF122, RR2249]
62. Lau, Gustavo [PF075]
63. Lee, C. Y. James [PF199]
64. Louchard, Guy [PF165, PF170, PF179, TR005, TR010, TR014]
65. Mahmoud, Hosam [PF159, RR3399]
66. Martin, G. Nigel [PF040, PF050, RR0313]
67. Mart´ınez,Conrado [PF135, RR2997]
68. Mathys, Peter [PF054, RR0334]
69. Mend`esFrance, Michel [PF083]
70. Meunier, Fr´ed´eric[PF193]
71. Nebel, Markus [PF190]
72. Nicod`eme,Pierre [PF151, PF174, RR3606]
73. Nikoletseas, Sotiris [PF154, PF172, RR4069, TR004]
74. Noy, Marc [PF147, PF149, PF155, RR3196, RR3914]
75. Odlyzko, Andrew M. [PF026, PF033, PF045, PF085, PF086, PF104, RR0056, RR0282, RR0826, RR1114, RR1749]
76. Ottmaan, Thomas [PF051]
77. Panario, Daniel [PF127, PF145, PF163, PF189, RR2852, RR3370, TR002]
78. Pekari, Helmut [PF183, TR015]
3 79. Pelletier, Maryse [PF200]
80. Pittel, Boris [PF078, RR0888]
81. Pivoteau, Carine [PF194]
82. Pouyanne, Nicolas [PF189]
83. Puech, Claude [PF021, PF030, PF041, PF058, PF059, PF081, PF082, PF093, PF106, RR0233, RR0241, RR0892, RR1336]
84. Poblete, Patricio [PF142, RR3265]
85. Prodinger, Helmut [PF057, PF066, PF116, PF121, PF150, PF190, RR0266, RR0484, RR1498, RR1760, RR3373]
86. Puyhaubert, Vincent [PF188]
87. Raoult, Jean-Claude [PF013, PF020]
88. Ramshaw, Lyle [PF027]
89. R´egnier,Mireille [PF052, PF053, PF159, RR0298, RR3399]
90. Richmond, Bruce [PF101, PF104, RR1423, RR1749]
91. Robert, Philippe [U04]
92. Robson, John Michael [PF093, PF106, RR1336]
93. Roux, Mathieu [PF208]
94. Saheb, Nasser [PF042, PF060, RR0159]
95. Salvy, Bruno [PF079, PF080, PF094, PF096, PF107, PF109, PF122, PF123, PF136, PF143, PF151, PF174, PF181, PF184, PF185, PF207, RT0209, RR0876, RR1233, RR1583, RR1857, RR2249, RR2497, RR2917, RR3606, RR4579, RR4581, TR013]
96. Schaeffer, Gilles [PF152, PF160, PF170, PF179, PF181, RR4581, TR007, TR010, TR013, TR014]
97. Schost, Eric´ [PF185, RR4579]
98. Schott, Ren´e[PF087, RR1066]
99. Sedgewick, Robert [PF052, PF061, PF110, PF111, PF118, PF124, PF129, PF130, PF131, PF137, PF166, PF201, L01, RR0311, RR2231, TR003, TR011, TR018]
100. Sipala, Paolo [PF089, RR1210]
101. Soria, Mich`ele[PF088, PF095, PF112, PF152, PF160, PF200, RR0809, RR1002, TR007]
102. Sotteau, Dominique [PF034, PF053, RR0298]
103. Spirakis, Paul [PF154, PF172, RR4069, TR004]
104. Steiger, William [PF147]
4 105. Steyaert, Jean-Marc [PF001, PF002, PF003, PF004, PF005, PF006, PF007, PF008, PF011, PF012, PF028, PF031, PF035, PF036, PF043, PF067, PF089, P02, RR0239, RR1210]
106. Szpankowski, Wojciech [PF138, PF156, PF164, PF173, PF191, RR3553, TR008, TR012]
107. Tauraso, Roberto [U04]
108. Thimonier, Lo¨ys[PF073, PF100, RR0720]
109. Tichy, Robert F. [PF074, PF076, PF116, RR0719, RR1498]
110. Vall´ee,Brigitte [PF090, PF114, PF132, PF140, PF144, PF157, PF161, PF202, PF208, RR1277, RR2243, RR2798, RR2931, RR3295, RR3645, RR4072, TR001, PF164, PF191, TR008, TR012, U01]
111. Van Cutsem, Bernard [PF113, PF119, RR1830]
112. Vardi, Ilan [U02]
113. Vepstas, Linas [PF197]
114. Viola, Alfredo [PF142, RR3265]
115. Vitter, Jeffrey Scott [PF091, RR0718]
116. Vuillemin, Jean [PF013, PF018, PF019, PF020, PF021, PF025, PF059, RR0241, RR0346]
117. Wood, Derick [PF051]
118. Yang, En-Hui [PF158, U03]
119. Zimmermann, Paul [PF079, PF080, PF094, PF113, PF119, RR0876, RR1233, RR1830]
Editor for [PF009] Co-Editor for volumes [PF102a, PF108a, PF128a, PF139, PF169, PF178] Foreword to books [F01, F02] Delivered Algorithms Seminars: [PF102c, PF102f, S92-93a, S92-93b, S93-94b, S95-96a, S96-97a, S97-98d, S99-00b, S00-01b, S01-02a, S02-04a, S2007]; joint with Mich`eleSoria [S97-98a]; joint with Eric Conrad [S2005]; based on joint works with Philippe Duchon, Eric´ Fusy, Guy Louchard, Carine Pivoteau, and Gilles Schaeffer [S2006]; joint with Roland Bacher [S2009] Summarized Algorithms Seminars: [PF102b, PF102d, PF102e, S92-93c, S93-94a, S94-95a, S96-97b, S96-97c, S96-97d, S97-98b, S97-98c, S97-98e, S98-99a, S98-99b, S99-00a, S99-00c, S99-00e, S00-01a]; summary joint with Fabrice Guillemin [S97-98f]; summary joint with Philippe Dumas [S99-00d]
5 2 Papers [PF001]–[PF208] Listed by Publication
(Should add the uncollected papers to this list too, whenever it becomes clear that most of the uncollected papers have been gathered.)
1. ACM SIGSAM Bulletin [PF136]
2. Acta Informatica [PF037, PF115, PF159]
3. Advances in Applied Probability [PF055, PF153]
4. Advances in Cryptology–EUROCRYPT [PF085]
5. Algorithmica [PF106, PF142, PF161, PF165]
6. Algorithms and Data Structures [PF075, PF081]
7. ANALCO [PF194, PF199]
8. Analytic Combinatorics [PF201]
9. Annals of Discrete Mathematics [PF022, PF053]
10. Annals of Probability [PF183]
11. Asian Computing Science Conference [PF180]
12. Ast´erisque[PF012]
13. BIT [PF048, PF103]
14. Codici, Complessit`adi Calcolo e Linguaggi Formali, [PF011]
15. Colloque de Lille sur les Arbres en Alg`ebreet en Programmation (CLAAP; continued as Colloquium on Trees in Algebra and Programming (CAAP)), [PF015a, PF015b]
16. Colloque sur les Math´ematiquesde l’Informatique, [PF035]
17. Colloquium on Trees in Algebra and Programming (CAAP; formerly Colloque de Lille sur les Arbres en Alg`ebreet en Programmation (CLAAP)) [PF042, PF096]
18. Combinatorial Algorithms on Words [PF052]
19. Combinatorics, Probability and Computing [PF104, PF132, PF177, PF179]
20. Computing [PF084]
21. Conference on Communication, Control, and Computing [PF021]
22. Constructive, experimental, and nonlinear analysis [PF157]
23. Dagstuhl Seminar Report [PF108a, PF108b, PF108c, PF128a, PF128b]
24. Discrete & Computational Geometry [PF117, PF147]
25. Discrete Applied Mathematics [PF100]
6 26. Discrete Mathematics [PF023a, PF032, PF066, PF078, PF112, PF149, PF167, PF023b]
27. DMTCS Proceedings [PF188, PF193, PF195, PF196, PF208]
28. The Electronic Journal of Combinatorics [PF181, PF184, PF189, PF207]
29. Encyclopaedia of Mathematics [PF134]
30. Encyclopædia Universalis [PF044a, PF044b]
31. Experimental Mathematics [PF143]
32. European Journal of Combinatorics [PF077, PF087]
33. European Symposium on Algorithms [PF113, PF151, PF176]
34. Flow Control of Congested Networks [PF065]
35. Foundations of Computer Science [PF013, PF018, PF026, PF031, PF040, PF041, PF090]
36. Fourth Colloquium on Mathematics and Computer Science [PF188]
37. Gazette des Math´ematiciens[PF107, PF175]
38. Handbook of Theoretical Computer Science [PF091]
39. IEEE International Symposium on Information Theory [PF156, PF158]
40. IEEE Transactions on Information Theory [PF049, PF054, PF173]
41. Information and Control [PF043]
42. Information Processing Letters [PF062]
43. Information Sciences [PF059]
44. Information Systems [PF082]
45. Informatique et Philologie (Proceedings) [PF009, PF010]
46. INRIA/IRIA Research or Technical Report [PF005, PF014, PF063, PF008, PF071, PF080, PF092, PF102a, PF102b, PF102c, PF102d, PF102e, PF102f, PF110, PF111, PF118, PF129, PF137, PF166]
47. International Colloquium on Automata, Languages and Programming [PF001, PF006, PF028, PF036, PF046, PF073, PF089, PF097, PF105, PF127, PF152, PF164, PF170, PF202]
48. International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [PF079]
49. International Conference on Foundations of Computation Theory [PF039, PF047]
50. International Conference on Formal Power Series and Algebraic Combinatorics [PF146, PF155]
51. International Congress of Mathematicians [PF171]
7 52. International Federation for Information Processing International Conference on Theoretical Computer Science [PF154]
53. International Federation for Information Processing Working Group 7.3 (IFIP WG 7.3) In- ternational Symposium on Computer Performance Modelling, Measurement, and Evaluation [PF072]
54. International Symposium on Algorithmic Number Theory, [PF114, PF145]
55. An Introduction to the Analysis of Algorithms [PF130, PF131]
56. Irregularities of Partitions [PF076]
57. Japanese-French Symposium on Analytic Number Theory [PF083]
58. Journal de Th´eorie des Nombres de Bordeaux [PF125]
59. Journal of Algorithms [PF025, PF060, PF163]
60. Journal of Applied Probability [PF198]
61. Journal of Combinatorial Theory, Series A [PF088]
62. Journal of Computational and Applied Mathematics [PF121, PF182, PF197]
63. Journal of Computer and System Sciences [PF033, PF050]
64. Journal of Physics A: Mathematical and Theoretical [PF204]
65. Journal of Symbolic Computation [PF123, PF185]
66. Journal of the ACM [PF058, PF068, PF191]
67. III Journ´eesAlgorithmiques [PF024]
68. Journ´eesMath´ematiquede la Compilation [PF004]
69. Journ´eesScientifiques et Prix UAP 1985, 1986, 1987 [PF070]
70. Mathematical Foundations of Computer Science [PF002, PF056]
71. Mathematical Proceedings of the Cambridge Philosophical Society [PF045]
72. Mathematical Systems Theory [PF067]
73. Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities [PF169]
74. Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities [PF178]
75. Notes of the Seminar on Probabilistic Methods in Algorithmics [PF126]
76. Online supplement [PF203b]
77. Probability in the Engineering and Informational Sciences [PF141]
8 78. Probability Theory and Related Fields [PF074]
79. Q¨uestii´o[PF030]
80. Ramanujan Journal [PF203a]
81. Random Structures & Algorithms [PF101, PF122, PF135, PF138, PF139, PF160, PF162, PF206]
82. RAIRO. Informatique Th´eorique(Theoretical Informatics) [PF051]
83. Revue Fran¸caised’Automatique, Informatique et Recherche Op´erationnelle(RAIRO). Infor- matique Th´eorique[PF007]
84. La Science au Pr´esent [PF098]
85. S´eminaireDelange-Pisot-Poitou (Th´eorie des Nombres) [PF017]
86. S´eminaireInternational sur la Mod´elisationet les M´ethodes d’Evaluation´ de Performance [PF038]
87. S´eminaireLotharingien de Combinatoire [PF186, PF205]
88. SIAM Journal on Computing [PF027, PF057, PF061]
89. SIAM Journal on Discrete Mathematics [PF086, PF095, PF150]
90. SIAM Review [PF133]
91. Singularit´e[PF099]
92. Symposium on Discrete Algorithms [PF093, PF140, PF192, PF200]
93. Symposium on Theoretical Aspects of Computer Science [PF187]
94. Symposium on Theory of Computing [PF019]
95. Thesis / Cahiers du Bureau Universitaire de Recherche Op´erationnelle[PF003, PF016, PF029]
96. Theoretical Computer Science [PF020, PF064, PF094, PF116, PF119, PF120, PF124, PF144, PF148, PF168, PF172, PF174, PF190]
97. Trends in Theoretical Computer Science [PF069]
98. World Conference on Mathematics at the Service of Man [PF034]
9 References
[R02] Toufik Mansour. Review of Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick. Zentralblatt MATH. Zbl 1165.05001. [R01] Jozef Vyskoˇc. Review of An Introduction to the Analysis of Algorithms by Robert Sedgewick and Philippe Flajolet. Zentralblatt MATH. Zbl 0841.68059. [PF001] Philippe Flajolet and Jean-Marc Steyaert. Complexit´edes probl`emesde d´ecisionrelatifs aux algorithmes de tri. In Maurice Nivat, editor, Proceedings of the 1st Colloquium on Automata, Languages and Programming (ICALP 1972), pages 537–548. North Holland, Amsterdam, 1972. [PF004] Philippe Flajolet and Jean-Marc Steyaert. A class of non-recursive sorting algorithms. In E. Bianco, P. Flajolet, P. Jammes, L. Julien, B. Robinet, and R. Stutzmann, ed- itors, Journ´eesdes Math´ematiquesde la Compilation, pages 42–49. Universit´ed’Aix Marseille II, 1973. [PF002] Philippe Flajolet and Jean-Marc Steyaert. Decision problems for multihead finite au- tomata. In Jozef Gruska, Branislav Rovan, and Juraj Wiedermann, editors, Proceedings of the 2nd Symposium on Mathematical Foundations of Computer Science (MFCS), pages 225–230. Prague Mathematical Institute of the Slovak Academy of Sciences, 1973. [PF005] Philippe Flajolet and Jean-Marc Steyaert. Generalized immune sets. Research Re- port 40, Institut de Recherche en Informatique et en Automatique (IRIA), November 1973. 22 pages. [PF003] Philippe Flajolet and Jean-Marc Steyaert. Une formalisation de la notion d’algorithme de tri non r´ecurrent. Ph.D. thesis, Th`esede 3`emecycle, Universit´ede Paris VII, 1973. Presented jointly with Jean-Marc Steyaert. [PF009] Philippe Flajolet, editor. Informatique et Philologie. Institut de Recherche d’Informatique et d’Automatique, Rocquencourt, France, 1974. 233 pages. Proceedings of a colloquium organized at IRIA, Rocquencourt, France, 4–5 November 1974. [PF010] Philippe Flajolet and Jean-Pierre Kherlakian. Linguistique formelle et linguistique his- torique. In Philippe Flajolet, editor, Informatique et Philologie, pages 195–207. Institut de Recherche d’Informatique et d’Automatique, Rocquencourt, France, 1974. Proceed- ings of a colloquium organized by IRIA, Rocquencourt, France, 4–5 November 1974. See [PF009]. [PF008] Philippe Flajolet and Jean-Marc Steyaert. Complexity of classes of languages and op- erators. Research Report 92, Institut de Recherche en Informatique et en Automatique (IRIA), 1974. 13 pages. [PF006] Philippe Flajolet and Jean-Marc Steyaert. On sets having only hard subsets. In Jacques Loeckx, editor, Proceedings of the 2nd Colloquium on Automata, Languages and Pro- gramming (ICALP 1974), volume 14 of Lecture Notes in Computer Science, pages 446– 457. Springer, Berlin/Heidelberg, 1974. [PF007] Philippe Flajolet and Jean-Marc Steyaert. Une g´en´eralisationde la notion d’ensemble immune. Revue Fran¸caised’Automatique, Informatique et Recherche Op´erationnelle (RAIRO). Informatique Th´eorique, 8:37–48, 1974.
10 [PF011] Philippe Flajolet and Jean-Marc Steyaert. Classes de complexit´eet probl`emescomplets. In Codici, Complessit`adi Calcolo e Linguaggi Formali, pages 118–139. Liguori Pub., 1975.
[PF012] Philippe Flajolet and Jean-Marc Steyaert. Hi´erarchies de complexit´eet r´eductionsentre probl`emes. Ast´erisque, 38–39:53–72, 1976.
[PF013] Philippe Flajolet, Jean-Claude Raoult, and Jean Vuillemin. On the average number of registers required for evaluating arithmetic expressions. In Proceedings of the 18th An- nual Symposium on Foundations of Computer Science, pages 196–205. IEEE Computer Society Press, 1977. This version is subsumed by [PF020].
[PF014] Philippe Flajolet. Analyse d’algorithmes de manipulation de fichiers. Research Report 321, Institut de Recherche en Informatique et en Automatique (IRIA), 1978. 28 pages. For preliminary version, see [P01].
[PF015a] Philippe Flajolet. Analyse en moyenne de la d´etectiondes arbres partiels. In Andr´e Arnold, Max Dauchet, and G´erardJacob, editors, Proceedings of 3`emeColloque de Lille sur les Arbres en Alg`ebre et en Programmation (CLAAP), pages 134–138. Universit´edes Sciences et Techniques de Lille 1, 1978. For expanded version, see [PF015b].
[PF015b] Philippe Flajolet. On the analysis of tree matching, 1978. 8 pages. For preliminary version, see [PF015a].
[PF017] Philippe Flajolet. Deux probl`emesd’analyse d’algorithmes. S´eminaire Delange-Pisot- Poitou (Th´eoriedes Nombres), 20:14-01–14-10, 1978/79.
[PF016] Philippe Flajolet. Analyse d’algorithmes de manipulation d’arbres et de fichiers. Habil- itation thesis, Doctorat `esSciences, Universit´ede Paris XI, Orsay, 1979. For published version, see [PF029].
[P01] Philippe Flajolet. Analyse d’algorithmes de manipulation de fichiers. In Max Dauchet, editor, Proceedings of 4`emeColloque de Lille sur les Arbres en Alg`ebre et en Program- mation (CLAAP), pages 296–318. Universit´edes Sciences et Techniques de Lille 1, 1979. For expanded version, see [PF014].
[PF019] Philippe Flajolet, Jean Fran¸con,and Jean Vuillemin. Computing integrated costs of sequences of operations with application to dictionaries. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC ’79), pages 49–61. Association for Computing Machinery, 1979. For preliminary version, see [RR0346].
[RR0346] Philippe Flajolet, Jean Fran¸con,and Jean Vuillemin. Computing integrated costs of sequences of operations with application to dictionaries. Research Report 346, Institut National de Recherche en Informatique et en Automatique (INRIA), 1979. 13 pages. For published version, see [PF019].
[PF018] Philippe Flajolet, Jean Fran¸con,and Jean Vuillemin. 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. This version is subsumed by [PF025].
11 [PF020] Philippe Flajolet, Jean-Claude Raoult, and Jean Vuillemin. The number of registers required for evaluating arithmetic expressions. Theoretical Computer Science, 9:99–125, 1979. For preliminary version, see [PF013]. [PF021] Laurent Ch´eno,Philippe Flajolet, Jean Fran¸con,Claude Puech, and Jean Vuillemin. Dynamic data structures: finite files, limiting profiles and variance analysis. In Eighteenth Annual Conference on Communication, Control, and Computing, pages 223–232. 1980. [PF022] Philippe Flajolet. Combinatorial aspects of continued fractions. In Michel Deza and Ivo G. Rosenberg, editors, Combinatorics 79, volume 9 of Annals of Discrete Math- ematics, pages 217–222. Elsevier, 1980. Proceedings of Colloque Franco-Canadien de Combinatoire, at the University of Montreal. This version is subsumed by [PF023a]. [PF023a] Philippe Flajolet. Combinatorial aspects of continued fractions. Discrete Mathematics, 32:125–161, 1980. Reprinted in the 35th Special Anniversary Issue. See [PF023b]. For preliminary version, see [PF022]. [PF024] Philippe Flajolet and Jean Fran¸con. Structures de donn´eesdynamiques en r´eservoir born´e.In Jacques Morgenstern, editor, III`emesJourn´eesAlgorithmiques (rencontres de la R.C.P. Algorithmique). Universit´ede Nice, 1980. 14 pages. [PF025] Philippe Flajolet, Jean Fran¸con,and Jean Vuillemin. Sequence of operations analysis for dynamic data structures. Journal of Algorithms, 1:111–141, 1980. For preliminary version, see [PF018]. [PF026] Philippe Flajolet and Andrew Odlyzko. 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. This version is subsumed by [PF033]. [PF027] Philippe Flajolet and Lyle Ramshaw. A note on Gray code and odd-even merge. SIAM Journal on Computing, 9:142–158, 1980. [P07] Philippe Flajolet and Jean-Marc Steyaert. On the analysis of tree-matching algorithms. In Max Dauchet and Eric´ Lilin, editors, Proceedings of 5`emeColloque de Lille sur les Arbres en Alg`ebre et en Programmation (CLAAP). Universit´edes Sciences et Techniques de Lille 1, 1980. [PF028] Philippe Flajolet and Jean-Marc Steyaert. On the analysis of tree-matching algorithms. In Jaco W. de Bakker and Jan van Leeuwen, editors, Proceedings of the 7th Interna- tional Colloquium on Automata, Languages and Programming (ICALP 80), volume 85 of Lecture Notes in Computer Science, pages 208–219. Springer, Berlin/Heidelberg, 1980. [PF029] Philippe Flajolet. Analyse d’algorithmes de manipulation d’arbres et de fichiers, volume 34–35 of Cahiers du Bureau Universitaire de Recherche Op´erationnelle. Universit´ePierre- et-Marie-Curie, Paris, 1981. Based on the author’s Doctorate in Sciences, 1979, see [PF016]. 209 pages. [RR0056] Philippe Flajolet and Andrew Odlyzko. The average height of binary trees and other simple trees. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), 1981. 55 pages. For published version, see [PF033]. [PF030] Philippe Flajolet and Claude Puech. Analyse de structures de donn´eesdynamiques et histoires de fichiers. Q¨uestii´o, 5:31–48, 1981.
12 [PF031] Philippe Flajolet and Jean-Marc Steyaert. 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. This version is subsumed by [PF067].
[RR0131] Guy Fayolle, Philippe Flajolet, and Micha Hofri. On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel. Research Report 131, Institut National de Recherche en Informatique et en Automatique (INRIA), 1982. 36 pages. For published version, see [PF055].
[RR0153] Philippe Flajolet. On approximate counting. Research Report 153, Institut National de Recherche en Informatique et en Automatique (INRIA), 1982. 22 pages. For published version, see [PF038].
[PF032] Philippe Flajolet. On congruences and continued fractions for some classical combina- torial quantities. Discrete Mathematics, 41:145–153, 1982.
[PF033] Philippe Flajolet and Andrew Odlyzko. The average height of binary trees and other sim- ple trees. Journal of Computer and System Sciences, 25:171–213, 1982. For preliminary versions, see [PF026, RR0056].
[RR0159] Philippe Flajolet and Nasser Saheb. The complexity of generating an exponentially distributed variate. Research Report 159, Institut National de Recherche en Informatique et en Automatique (INRIA), 1982. 29 pages. For published version, see [PF060].
[PF034] Philippe Flajolet and Dominique Sotteau. A recursive partitioning process of computer science. In Antoni Ballester, David Card´us,and Enric Trillas, editors, Proceedings of the Second World Conference on Mathematics at the Service of Man, pages 25–30. Univer- sidad Polit´ecnicade Las Palmas, Las Palmas, Canary Islands, Spain, 1982.
[PF036] Philippe Flajolet and Jean-Marc Steyaert. A branching process arising in dynamic hash- ing, trie searching and polynomial factorization. In Mogens Nielsen and Erik Meineche Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Lan- guages and Programming (ICALP 82), volume 140 of Lecture Notes in Computer Sci- ence, pages 239–251. Springer, Berlin/Heidelberg, 1982.
[PF035] Philippe Flajolet and Jean-Marc Steyaert. El´ements´ d’un calcul de complexit´ede pro- grammes r´ecursifsd’arbres. In Colloque sur les Math´ematiquesde l’Informatique— Mathematics for Computer Science, pages 81–92. Association Fran¸caise pour la Cy- bern´etique Economique´ et Technique (AFCET), Paris, March 1982.
[RR0245] Guy Fayolle, Philippe Flajolet, Micha Hofri, and Philippe Jacquet. Analysis of a stack algorithm for random multiple-access communication. Research Report 245, Institut National de Recherche en Informatique et en Automatique (INRIA), 1983. 19 pages. For published version, see [PF049].
[PF039] Philippe Flajolet. Methods in the analysis of algorithms: Evaluations of a recursive partitioning process. In Marek Karpinski, editor, Proceedings of the 1983 International Conference on Foundations of Computation Theory (FCT ’83), volume 158 of Lecture Notes in Computer Science, pages 141–158. Springer, Berlin/Heidelberg, 1983.
13 [PF038] Philippe Flajolet. On approximate counting. In S´eminaire International sur la Mod´elisationet les M´ethodes d’Evaluation´ de Performance—International Seminar on Modelling and Performance Evaluation Methodology, volume 2, pages 205–236. Insti- tut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, France, January 1983. For preliminary version, see [RR0153]. This version is subsumed by [PF048].
[PF037] Philippe Flajolet. On the performance evaluation of extendible hashing and trie search- ing. Acta Informatica, 20:345–369, 1983.
[PF040] Philippe Flajolet and G. Nigel Martin. Probabilistic counting. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 76–82. IEEE Computer Society Press, 1983. This version is subsumed by [PF050].
[RR0233] Philippe Flajolet and Claude Puech. Partial match retrieval of multidimensional data. Research Report 233, Institut National de Recherche en Informatique et en Automatique (INRIA), 1983. 45 pages. For published version, see [PF058].
[PF041] Philippe Flajolet and Claude Puech. 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. This version is subsumed by [PF058].
[RR0241] Philippe Flajolet, Claude Puech, and Jean Vuillemin. The analysis of simple list struc- tures. Research Report 241, Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 1983. 22 pages. For published version, see [PF059].
[PF042] Philippe Flajolet and Nasser Saheb. Digital search trees and the generation of an expo- nentially distributed variate. In Giorgio Ausiello and Marco Protasi, editors, Proceedings of the 8th Colloquium on Trees in Algebra and Programming (CAAP ’83), volume 159 of Lecture Notes in Computer Science, pages 221–235. Springer, Berlin/Heidelberg, 1983. This version is subsumed by [PF060].
[RR0239] Philippe Flajolet and Jean-Marc Steyaert. A complexity calculus for recursive tree algorithms. Research Report 239, Institut National de Recherche en Informatique et en Automatique (INRIA), 1983. 48 pages. For published version, see [PF067].
[PF043] Jean-Marc Steyaert and Philippe Flajolet. Patterns and pattern-matching in trees: An analysis. Information and Control, 58:19–58, 1983.
[PF044a] Philippe Flajolet. Algorithmique. In Encyclopædia Universalis. Encyclopædia Univer- salis, 1984. Reprinted in Dictionnaire des Math´ematiques: fondements, probabilit´es, applications, Albin Michel, Paris, 1998, with updated bibliography. Also available elec- tronically at http://www.universalis.fr/encyclopedie/algorithme/.
[RR0313] Philippe Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. Research Report 313, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 26 pages. For published version, see [PF050].
[PF045] Philippe Flajolet and Andrew M. Odlyzko. Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations. Mathematical Proceed- ings of the Cambridge Philosophical Society, 96:237–253, 1984. For preliminary version, see [RR0282].
14 [RR0282] Philippe Flajolet and Andrew M. Odlyzko. Limit distributions for coefficients of iter- ates of polynomials with applications to combinatorial enumerations. Research Report 282, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 30 pages. For published version, see [PF045].
[RR0266] Philippe Flajolet and Helmut Prodinger. Register allocation for unary-binary trees. Research Report 266, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 17 pages. For published version, see [PF057].
[RR0298] Philippe Flajolet, Mireille R´egnier, and Dominique Sotteau. Algebraic methods for trie statistics. Research Report 298, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 32 pages. For published version, see [PF053].
[RR0311] Philippe Flajolet and Robert Sedgewick. Digital search trees revisited. Research Report 311, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 20 pages. For published version, see [PF061].
[P02] Philippe Flajolet and Jean-Marc Steyaert. A complexity calculus for recursive tree algorithms. In Brigitte Rozoy, editor, Journ´eesd’Avignon : Theorie des Langages et Complexite des Algorithm´es, volume 6/B, pages 39–88. Publication of D´epartement de Math´ematiquesde l’Universit´eClaude Bernard Lyon 1, 1984. For published version, see [PF067].
[RR0333] Albert G. Greenberg, Philippe Flajolet, and Richard E. Ladner. Estimating the multi- plicities of conflicts in multiple access channels. Research Report 333, Institut National de Recherche en Informatique et en Automatique (INRIA), 1984. 62 pages. For published version, see [PF068].
[RR0334] Peter Mathys and Philippe Flajolet. Q-ary collision resolution algorithms in random- access systems with free or blocked channel access. Research Report 334, Institut Na- tional de Recherche en Informatique et en Automatique (INRIA), 1984. 90 pages. For published version, see [PF054].
[PF049] Guy Fayolle, Philippe Flajolet, Micha Hofri, and Philippe Jacquet. Analysis of a stack al- gorithm for random multiple-access communication. IEEE Transactions on Information Theory, IT-31:244–254, 1985. For preliminary version, see [RR0245].
[PF046] Philippe Flajolet. Ambiguity and transcendence. In Wilfried Brauer, editor, Proceed- ings of the 12th International Colloquium on Automata, Languages and Programming (ICALP 85), volume 194 of Lecture Notes in Computer Science, pages 179–188. Springer, Berlin/Heidelberg, 1985. This version is subsumed by [PF064]. For preliminary version, see [RR0397].
[RR0397] Philippe Flajolet. Ambiguity and transcendence. Research Report 397, Institut National de Recherche en Informatique et en Automatique (INRIA), 1985. 10 pages. For published version, see [PF046].
[PF048] Philippe Flajolet. Approximate counting: A detailed analysis. BIT, 25:113–134, 1985. For preliminary version, see [PF038].
[PF047] Philippe Flajolet. Elements of a general theory of combinatorial structures. In Lothar Budach, editor, Proceedings of the 1985 International Conference on Foundations of
15 Computation Theory (FCT ’85), volume 199 of Lecture Notes in Computer Science, pages 112–127. Springer, Berlin/Heidelberg, 1985. For preliminary version, see [PF063]. [RR0400] Philippe Flajolet. Mathematical methods in the analysis of algorithms and data struc- tures. Research Report 400, Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 1985. 72 pages. For published version, see [PF069]. [PF050] Philippe Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182–209, 1985. For prelimi- nary versions, see [PF040, RR0313]. [PF051] Philippe Flajolet, Thomas Ottmaan, and Derick Wood. Search trees and bubble memories. Revue Fran¸caised’Automatique, Informatique et Recherche Op´erationnelle (RAIRO). Informatique Th´eorique, 19:137–164, 1985. [RR0398] Philippe Flajolet, Mireille R´egnier,and Robert Sedgewick. Some uses of the mellin integral transform in the analysis of algorithms. Research Report 398, Institut National de Recherche en Informatique et en Automatique (INRIA), 1985. 14 pages. For published version, see [PF052]. [PF052] Philippe Flajolet, Mireille R´egnier,and Robert Sedgewick. Some uses of the Mellin integral transform in the analysis of algorithms. In Alberto Apostolico and Zvi Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO Advance Science In- stitute Series, Series F: Computer and Systems Sciences, pages 241–254. Springer-Verlag, Berlin/Heidelberg, 1985. Proceedings of the NATO Advanced Research Workshop on Combinatorial Algorithms on Words held at Maratea, Italy. For preliminary version, see [RR0398]. [PF053] Philippe Flajolet, Mireille R´egnier,and Dominique Sotteau. Algebraic methods for trie statistics. In Giorgio Ausiello and Mario Lucertini, editors, Analysis and Design of Al- gorithms for Combinatorial Problems, volume 25 of Annals of Discrete Mathematics, pages 145–188. North-Holland, 1985. Papers based on the workshop held at the Inter- national Centre for Mechanical Sciences (CISM) in Udine, Italy. Equivalently cited as North-Holland Mathematics Studies, volume 109. For preliminary version, see [RR0298]. [PF054] Peter Mathys and Philippe Flajolet. Q-ary collision resolution algorithms in random- access systems with free or blocked channel access. IEEE Transactions on Information Theory, IT-31:217–243, 1985. For preliminary version, see [RR0334]. [RR0492] Jean-Michel Autebert, Philippe Flajolet, and Joaquim Gabarr´o. Prefixes of infinite words and ambiguous context-free languages. Research Report 492, Institut National de Recherche en Informatique et en Automatique (INRIA), 1986. 8 pages. For published version, see [PF062]. [PF055] Guy Fayolle, Philippe Flajolet, and Micha Hofri. On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel. Advances in Applied Probability, 18:441–472, 1986. For preliminary version, see [RR0131]. [P08] Philippe Flajolet. Analytic models and ambiguity of context-free languages. In Jean- Michel Autebert and Joaquim Gabarr´o,editors, Actes des Journ´eesLANFOR, pages 69–95. Association Fran¸caisepour la Cybern´etique Economique´ et Technique (AFCET), 1986. This version is subsumed by [PF064]. For preliminary version, see [RR0483].
16 [RR0483] Philippe Flajolet. Analytic models and ambiguity of context-free languages. Research Report 483, Institut National de Recherche en Informatique et en Automatique (INRIA), 1986. 28 pages. For published version, see [P08].
[PF056] Philippe Flajolet. The evolution of two stacks in bounded space and random walks in a triangle. In Jozef Gruska, Branislav Rovan, and Juraj Wiedermann, editors, Pro- ceedings of the 12th Symposium on Mathematical Foundations of Computer Science (MFCS), volume 233 of Lecture Notes in Computer Science, pages 325–340. Springer, Berlin/Heidelberg, 1986. For preliminary version, see [RR0518].
[RR0518] Philippe Flajolet. The evolution of two stacks in bounded space and random walks in a triangle. Research Report 518, Institut National de Recherche en Informatique et en Automatique (INRIA), 1986. 16 pages. For published version, see [PF056].
[RR0484] Philippe Flajolet and Helmut Prodinger. Level number sequences for trees. Research Report 484, Institut National de Recherche en Informatique et en Automatique (INRIA), 1986. 7 pages. For published version, see [PF066].
[PF057] Philippe Flajolet and Helmut Prodinger. Register allocation for unary-binary trees. SIAM Journal on Computing, 15:629–640, 1986. For preliminary version, see [RR0266].
[PF058] Philippe Flajolet and Claude Puech. Partial match retrieval of multidimensional data. Journal of the ACM, 33:371–407, 1986. For preliminary versions, see [PF041, RR0233].
[PF059] Philippe Flajolet, Claude Puech, and Jean Vuillemin. The analysis of simple list struc- tures. Information Sciences, 38:121–146, 1986. For preliminary version, see [RR0241].
[PF060] Philippe Flajolet and Nasser Saheb. The complexity of generating an exponentially distributed variate. Journal of Algorithms, 7:463–488, 1986. For preliminary versions, see [PF042, RR0159].
[PF061] Philippe Flajolet and Robert Sedgewick. Digital search trees revisited. SIAM Journal on Computing, 15:748–767, 1986. For preliminary version, see [RR0311].
[PF062] Jean-Michel Autebert, Philippe Flajolet, and Joaquim Gabarr´o. Prefixes of infinite words and ambiguous context-free languages. Information Processing Letters, 25:211– 216, 1987. For preliminary version, see [RR0492].
[PF064] Philippe Flajolet. Analytic models and ambiguity of context-free languages. Theoretical Computer Science, 49:283–309, 1987. For preliminary versions, see [PF046, P08].
[PF063] Philippe Flajolet. Mathematical tools for automatic program analysis. Research Report 603, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 19 pages. The second portion of this version is subsumed by [PF047].
[RR0729] Philippe Flajolet. Random tree models in the analysis of algorithms. Research Report 729, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 17 pages. For published version, see [PF072].
[RR0758] Philippe Flajolet and Jean Fran¸con.Elliptic functions, continued fractions and doubled permutations. Research Report 758, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 8 pages. For published version, see [PF077].
17 [RR0720] Philippe Flajolet, Dani`eleGardy, and Lo¨ysThimonier. Birthday paradox, coupon col- lectors, caching algorithms and self-organizing search. Research Report 720, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 17 pages. For published version, see [PF100].
[PF065] Philippe Flajolet and Philippe Jacquet. Analytic models for tree communication pro- tocols. In Amedeo R. Odoni, Lucio Bianco, and Giorgio Szeg¨o,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, Berlin/Heidelberg, 1987. For preliminary version, see [RR0648].
[RR0648] Philippe Flajolet and Philippe Jacquet. Analytic models for tree communication pro- tocols. Research Report 648, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 12 pages. For published version, see [PF065].
[RR0719] Philippe Flajolet, Peter Kirschenhofer, and Robert Tichy. Deviations from normality in random strings. Research Report 719, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 11 pages. For published version, see [PF074].
[PF066] Philippe Flajolet and Helmut Prodinger. Level number sequences for trees. Discrete Mathematics, 65:149–156, 1987. For preliminary version, see [RR0484].
[PF067] Philippe Flajolet and Jean-Marc Steyaert. A complexity calculus for recursive tree algorithms. Mathematical Systems Theory, 19:301–331, 1987. For preliminary versions, see [PF031, P02, RR0239].
[PF068] Albert G. Greenberg, Philippe Flajolet, and Richard E. Ladner. Estimating the multi- plicities of conflicts to speed their resolution in multiple access channels. Journal of the ACM, 34:289–325, 1987. For preliminary version, see [RR0333].
[RR0718] Jeffrey Scott Vitter and Philippe Flajolet. Average-case analysis of algorithms and data structures. Research Report 718, Institut National de Recherche en Informatique et en Automatique (INRIA), 1987. 67 pages. For published version, see [PF091].
[PF071] Philippe Flajolet. Evaluation´ de protocoles de communication : aspects math´ematiques. Research Report 797, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 22 pages. Main lecture delivered at the Journ´eeannuelle de la Soci´et´e Math´ematiquede France, Paris, January 1988. Published version appears as [P03].
[P03] Philippe Flajolet. Evaluation´ de protocoles de communication : aspects math´ematiques. In Le Codage et la Transmission de l’Information : Journ´eeannuelle de la Soci´et´e Math´ematiquede France, pages 1–22. Soci´et´eMath´ematiquede France, 1988. For pre- liminary version, see [PF071].
[PF070] Philippe Flajolet. L’analyse d’algorithmes ou le risque calcul´e. In Conseil Scientifique de l’UAP (Union des Assurances de Paris), editor, Journ´eesScientifiques et Prix UAP 1985, 1986, 1987, pages 17–34. D´epartement des Services G´en´erauxde l’UAP, 1988. Text of 1986 Prize Award Lecture. For shorter version, see [PF099].
[PF069] Philippe Flajolet. Mathematical methods in the analysis of algorithms and data struc- tures. In Egon B¨orger,editor, Trends in Theoretical Computer Science, chapter 6, pages 225–304. Computer Science Press, Rockville, Maryland, 1988. Volume 12 in the series
18 “Principles of computer science;” Lecture Notes from 1984 for A Graduate Course in Computation Theory, Udine, Italy. For preliminary version, see [RR0400].
[PF072] Philippe Flajolet. Random tree models in the analysis of algorithms. In Pierre Jacques Courtois and Guy Latouche, editors, PERFORMANCE ’87: Proceedings of the 12th International Federation for Information Processing Working Group 7.3 (IFIP WG 7.3) International Symposium on Computer Performance Modelling, Measurement, and Eval- uation, pages 171–187. North-Holland, 1988. For preliminary version, see [RR0729].
[PF073] Philippe Flajolet, Dani`eleGardy, and Lo¨ysThimonier. Random allocations and proba- bilistic languages. In Timo Lepist¨oand Arto Salomaa, editors, Proceedings of the 15th In- ternational Colloquium on Automata, Languages and Programming (ICALP 88), volume 317 of Lecture Notes in Computer Science, pages 239–253. Springer, Berlin/Heidelberg, 1988. This version is subsumed by [PF100].
[PF074] Philippe Flajolet, Peter Kirschenhofer, and Robert F. Tichy. Deviations from unifor- mity in random strings. Probability Theory and Related Fields, 80:139–150, 1988. For preliminary version, see [RR0719].
[RR0888] Philippe Flajolet, Donald E. Knuth, and Boris Pittel. The first cycles in an evolving graph. Research Report 888, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 48 pages. For published version, see [PF078].
[RR0826] Philippe Flajolet and Andrew Odlyzko. Singularity analysis of generating functions. Research Report 826, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 25 pages. For published version, see [PF086].
[RR0876] Philippe Flajolet, Bruno Salvy, and Paul Zimmermann. Lambda-Upsilon-Omega: An assistant algorithms analyzer. Research Report 876, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 12 pages. For published version, see [PF079].
[RR0809] Philippe Flajolet and Mich`eleSoria. Gaussian limiting distributions for the number of components in combinatorial structures. Research Report 809, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 17 pages. For published version, see [PF088].
[RR0892] Dani`eleGardy, Philippe Flajolet, and Claude Puech. Average cost of orthogonal range queries in multiattribute trees. Research Report 892, Institut National de Recherche en Informatique et en Automatique (INRIA), 1988. 17 pages. For published version, see [PF082].
[PF075] Walter Cunto, Gustavo Lau, and Philippe Flajolet. Analysis of kdt-trees: kd-trees improved by local reorganisations. In Frank Dehne, J¨org-R¨udigerSack, and Nicola Santoro, editors, Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS ’89), volume 382 of Lecture Notes in Computer Science, pages 24–38. Springer, Berlin/Heidelberg, 1989.
[RR1025] Philippe Flajolet. On adaptive sampling. Research Report 1025, Institut National de Recherche en Informatique et en Automatique (INRIA), 1989. 11 pages. For published version, see [PF084].
19 [PF077] Philippe Flajolet and Jean Fran¸con.Elliptic functions, continued fractions and doubled permutations. European Journal of Combinatorics, 10:235–241, 1989. For preliminary version, see [RR0758].
[PF076] Philippe Flajolet, Peter Kirschenhofer, and Robert F. Tichy. Discrepancy of sequences in discrete spaces. In G´abor Hal´aszand Vera T. S´os,editors, Irregularities of Partitions, volume 8 of Algorithms and Combinatorics, pages 61–70. Springer, Berlin/Heidelberg, 1989. Papers from the meeting held at Fert¨od,Hungary.
[PF078] Philippe Flajolet, Donald E. Knuth, and Boris Pittel. The first cycles in an evolving graph. Discrete Mathematics, 75:167–215, 1989. For preliminary version, see [RR0888]. Reprinted as Chapter 40 of Selected Papers on Discrete Mathematics, by Donald E. Knuth (Stanford, CA: Center for the Study of Language and Information, 2003), 585– 642.
[RR1114] Philippe Flajolet and Andrew M. Odlyzko. Random mapping statistics. Research Report 1114, Institut National de Recherche en Informatique et en Automatique (INRIA), 1989. 26 pages. For published version, see [PF085].
[PF079] Philippe Flajolet, Bruno Salvy, and Paul Zimmermann. Lambda-Upsilon-Omega: An assistant algorithms analyzer. In Teo Mora, editor, Proceedings of the 6th Interna- tional Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-6), July 1988, volume 357 of Lecture Notes in Computer Science, pages 201– 212. Springer, Berlin/Heidelberg, 1989. For preliminary version, see [RR0876].
[PF080] Philippe Flajolet, Bruno Salvy, and Paul Zimmermann. Lambda-Upsilon-Omega: The 1989 CookBook. Research Report 1073, Institut National de Recherche en Informatique et en Automatique (INRIA), 1989. 116 pages.
[RR1066] Philippe Flajolet and Ren´eSchott. Non overlapping partitions, continued fractions, Bessel functions and a divergent series. Research Report 1066, Institut National de Recherche en Informatique et en Automatique (INRIA), 1989. 16 pages. For published version, see [PF087].
[RR1002] Philippe Flajolet and Mich`eleSoria. General combinatorial schemas with Gaussian limit distributions and exponential tails. Research Report 1002, Institut National de Recherche en Informatique et en Automatique (INRIA), 1989. 17 pages. For published version, see [PF112].
[PF082] Dani`ele Gardy, Philippe Flajolet, and Claude Puech. Average cost of orthogonal range queries in multiattribute trees. Information Systems, 14:341–350, 1989. For preliminary versions, see [PF081, RR0892].
[PF081] Dani`ele Gardy, Philippe Flajolet, and Claude Puech. On the performance of orthogonal range queries in multiattribute and doubly chained trees. In Frank Dehne, J¨org-R¨udiger Sack, and Nicola Santoro, editors, Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS ’89), volume 382 of Lecture Notes in Computer Science, pages 218–229. Springer, Berlin/Heidelberg, 1989. This version is subsumed by [PF082].
[PF083] Jean-Paul Allouche, Philippe Flajolet, and Michel Mend`esFrance. Algebraically in- dependent formal power series: A language theory interpretation. In Kenji Nagasaka
20 and Etienne Fouvry, editors, Proceedings of the Japanese-French Symposium on Analytic Number Theory, volume 1434 of Lecture Notes in Mathematics, pages 11–18. Springer, Berlin/Heidelberg, 1990.
[PF084] Philippe Flajolet. On adaptive sampling. Computing, 43:391–400, 1990. The article has volume 34 printed at the top, but it is actually contained in volume 43. For preliminary version, see [RR1025].
[RR1336] Philippe Flajolet, Gaston Gonnet, Claude Puech, and John Michael Robson. The analy- sis of multidimensional searching in quad–trees. Research Report 1336, Institut National de Recherche en Informatique et en Automatique (INRIA), 1990. 11 pages. For published version, see [PF093].
[PF086] Philippe Flajolet and Andrew Odlyzko. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics, 3:216–240, 1990. For preliminary version, see [RR0826].
[PF085] Philippe Flajolet and Andrew M. Odlyzko. Random mapping statistics. In Jean-Jacques Quisquater and Joos Vandewalle, editors, Advances in Cryptology–EUROCRYPT ’89; Proceedings of the Workshop on the Theory and Application of Cryptographic Tech- niques, volume 434 of Lecture Notes in Computer Science, pages 329–354. Springer, Berlin/Heidelberg, 1990. For preliminary version, see [RR1114].
[RR1233] Philippe Flajolet, Bruno Salvy, and Paul Zimmermann. Automatic average-case analysis of algorithms. Research Report 1233, Institut National de Recherche en Informatique et en Automatique (INRIA), 1990. 69 pages. For published version, see [PF094].
[PF087] Philippe Flajolet and Ren´eSchott. Non-overlapping partitions, continued fractions, Bessel functions and a divergent series. European Journal of Combinatorics, 11:421–432, 1990. For preliminary version, see [RR1066].
[PF089] Philippe Flajolet, Paolo Sipala, and Jean-Marc Steyaert. Analytic variations on the common subexpression problem. In Mike S. Paterson, editor, Proceedings of the 17th In- ternational Colloquium on Automata, Languages and Programming (ICALP 90), volume 443 of Lecture Notes in Computer Science, pages 220–234. Springer, Berlin/Heidelberg, 1990. For preliminary version, see [RR1210].
[RR1210] Philippe Flajolet, Paolo Sipala, and Jean-Marc Steyaert. Analytic variations on the common subexpression problem. Research Report 1210, Institut National de Recherche en Informatique et en Automatique (INRIA), 1990. 15 pages. For published version, see [PF089].
[PF088] Philippe Flajolet and Mich`eleSoria. Gaussian limiting distributions for the number of components in combinatorial structures. Journal of Combinatorial Theory, Series A, 53:165–182, 1990. For preliminary version, see [RR0809].
[PF090] Brigitte Vall´eeand Philippe Flajolet. The lattice reduction algorithm of Gauss: an average case analysis. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 830–839. IEEE Computer Society Press, 1990. For preliminary version, see [RR1277].
21 [RR1277] Brigitte Vall´eeand Philippe Flajolet. The lattice reduction algorithm of Gauss: an aver- age case analysis. Research Report 1277, Institut National de Recherche en Informatique et en Automatique (INRIA), 1990. 10 pages. For published version, see [PF090].
[PF091] Jeffrey Scott Vitter and Philippe Flajolet. Average-case analysis of algorithms and data structures. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 9, pages 431–524. North-Holland, Ams- terdam, 1990. For preliminary version, see [RR0718].
[PF092] Philippe Flajolet. P´olya festoons. Research Report 1507, Institut National de Recherche en Informatique et en Automatique (INRIA), 1991. 7 pages.
[PF093] Philippe Flajolet, Gaston Gonnet, Claude Puech, and John Michael Robson. The anal- ysis of multidimensional searching in quad–trees. In Proceedings of the Second Annual ACM–SIAM Symposium on Discrete Algorithms (SODA ’91), pages 100–109. 1991. This version is subsumed by [PF106]. For preliminary version, see [RR1336].
[RR1498] Philippe Flajolet, Peter Grabner, Peter Kirschenhofer, Helmut Prodinger, and Robert F. Tichy. Mellin transforms and asymptotics: digital sums. Research Report 1498, Institut National de Recherche en Informatique et en Automatique (INRIA), 1991. 23 pages. For published version, see [PF116].
[A01] Philippe Flajolet and Donald E. Knuth. Elementary problem E3415. American Math- ematical Monthly, 98:54, 1991. Method of solution given by Dean Alvis in American Mathematical Monthly 100:84–85, 1993.
[RR1423] Philippe Flajolet and Bruce Richmond. Generalized digital trees and their difference- differential equations. Research Report 1423, Institut National de Recherche en Infor- matique et en Automatique (INRIA), 1991. 15 pages. For published version, see [PF101].
[PF094] Philippe Flajolet, Bruno Salvy, and Paul Zimmermann. Automatic average-case analysis of algorithms. Theoretical Computer Science, 79:37–109, 1991. For preliminary version, see [RR1233].
[PF095] Philippe Flajolet and Mich`eleSoria. The cycle construction. SIAM Journal on Discrete Mathematics, 4:58–60, 1991.
[RR1434] Mamoru Hoshi and Philippe Flajolet. Page usage in quadtree indexes. Research Report 1434, Institut National de Recherche en Informatique et en Automatique (INRIA), 1991. 19 pages. For published version, see [PF103].
[PF096] Fran¸coisBergeron, Philippe Flajolet, and Bruno Salvy. Varieties of increasing trees. In Jean-Claude Raoult, editor, Proceedings of the 17th Colloquium on Trees in Algebra and Programming (CAAP ’92), volume 581 of Lecture Notes in Computer Science, pages 24–48. Springer, Berlin/Heidelberg, 1992. For preliminary version, see [RR1583].
[RR1583] Fran¸coisBergeron, Philippe Flajolet, and Bruno Salvy. Varieties of increasing trees. Re- search Report 1583, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. 25 pages. For published version, see [PF096].
[PF097] Philippe Flajolet. Analytic analysis of algorithms. In Werner Kuich, editor, Proceed- ings of the 19th International Colloquium on Automata, Languages and Programming
22 (ICALP 92), volume 623 of Lecture Notes in Computer Science, pages 186–210. Springer, Berlin/Heidelberg, 1992. For preliminary version, see [RR1644]. [RR1644] Philippe Flajolet. Analytic analysis of algorithms. Research Report 1644, Institut Na- tional de Recherche en Informatique et en Automatique (INRIA), 1992. 25 pages. For published version, see [PF097]. [PF102f] Philippe Flajolet. Arbres digitaux et ´equationsaux diff´erences(Seminar 23). In Philippe Flajolet and Paul Zimmermann, editors, Algorithms Seminar, 1991–1992, Research Re- port 1779, pages 119–124. Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 1992. Summary by Jean-Marc Steyaert. [PF099] Philippe Flajolet. Introduction `al’analyse d’algorithmes. Singularit´e, 3(5):5–16, May 1992. For expanded version, see [PF070]. [PF102c] Philippe Flajolet. Introduction aux fonctions holonomes en une variable (Seminar 8). In Philippe Flajolet and Paul Zimmermann, editors, Algorithms Seminar, 1991–1992, Research Report 1779, pages 41–45. Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. Summary by Mich`eleSoria. [PF098] Philippe Flajolet. La calculabilit´eet ses limites. In La Science au Pr´esent, volume 1, pages 216–218. Les Editions´ de l’Encyclopædia Universalis, Paris, 1992. [RR1749] Philippe Flajolet, Zhicheng Gao, Andrew Odlyzko, and Bruce Richmond. The distribu- tion of heights of binary trees and other simple trees. Research Report 1749, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. 12 pages. For published version, see [PF104]. [PF100] Philippe Flajolet, Dani`eleGardy, and Lo¨ysThimonier. Birthday paradox, coupon col- lectors, caching algorithms and self-organizing search. Discrete Applied Mathematics, 39:207–229, 1992. For preliminary version, see [PF073]. [RR1612] Philippe Flajolet and Mordecai Golin. Mellin transforms and asymptotics: The merge- sort recurrence. Research Report 1612, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. 11 pages. For published version, see [PF115]. [RR1760] Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, and Helmut Prodinger. On Ramanujan’s Q-function. Research Report 1760, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. 14 pages. For published version, see [PF121]. [PF101] Philippe Flajolet and Bruce Richmond. Generalized digital trees and their difference- differential equations. Random Structures & Algorithms, 3:305–320, 1992. For prelimi- nary version, see [RR1423]. [PF102a] Philippe Flajolet and Paul Zimmermann. Algorithms Seminar, 1991–1992. Research Re- port 1779, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. 192 pages. 6 page introduction by the editors to the algorithms seminar. [PF102b] Dominique Gouyou-Beauchamps. Enumeration of semi-standard Young tableaux (Sem- inar 1). In Philippe Flajolet and Paul Zimmermann, editors, Algorithms Seminar, 1991– 1992, Research Report 1779, pages 3–5. Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. Summary by Philippe Flajolet.
23 [PF102d] Dominique Gouyou-Beauchamps. Holonomic symmetric functions (Seminar 10). In Philippe Flajolet and Paul Zimmermann, editors, Algorithms Seminar, 1991–1992, Re- search Report 1779, pages 51–55. Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. Summary by Philippe Flajolet. [PF103] Mamoru Hoshi and Philippe Flajolet. Page usage in a quadtree index. BIT, 32:384–402, 1992. For preliminary version, see [RR1434]. [PF102e] Thomas Lafforgue. Limit distributions in quadtrees (Seminar 22). In Philippe Flajo- let and Paul Zimmermann, editors, Algorithms Seminar, 1991–1992, Research Report 1779, pages 113–117. Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. Summary by Philippe Flajolet. [S92-93c] Herv´eDaud´e. Ergodic theory and average case analysis of Euclid’s algorithm (Sem- inar 31). In Bruno Salvy, editor, Algorithms Seminar, 1992–1993, Research Report 2130, pages 151–152. Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. Summary by Philippe Flajolet. [S92-93b] Philippe Flajolet. Analytic analysis of algorithms (Seminar 23). In Bruno Salvy, editor, Algorithms Seminar, 1992–1993, Research Report 2130, pages 115–120. Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. Summary by Pierre Nicod`eme. [S92-93a] Philippe Flajolet. A calculus of random generation (Seminar 6). In Bruno Salvy, editor, Algorithms Seminar, 1992–1993, Research Report 2130, pages 33–37. Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. Summary by Xavier Gourdon. [PF108b] Philippe Flajolet. The Mellin transform technology. In Philippe Flajolet, Rainer Kemp, and Helmut Prodinger, editors, Average Case Analysis of Algorithms, Dagstuhl Seminar Report 68; Seminar Report 9328, page 10. Internationales Begegnungs und Forschungszentrum F¨urInformatik, Schloß Dagstuhl, 1993. [PF108c] Philippe Flajolet. Problem 7 (analytic methods for the variance and limiting distri- bution of the height of a random binary search tree). In Philippe Flajolet, Rainer Kemp, and Helmut Prodinger, editors, Average Case Analysis of Algorithms, Dagstuhl Seminar Report 68; Seminar Report 9328, page 25. Internationales Begegnungs und Forschungszentrum F¨urInformatik, Schloß Dagstuhl, 1993. [PF104] Philippe Flajolet, Zhicheng Gao, Andrew Odlyzko, and Bruce Richmond. The distribu- tion of heights of binary trees and other simple trees. Combinatorics, Probability and Computing, 2:145–156, 1993. For preliminary version, see [RR1749]. [PF105] Philippe Flajolet and Mordecai Golin. Exact asymptotics of divide-and-conquer re- currences. In Andrzej Lingas, Rolf Karlsson, and Svante Carlsson, editors, Proceed- ings of the 20th International Colloquium on Automata, Languages and Programming (ICALP 93), volume 700 of Lecture Notes in Computer Science, pages 137–149. Springer, Berlin/Heidelberg, 1993. This version is subsumed by [PF115]. [PF106] Philippe Flajolet, Gaston Gonnet, Claude Puech, and John Michael Robson. Analytic variations on quadtrees. Algorithmica, 10:473–500, 1993. For preliminary version, see [PF093].
24 [PF107] Philippe Flajolet, Xavier Gourdon, and Bruno Salvy. Sur une famille de polynˆomes issus de l’analyse num´erique. Gazette des Math´ematiciens, 55:67–78, January 1993. For preliminary version, see [RR1857].
[RR1857] Philippe Flajolet, Xavier Gourdon, and Bruno Salvy. Sur une famille de polynˆomes issus de l’analyse num´erique.Research Report 1857, Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. 12 pages. For published version, see [PF107].
[PF108a] Philippe Flajolet, Rainer Kemp, and Helmut Prodinger, editors. Average Case Analy- sis of Algorithms, Dagstuhl Seminar Report 68; Seminar Report 9328. Internationales Begegnungs und Forschungszentrum F¨urInformatik, Schloß Dagstuhl, 1993. 2 page introduction by the editors.
[RR1862] Philippe Flajolet and Thomas Lafforgue. Search costs in quadtrees and singularity perturbation asymptotics. Research Report 1862, Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. 25 pages. For published version, see [PF117].
[PF109] Philippe Flajolet and Bruno Salvy. A finite sum of products of binomial coefficients. SIAM Review, 35:645–646, 1993. Solution to Problem 92-18, by C. C. Grosjean, posed in SIAM Review, 34:649, 1992.
[PF111] Philippe Flajolet and Robert Sedgewick. The average case analysis of algorithms: Com- plex asymptotics and generating functions. Research Report 2026, Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. 100 pages. Preliminary material for the book [PF201].
[PF110] Philippe Flajolet and Robert Sedgewick. The average case analysis of algorithms: Count- ing and generating functions. Research Report 1888, Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. 116 pages. Preliminary material for the book [PF201].
[PF112] Philippe Flajolet and Mich`eleSoria. General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Mathematics, 114:159–180, 1993. For pre- liminary version, see [RR1002].
[RR1830] Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus for the random generation of combinatorial structures. Research Report 1830, Institut National de Recherche en Informatique et en Automatique (INRIA), 1993. 29 pages. For published version, see [PF119].
[PF113] Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus of random generation. In Thomas Lengauer, editor, Proceedings of the First Annual European Symposium on Algorithms (ESA ’93), volume 726 of Lecture Notes in Computer Science, pages 169–180. Springer, Berlin/Heidelberg, 1993. This version is subsumed by [PF119].
[PF114] Herv´eDaud´e,Philippe Flajolet, and Brigitte Vall´ee. An analysis of the Gaussian al- gorithm for lattice reduction. In Leonard M. Adleman and Ming-Deh Huang, edi- tors, Proceedings of the 1st International Symposium on Algorithmic Number Theory (ANTS-I), volume 877 of Lecture Notes in Computer Science, pages 144–158. Springer,
25 Berlin/Heidelberg, 1994. This version is subsumed by [PF132]. For preliminary version, see [RR2243].
[RR2243] Herv´eDaud´e,Philippe Flajolet, and Brigitte Vall´ee.An analysis of the Gaussian algo- rithm for lattice reduction. Research Report 2243, Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. 15 pages. For published version, see [PF114].
[RR2163] Philippe Dumas and Philippe Flajolet. Asymptotique des r´ecurrencesmahl´eriennes: le cas cyclotomique. Research Report 2163, Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. 23 pages. For published version, see [PF125].
[S93-94b] Philippe Flajolet. Asymptotic analysis of finite differences and Rice integrals (Sem- inar 12). In Bruno Salvy, editor, Algorithms Seminar, 1993–1994, Research Report 2381, pages 61–66. Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. Summary by Philippe Dumas and Dani`eleGardy.
[H01] Philippe Flajolet. Doctorate honoris causa from the “universit´elibre de bruxelles”., 1994.
[H02] Philippe Flajolet. Elected fellow of the european academy of sciences., 1994.
[PF115] Philippe Flajolet and Mordecai Golin. Mellin transforms and asymptotics: The merge- sort recurrence. Acta Informatica, 31:673–696, 1994. For preliminary versions, see [PF105, RR1612].
[RR2369] Philippe Flajolet, Xavier Gourdon, and Philippe Dumas. Mellin transforms and asymp- totics: Harmonic sums. Research Report 2369, Institut National de Recherche en Infor- matique et en Automatique (INRIA), 1994. 55 pages. For published version, see [PF120].
[PF116] Philippe Flajolet, Peter Grabner, Peter Kirschenhofer, Helmut Prodinger, and Robert F. Tichy. Mellin transforms and asymptotics: digital sums. Theoretical Computer Science, 123:291–314, 1994. For preliminary version, see [RR1498].
[RR2249] Philippe Flajolet, Gilbert Labelle, Louise Laforest, and Bruno Salvy. Hypergeomet- rics and the cost structure of quadtrees. Research Report 2249, Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. 26 pages. For published version, see [PF122].
[PF117] Philippe Flajolet and Thomas Lafforgue. Search costs in quadtrees and singularity perturbation asymptotics. Discrete & Computational Geometry, 12:151–175, 1994. For preliminary version, see [RR1862].
[PF118] Philippe Flajolet and Robert Sedgewick. The average case analysis of algorithms: Saddle point asymptotics. Research Report 2376, Institut National de Recherche en Informa- tique et en Automatique (INRIA), 1994. 55 pages. Preliminary material for the book [PF201].
[RR2231] Philippe Flajolet and Robert Sedgewick. Mellin transforms and asymptotics: Finite differences and Rice’s integrals. Research Report 2231, Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. 21 pages. For published version, see [PF124].
26 [PF119] Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132:1–35, 1994. For preliminary versions, see [PF113, RR1830].
[S93-94a] Emmanuel Roblet. Combinatorial interpretations of continued fractions (Seminar 1). In Bruno Salvy, editor, Algorithms Seminar, 1993–1994, Research Report 2381, pages 3–10. Institut National de Recherche en Informatique et en Automatique (INRIA), 1994. Summary by Philippe Flajolet.
[S94-95a] Vincent Blondel. Structured numbers (Seminar 5). In Bruno Salvy, editor, Algorithms Seminar, 1994–1995, Research Report 2669, pages 19–21. Institut National de Recherche en Informatique et en Automatique (INRIA), 1995. Summary by Philippe Flajolet.
[PF128b] Philippe Flajolet. Analytic variations on quadtrees. In Philippe Flajolet, Rainer Kemp, Helmut Prodinger, and Robert Sedgewick, editors, Average Case Analysis of Algorithms, Dagstuhl Seminar Report 119; Seminar Report 9527, page 10. Internationales Begeg- nungs und Forschungszentrum F¨urInformatik, Schloß Dagstuhl, 1995.
[PF120] Philippe Flajolet, Xavier Gourdon, and Philippe Dumas. Mellin transforms and asymp- totics: Harmonic sums. Theoretical Computer Science, 144:3–58, 1995. For preliminary version, see [RR2369].
[PF121] Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, and Helmut Prodinger. On Ramanujan’s Q-function. Journal of Computational and Applied Mathematics, 58:103– 116, 1995. For preliminary version, see [RR1760].
[PF128a] Philippe Flajolet, Rainer Kemp, Helmut Prodinger, and Robert Sedgewick, editors. Av- erage Case Analysis of Algorithms, Dagstuhl Seminar Report 119; Seminar Report 9527. Internationales Begegnungs und Forschungszentrum F¨urInformatik, Schloß Dagstuhl, 1995. 2 page introduction by the editors.
[PF122] Philippe Flajolet, Gilbert Labelle, Louise Laforest, and Bruno Salvy. Hypergeometrics and the cost structure of quadtrees. Random Structures & Algorithms, 7:117–144, 1995. For preliminary version, see [RR2249].
[PF123] Philippe Flajolet and Bruno Salvy. Computer algebra libraries for combinatorial struc- tures. Journal of Symbolic Computation, 20:653–671, 1995. For preliminary version, see [RR2497].
[RR2497] Philippe Flajolet and Bruno Salvy. Computer algebra libraries for combinatorial struc- tures. Research Report 2497, Institut National de Recherche en Informatique et en Automatique (INRIA), 1995. 18 pages. For published version, see [PF123].
[PF124] Philippe Flajolet and Robert Sedgewick. Mellin transforms and asymptotics: Finite differences and Rice’s integrals. Theoretical Computer Science, 144:101–124, 1995. For preliminary version, see [RR2231].
[U01] Philippe Flajolet and Brigitte Vall´ee. On the Gauss-Kuzmin-Wirsing constant, 1995. Unpublished manuscript. 5 pages.
[RR2798] Herv´eDaud´e,Philippe Flajolet, and Brigitte Vall´ee. An average-case analysis of the Gaussian algorithm for lattice reduction. Research Report 2798, Institut National de
27 Recherche en Informatique et en Automatique (INRIA), 1996. 30 pages. For published version, see [PF132].
[PF125] Philippe Dumas and Philippe Flajolet. Asymptotique des r´ecurrencesmahl´eriennes: le cas cyclotomique. Journal de Th´eoriedes Nombres de Bordeaux, 8:1–30, 1996. For preliminary version, see [RR2163].
[PF126] Philippe Flajolet. Analytic variations on quadtrees. In Notes of the Seminar on Proba- bilistic Methods in Algorithmics, number 5 in Quaderns, Centre de Recerca Matem`atica, pages 44–53. Barcelona, 1996. Summary written by Nicola Galesi. Lecture given by Philippe Flajolet on February 29, 1996.
[M01] Philippe Flajolet. Balls and urns, etc., 1996. From Studies in Automatic Combinatorics, Volume I. Maple, Postscript, and Html versions available at http://algo.inria.fr/ libraries/autocomb/autocomb.html. 22 pages.
[S95-96a] Philippe Flajolet. Euler sums (Seminar 4). In Bruno Salvy, editor, Algorithms Semi- nar, 1995–1996, Research Report 2992, pages 15–18. Institut National de Recherche en Informatique et en Automatique (INRIA), 1996. Summary by Jean-Paul Allouche.
[RR2997] Philippe Flajolet, Xavier Gourdon, and Conrado Mart´ınez. Patterns in random binary search trees. Research Report 2997, Institut National de Recherche en Informatique et en Automatique (INRIA), 1996. 23 pages. For published version, see [PF135].
[PF127] Philippe Flajolet, Xavier Gourdon, and Daniel Panario. Random polynomials and poly- nomial factorization. In Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Proceedings of the 23rd International Colloquium on Automata, Languages and Program- ming (ICALP 96), volume 1099 of Lecture Notes in Computer Science, pages 232–243. Springer, Berlin/Heidelberg, 1996. For preliminary version, see [RR2852].
[RR2852] Philippe Flajolet, Xavier Gourdon, and Daniel Panario. Random polynomials and poly- nomial factorization. Research Report 2852, Institut National de Recherche en Informa- tique et en Automatique (INRIA), 1996. 12 pages. For published version, see [PF127].
[RR2917] Philippe Flajolet and Bruno Salvy. Euler sums and contour integral representations. Re- search Report 2917, Institut National de Recherche en Informatique et en Automatique (INRIA), 1996. 23 pages. For published version, see [PF143].
[PF129] Philippe Flajolet and Robert Sedgewick. The average case analysis of algorithms: Mellin transform asymptotics. Research Report 2956, Institut National de Recherche en Infor- matique et en Automatique (INRIA), 1996. 93 pages.
[RR2931] Philippe Flajolet and Brigitte Vall´ee.Continued fraction algorithms, functional opera- tors, and structure constants. Research Report 2931, Institut National de Recherche en Informatique et en Automatique (INRIA), 1996. 33 pages. For published version, see [PF144].
[U02] Philippe Flajolet and Ilan Vardi. Zeta function expansions of classical constants, 1996. Unpublished manuscript. 10 pages. An updated version of “Numerical Evaluation of Euler Products”, 1990 and 1992, also unpublished.
28 [PF131] Robert Sedgewick and Philippe Flajolet. Introduction `al’analyse des algorithmes. Inter- national Thomson publishing France, 1996. Translation of [PF130] by Cyril Chabaud. 421 pages.
[PF130] Robert Sedgewick and Philippe Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley Publishing Company, 1996. 512 pages.
[RR3295] Julien Cl´ement, Philippe Flajolet, and Brigitte Vall´ee.The analysis of hybrid trie struc- tures. Research Report 3295, Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. 9 pages. For published version, see [PF140].
[RR3223] Edward G. Coffman, Philippe Flajolet, Leopold Flatto, and Micha Hofri. The maximum of a random walk and its application to rectangle packing. Research Report 3223, Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. 14 pages. For published version, see [PF141].
[PF132] Herv´eDaud´e,Philippe Flajolet, and Brigitte Vall´ee. An average-case analysis of the Gaussian algorithm for lattice reduction. Combinatorics, Probability and Computing, 6:397–433, 1997. For preliminary versions, see [PF114, RR2798].
[PF134] Philippe Flajolet. Adaptive sampling. In Michiel Hazewinkel, editor, Encyclopaedia of Mathematics, volume Supplement I, page 28. Kluwer Academic Publishers, Dordrecht, 1997.
[M03] Philippe Flajolet. Enumeration of planar configurations in combinatorial geometry, 1997. From Studies in Automatic Combinatorics, Volume I. Maple, Postscript, and Html versions available at http://algo.inria.fr/libraries/autocomb/autocomb. html. 11 pages.
[S96-97a] Philippe Flajolet. Patterns in random binary search trees (Seminar 14). In Bruno Salvy, editor, Algorithms Seminar, 1996–1997, Research Report 3267, pages 61–64. Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. Summary by Mich`eleSoria.
[M04] Philippe Flajolet. A problem in statistical classification theory, 1997. From Studies in Automatic Combinatorics, Volume I. Maple, Postscript, and Html versions available at http://algo.inria.fr/libraries/autocomb/autocomb.html. 13 pages.
[PF133] Philippe Flajolet. Review of Micha Hofri’s book “Analysis of Algorithms— Computational Methods and Mathematical Tools”. SIAM Review, 39:341–345, 1997.
[M02] Philippe Flajolet. A seating arrangement problem, 1997. From Studies in Automatic Combinatorics, Volume I. Maple, Postscript, and Html versions available at http:// algo.inria.fr/libraries/autocomb/autocomb.html. 11 pages.
[PF135] Philippe Flajolet, Xavier Gourdon, and Conrado Mart´ınez. Patterns in random binary search trees. Random Structures & Algorithms, 11:223–244, 1997. For preliminary ver- sion, see [RR2997].
[RR3196] Philippe Flajolet and Marc Noy. Analytic combinatorics of non-crossing configurations. Research Report 3196, Institut National de Recherche en Informatique et en Automa- tique (INRIA), 1997. 22 pages. For published version, see [PF149].
29 [RR3265] Philippe Flajolet, Patricio Poblete, and Alfredo Viola. On the analysis of linear probing hashing. Research Report 3265, Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. 22 pages. For published version, see [PF142].
[PF136] Philippe Flajolet and Bruno Salvy. The SIGSAM challenges: symbolic asymptotics in practice. ACM SIGSAM Bulletin, 31(4):36–47, December 1997. For preliminary version, see [RT0209].
[RT0209] Philippe Flajolet and Bruno Salvy. The SIGSAM challenges: symbolic asymptotics in practice. Technical Report 0209, Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. 12 pages. For published version, see [PF136].
[PF137] Philippe Flajolet and Robert Sedgewick. The average case analysis of algorithms: Multi- variate asymptotics and limit distributions. Research Report 3162, Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. 123 pages. Preliminary material for the book [PF201].
[PF138] Philippe Flajolet and Wojciech Szpankowski. Analysis of algorithms. Random Structures & Algorithms, 10:1–3, 1997. See also [PF139].
[PF139] Philippe Flajolet and Wojciech Szpankowski, editors. Random Structures & Algorithms, volume 10(1–2). 1997. Special issue devoted to the Average-Case Analysis of Algorithms, 303 pages. For preface, see [PF138].
[S96-97b] Helmut Prodinger. The analysis of multiple Quickselect (Seminar 17). In Bruno Salvy, editor, Algorithms Seminar, 1996–1997, Research Report 3267, pages 71–74. Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. Summary by Philippe Flajolet.
[S96-97c] Wojciech Szpankowski. Towards analytical information theory: recent results on Lempel- Ziv data compression schemes (Seminar 18). In Bruno Salvy, editor, Algorithms Semi- nar, 1996–1997, Research Report 3267, pages 75–80. Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. Summary by Philippe Flajolet.
[S96-97d] Brigitte Vall´ee. The dynamics of continued fractions with periodic constraints (Sem- inar 31). In Bruno Salvy, editor, Algorithms Seminar, 1996–1997, Research Report 3267, pages 131–134. Institut National de Recherche en Informatique et en Automatique (INRIA), 1997. Summary by Philippe Flajolet.
[S97-98b] Jean-Paul Allouche. On the transcendence of formal power series (Seminar 7). In Bruno Salvy, editor, Algorithms Seminar, 1997–1998, Research Report 3504, pages 31–34. Insti- tut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Philippe Flajolet.
[PF140] Julien Cl´ement, Philippe Flajolet, and Brigitte Vall´ee.The analysis of hybrid trie struc- tures. In Proceedings of the Ninth Annual ACM–SIAM Symposium on Discrete Algo- rithms (SODA ’98), pages 531–539. 1998. For preliminary version, see [RR3295].
[PF141] Edward G. Coffman, Philippe Flajolet, Leopold Flatto, and Micha Hofri. The maximum of a random walk and its application to rectangle packing. Probability in the Engineering and Informational Sciences, 12:373–386, 1998. For preliminary version, see [RR3223].
30 [M06] Philippe Flajolet. Constrained permutations and the principle of inclusion-exclusion, 1998. From Studies in Automatic Combinatorics, Volume II. Maple, Postscript, and Html versions available at http://algo.inria.fr/libraries/autocomb/autocomb. html. 23 pages.
[S97-98d] Philippe Flajolet. On the analysis of linear probing hashing (Seminar 25). In Bruno Salvy, editor, Algorithms Seminar, 1997–1998, Research Report 3504, pages 113–116. Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Hosam M. Mahmoud.
[M05] Philippe Flajolet. Robustness in random interconnection graphs (based on joint work with kostas hatzis, patras), 1998. From Studies in Automatic Combinatorics, Volume II. Maple, Postscript, and Html versions available at http://algo.inria.fr/libraries/ autocomb/autocomb.html. 21 pages.
[RR3401] Philippe Flajolet. Singularity analysis and asymptotics of Bernoulli sums. Research Re- port 3401, Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. 10 pages. For published version, see [PF148].
[RR3370] Philippe Flajolet, Xavier Gourdon, and Daniel Panario. The complete analysis of a polynomial factorization algorithm over finite fields. Research Report 3370, Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. 26 pages. For published version, see [PF163].
[PF142] Philippe Flajolet, Patricio Poblete, and Alfredo Viola. On the analysis of linear probing hashing. Algorithmica, 22:490–515, 1998. For preliminary version, see [RR3265].
[RR3373] Philippe Flajolet and Helmut Prodinger. On Stirling numbers for complex arguments and Hankel contours. Research Report 3373, Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. 5 pages. For published version, see [PF150].
[PF143] Philippe Flajolet and Bruno Salvy. Euler sums and contour integral representations. Experimental Mathematics, 7:15–35, 1998. For preliminary version, see [RR2917].
[RR3553] Philippe Flajolet and Wojciech Szpankowski. Analytic variations on redundancy rates of renewal processes. Research Report 3553, Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. 10 pages. For published version, see [PF173].
[PF144] Philippe Flajolet and Brigitte Vall´ee. Continued fraction algorithms, functional op- erators, and structure constants. Theoretical Computer Science, 194:1–34, 1998. For preliminary version, see [RR2931].
[S97-98f] Fabrice Guillemin. Birth-death processes, lattice path combinatorics, continued frac- tions, and orthogonal polynomials (Seminar 36). In Bruno Salvy, editor, Algorithms Sem- inar, 1997–1998, Research Report 3504, pages 159–164. Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Philippe Flajolet and Fabrice Guillemin.
[RR3399] Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, and Mireille R´egnier. Analytic variations on bucket selection and sorting. Research Report 3399, Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. 22 pages. For published version, see [PF159].
31 [S97-98c] R´emiMonasson. Statistical physics of the random graph model (Seminar 13). In Bruno Salvy, editor, Algorithms Seminar, 1997–1998, Research Report 3504, pages 57–62. Insti- tut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Philippe Flajolet.
[S97-98e] Daniel Panario. Smallest components in combinatorial structures (Seminar 26). In Bruno Salvy, editor, Algorithms Seminar, 1997–1998, Research Report 3504, pages 117– 122. Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Philippe Flajolet.
[PF145] Daniel Panario, Xavier Gourdon, and Philippe Flajolet. An analytic approach to smooth polynomials over finite fields. In Joe P. Buhler, editor, Proceedings of the 3rd Interna- tional Symposium on Algorithmic Number Theory (ANTS-III), volume 1423 of Lecture Notes in Computer Science, pages 226–236. Springer, Berlin/Heidelberg, 1998.
[ETC001] Helmut Prodinger and Wojciech Szpankowski. Philippe Flajolet’s research in analysis of algorithms and combinatorics. Algorithmica, 22:366–387, 1998.
[S97-98a] Mich`eleSoria and Philippe Flajolet. Coefficients of algebraic series (Seminar 6). In Bruno Salvy, editor, Algorithms Seminar, 1997–1998, Research Report 3504, pages 27– 30. Institut National de Recherche en Informatique et en Automatique (INRIA), 1998. Summary by Cyril Chabaud.
[PF146] Cyril Banderier, Mireille Bousquet-M´elou, Alain Denise, Philippe Flajolet, Dani`ele Gardy, and Dominique Gouyou-Beauchamps. On generating functions of generating trees. In Conrado Mart´ınez,Marc Noy, and Oriol Serra, editors, Proceedings of the 11th International Conference on Formal Power Series and Algebraic Combinatorics (FP- SAC ’99), pages 40–52. Universitat Polit`ecnicade Catalunya, 1999. For preliminary version, see [RR3661]. This version is subsumed by [PF167].
[RR3661] Cyril Banderier, Mireille Bousquet-M´elou, Alain Denise, Philippe Flajolet, Dani`ele Gardy, and Dominique Gouyou-Beauchamps. On generating functions of generating trees. Research Report 3661, Institut National de Recherche en Informatique et en Automatique (INRIA), 1999. 13 pages. For published version, see [PF146].
[RR3645] Julien Cl´ement, Philippe Flajolet, and Brigitte Vall´ee.Dynamical sources in information theory: A general analysis of trie structures. Research Report 3645, Institut National de Recherche en Informatique et en Automatique (INRIA), 1999. 61 pages. For published version, see [PF161].
[PF147] Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, and William Steiger. Prop- erties of random triangulations and trees. Discrete & Computational Geometry, 22:105– 117, 1999.
[L02] Philippe Flajolet. Random systems in combinatorics. Summer school on statistical physics and probabilistic methods in computer science, ICTP, Trieste, 1999. 19 pages.
[PF148] Philippe Flajolet. Singularity analysis and asymptotics of Bernoulli sums. Theoretical Computer Science, 215:371–381, 1999. For preliminary version, see [RR3401].
[RR3667] Philippe Flajolet and Fabrice Guillemin. The formal theory of birth-and-death processes, lattice path combinatorics, and continued fractions. Research report, Institut National
32 de Recherche en Informatique et en Automatique (INRIA), 1999. 23 pages. For published version, see [PF153].
[PF149] Philippe Flajolet and Marc Noy. Analytic combinatorics of non-crossing configurations. Discrete Mathematics, 204:203–229, 1999. Selected papers in honor of Henry W. Gould. For preliminary version, see [RR3196].
[PF150] Philippe Flajolet and Helmut Prodinger. On Stirling numbers for complex arguments and Hankel contours. SIAM Journal on Discrete Mathematics, 12:155–159, 1999. For preliminary version, see [RR3373].
[S98-99a] Bernhard Gittenberger. On random combinatorial structures and the local time of some Brownian functionals (Seminar 17). In Bruno Salvy, editor, Algorithms Seminar, 1998– 1999, Research Report 3830, pages 65–66. Institut National de Recherche en Informa- tique et en Automatique (INRIA), 1999. Summary by Philippe Flajolet.
[PF151] Pierre Nicod`eme,Bruno Salvy, and Philippe Flajolet. Motif statistics. In Jaroslav Neˇsetˇril, editor, Proceedings of the 7th Annual European Symposium on Algorithms (ESA ’99), volume 1643 of Lecture Notes in Computer Science, pages 194–211. Springer, Berlin/Heidelberg, 1999. This version is subsumed by [PF174]. For preliminary version, see [RR3606].
[RR3606] Pierre Nicod`eme,Bruno Salvy, and Philippe Flajolet. Motif statistics. Research Report 3606, Institut National de Recherche en Informatique et en Automatique (INRIA), 1999. 13 pages. For published version, see [PF151].
[F01] Dan A. Simovici and Richard L. Tenney. Theory of formal languages with applications. World Scientific, River Edge, NJ, USA, 1999. With a 1-page preface by Philippe Flajolet.
[S98-99b] Ilan Vardi. Continued fractions from Euclid till present (Seminar 25). In Bruno Salvy, editor, Algorithms Seminar, 1998–1999, Research Report 3830, pages 89–96. Institut National de Recherche en Informatique et en Automatique (INRIA), 1999. Summary by Philippe Flajolet.
[S99-00a] Ali Akhavi. Threshold phenomena in random lattices and reduction algorithms (Semi- nar 13). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 1999–2000, Research Report 4056, pages 53–55. Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. Summary by Philippe Flajolet.
[S99-00c] Jean-Paul Allouche. Transcendence of numbers whose expansion in base b or into con- tinued fractions is “too regular” (Seminar 20). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 1999–2000, Research Report 4056, pages 89–92. Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. Summary by Philippe Flajolet.
[PF152] Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Mich`eleSoria. Planar maps and Airy phenomena. In Ugo Montanari, Jos´eD.P. Rolim, and Emo Welzl, editors, Proceed- ings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 388–402. Springer, Berlin/Heidelberg, 2000. This version is subsumed by [PF160].
33 [S99-00b] Philippe Flajolet. Continued fractions, comparison algorithms and fine structure con- stants (Seminar 18). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 1999–2000, Re- search Report 4056, pages 81–82. Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. Summary by Cyril Banderier. [PF153] Philippe Flajolet and Fabrice Guillemin. The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions. Advances in Applied Probability, 32:750–778, 2000. For preliminary version, see [RR3667]. [RR4069] Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, and Paul Spirakis. On the robust- ness of interconnections in random graphs: a symbolic approach. Research report, Insti- tut National de Recherche en Informatique et en Automatique (INRIA), 2000. 21 pages. For published version, see [PF172]. [PF154] Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, and Paul Spirakis. Trade-offs be- tween density and robustness in random interconnection graphs. In Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, and Takayasu Ito, editors, Theoret- ical Computer Science: Exploring New Frontiers of Theoretical Informatics; Proceedings of the 1st International Federation for Information Processing International Conference on Theoretical Computer Science (IFIP TCS 2000), volume 1872 of Lecture Notes in Computer Science, pages 152–168. Springer, Berlin/Heidelberg, 2000. This version is subsumed by [PF172]. [PF155] Philippe Flajolet and Marc Noy. Analytic combinatorics of chord diagrams. In Daniel Krob, Alexander A. Mikhalev, and Alexander V. Mikhalev, editors, Proceedings of the 12th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC ’00), pages 191–201. Moscow State University, 2000. For preliminary version, see [RR3914]. [RR3914] Philippe Flajolet and Marc Noy. Analytic combinatorics of chord diagrams. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. 9 pages. For published version, see [PF155]. [PF156] Philippe Flajolet and Wojciech Szpankowski. Analytic variations on the redundancy rate of renewal processes. In Proceedings of the 2000 IEEE International Symposium on Information Theory, page 499. IEEE Information Theory Society, 2000. This version is subsumed by [PF173]. [PF157] Philippe Flajolet and Brigitte Vall´ee.Continued fractions, comparison algorithms, and fine structure constants. In Michel A. Th´era,editor, Constructive, experimental, and nonlinear analysis, volume 27 of Conference Proceedings, Canadian Mathematical So- ciety, pages 53–82. American Mathematical Society, Providence, RI, USA, 2000. For preliminary versions, see [RR4072, TR001]. [RR4072] Philippe Flajolet and Brigitte Vall´ee.Continued fractions, comparison algorithms, and fine structure constants. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. 30 pages. For published version, see [PF157]. [PF158] John Kieffer, Philippe Flajolet, and En-Hui Yang. Data compression via binary decision diagrams. In Proceedings of the 2000 IEEE International Symposium on Information Theory, page 296. IEEE Information Theory Society, 2000. See also unpublished memoir [U03].
34 [U03] John Kieffer, Philippe Flajolet, and En-Hui Yang. Universal lossless data compression via binary decision diagrams. Unpublished memoir, 2000. 21 pages. For preliminary version, see [PF158].
[PF159] Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, and Mireille R´egnier. Analytic variations on bucket selection and sorting. Acta Informatica, 36:735–760, 2000. For preliminary version, see [RR3399].
[S99-00e] Wojciech Szpankowski. Analytic information theory and the redundancy rate problem (Seminar 29). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 1999–2000, Research Report 4056, pages 133–136. Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 2000. Summary by Philippe Flajolet.
[S99-00d] Jean Vuillemin. Synchronous decision diagrams: a data structure for representing finite sequential digital functions (Seminar 22). In Fr´ed´ericChyzak, editor, Algorithms Sem- inar, 1999–2000, Research Report 4056, pages 97–107. Institut National de Recherche en Informatique et en Automatique (INRIA), 2000. Summary by Philippe Dumas and Philippe Flajolet.
[TR006] Cyril Banderier, Mireille Bousquet-M´elou, Alain Denise, Philippe Flajolet, Dani`ele Gardy, and Dominique Gouyou-Beauchamps. Generating functions for generating trees. Technical Report ALCOMFT-TR-01-17, ALCOM Project, 2001. For published version, see [PF167].
[TR009] Cyril Banderier and Philippe Flajolet. Basic analytic combinatorics of directed lattice paths. Technical Report ALCOMFT-TR-01-188, ALCOM Project, 2001. 39 pages. For published version, see [PF168].
[PF160] Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Mich`eleSoria. Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Structures & Algorithms, 19:194–246, 2001. For preliminary versions, see [PF152, TR007].
[TR007] Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Mich`ele Soria. Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Technical Report ALCOMFT-TR-01-20, ALCOM Project, 2001. For published version, see [PF160].
[P04] Philippe Chassaing and Philippe Flajolet. Hachage, arbres, chemins, et graphes. Bulletin de Probabilit´es,Universit´eParis VI, 5:1–17, 2001. This version is subsumed by [PF175].
[PF161] Julien Cl´ement, Philippe Flajolet, and Brigitte Vall´ee. Dynamical sources in informa- tion theory: A general analysis of trie structures. Algorithmica, 29:307–369, 2001. For preliminary version, see [RR3645].
[TR010] Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Random sam- pling from Boltzmann principles. Technical Report ALCOMFT-TR-01-189, ALCOM Project, 2001. 12 pages. For published version, see [PF170].
[PF162] Philippe Flajolet. D · E · K = (100)8. Random Structures & Algorithms, 19:150–162, 2001.
[I01] Philippe Flajolet. Trois questions `aPhilippe Flajolet. In Hebdo, 29. Association Fran¸caise des Sciences et Technologies de l’Information, 2001.
35 [PF163] Philippe Flajolet, Xavier Gourdon, and Daniel Panario. The complete analysis of a polynomial factorization algorithm over finite fields. Journal of Algorithms, 40:37–81, 2001. For preliminary versions, see [RR3370, TR002].
[TR002] Philippe Flajolet, Xavier Gourdon, and Daniel Panario. The complete analysis of a polynomial factorization algorithm over finite fields. Technical Report ALCOMFT-TR- 01-2, ALCOM Project, 2001. For published version, see [PF163].
[PF164] Philippe Flajolet, Yves Guivarc’h, Wojciech Szpankowski, and Brigitte Vall´ee. Hidden pattern statistics. In Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, editors, Proceedings of the 28th International Colloquium on Automata, Languages and Program- ming (ICALP 2001), volume 2076 of Lecture Notes in Computer Science, pages 152–165. Springer, Berlin/Heidelberg, 2001. For preliminary version, see [TR008]. This version is subsumed by [PF191].
[TR008] Philippe Flajolet, Yves Guivarc’h, Wojciech Szpankowski, and Brigitte Vall´ee. Hidden pattern statistics. Technical Report ALCOMFT-TR-01-43, ALCOM Project, 2001. For published version, see [PF164].
[TR004] Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, and Paul Spirakis. On the ro- bustness of interconnections in random graphs: a symbolic approach. Technical Report ALCOMFT-TR-01-11, ALCOM Project, 2001. For published version, see [PF172].
[PF165] Philippe Flajolet and Guy Louchard. Analytic variations on the Airy distribution. Al- gorithmica, 31:361–377, 2001. For preliminary version, see [TR005].
[TR005] Philippe Flajolet and Guy Louchard. Analytic variations on the Airy distribution. Tech- nical Report ALCOMFT-TR-01-15, ALCOM Project, 2001. For published version, see [PF165].
[TR003] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics: Functional equations—rational and algebraic functions. Technical Report ALCOMFT-TR-01-8, ALCOM Project, 2001. 98 pages. Preliminary material for the book [PF201].
[PF166] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics: Functional equations, rational and algebraic functions. Research Report 4103, Institut National de Recherche en Informatique et en Automatique (INRIA), 2001. 98 pages. Preliminary material for the book [PF201].
[TR001] Philippe Flajolet and Brigitte Vall´ee.Continued fractions, comparison algorithms, and fine structure constants. Technical Report ALCOMFT-TR-01-1, ALCOM Project, 2001. For published version, see [PF157].
[F02] Wojciech Szpankowski. Average case analysis of algorithms on sequences. Wiley, New York, NY, USA, 2001. With a 2-page foreword by Philippe Flajolet.
[PF167] Cyril Banderier, Mireille Bousquet-M´elou, Alain Denise, Philippe Flajolet, Dani`ele Gardy, and Dominique Gouyou-Beauchamps. Generating functions for generating trees. Discrete Mathematics, 246:29–55, 2002. Special issue on Proceedings of the 11th Inter- national Conference on Formal Power Series and Algebraic Combinatorics (FPSAC ’99). For preliminary versions, see [PF146, TR006].
36 [PF168] Cyril Banderier and Philippe Flajolet. Basic analytic combinatorics of directed lattice paths. Theoretical Computer Science, 281:37–80, 2002. For preliminary version, see [TR009]. [RR4579] Alin Bostan, Philippe Flajolet, Bruno Salvy, and Eric´ Schost. Fast computation with two algebraic numbers. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), 2002. 20 pages. For published version, see [PF185]. [PF169] Brigitte Chauvin, Philippe Flajolet, Dani`eleGardy, and Abdelkader Mokkadem, editors. Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabil- ities. Trends in Mathematics. Birkh¨auserVerlag, Basel, 2002. 560 pages. Proceedings of the 2nd International Colloquium of Mathematics and Computer Science, held at University of Versailles-St-Quentin, 3 page introduction by the editors. [S00-01a] Amir Dembo. Asymptotics for random combinatorial structures (Seminar 8). In Fr´ed´eric Chyzak, editor, Algorithms Seminar, 2000–2001, Research Report 4406, pages 39–44. In- stitut National de Recherche en Informatique et en Automatique (INRIA), 2002. Sum- mary by Philippe Flajolet. [PF170] Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Random sam- pling from Boltzmann principles. In Peter Widmayer, Stephan Eidenbenz, Francisco Triguero, Rafael Morales, Ricardo Conejo, and Matthew Hennessy, editors, Proceed- ings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), volume 2380 of Lecture Notes in Computer Science, pages 501–513. Springer, Berlin/Heidelberg, 2002. This version is subsumed by [PF179]. For prelimi- nary version, see [TR010]. [PF171] Philippe Flajolet. Singular combinatorics. In Li Tatsien, editor, Proceedings of the In- ternational Congress of Mathematicians (ICM-2002), volume III, pages 561–571. World Scientific, 2002. [S00-01b] Philippe Flajolet. Symbolic enumerative combinatorics and complex asymptotic analy- sis (Seminar 33). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 2000–2001, Research Report 4406, pages 161–170. Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 2002. Summary by Yvan Le Borgne. [PF172] Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, and Paul Spirakis. On the robust- ness of interconnections in random graphs: a symbolic approach. Theoretical Computer Science, 287:515–534, 2002. For preliminary versions, see [PF154, RR4069, TR004]. [RR4581] Philippe Flajolet, Bruno Salvy, and Gilles Schaeffer. Airy phenomena and analytic combinatorics of connected graphs. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), 2002. 25 pages. For published version, see [PF181]. [TR013] Philippe Flajolet, Bruno Salvy, and Gilles Schaeffer. Airy phenomena and analytic combinatorics of connected graphs. Technical Report ALCOMFT-TR-02-143, ALCOM Project, 2002. 25 pages. For published version, see [PF181]. [TR011] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics: Symbolic combina- torics. Technical Report ALCOMFT-TR-02-123, ALCOM Project, 2002. 186 pages. Preliminary material for the book [PF201].
37 [PF173] Philippe Flajolet and Wojciech Szpankowski. Analytic variations on redundancy rates of renewal processes. IEEE Transactions on Information Theory, 48:2911–2921, 2002. For preliminary versions, see [PF156, RR3553].
[TR012] Philippe Flajolet, Wojciech Szpankowski, and Brigitte Vall´ee. Hidden word statistics. Technical Report ALCOMFT-TR-02-142, ALCOM Project, 2002. 34 pages. For pub- lished version, see [PF191].
[PF174] Pierre Nicod`eme,Bruno Salvy, and Philippe Flajolet. Motif statistics. Theoretical Com- puter Science, 287:593–617, 2002. For preliminary version, see [PF151].
[PF175] Philippe Chassaing and Philippe Flajolet. Hachage, arbres, chemins & graphes. Gazette des Math´ematiciens, 95:29–49, January 2003. For preliminary version, see [P04].
[TR014] Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Technical Report ALCOMFT-TR-03-15, ALCOM Project, 2003. 44 pages. For published version, see [PF179].
[TR017] Marianne Durand and Philippe Flajolet. Loglog counting of large cardinalities. Technical Report ALCOMFT-TR-03-18, ALCOM Project, 2003. 13 pages. For published version, see [PF176].
[PF176] Marianne Durand and Philippe Flajolet. Loglog counting of large cardinalities. In Giuseppe Di Battista and Uri Zwick, editors, Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), volume 2832 of Lecture Notes in Computer Sci- ence, pages 605–617. Springer, Berlin/Heidelberg, 2003. For preliminary version, see [TR017].
[TR016] James Allen Fill, Philippe Flajolet, and Nevin Kapur. Singularity analysis, Hadamard products, and tree recurrences. Technical Report ALCOMFT-TR-03-17, ALCOM Project, 2003. 47 pages. For published version, see [PF182].
[S01-02a] Philippe Flajolet. Random generation from Boltzmann principles (Seminar 4). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 2001–2002, Research Report 5003, pages 17–18. Institut National de Recherche en Informatique et en Automatique (INRIA), 2003. Summary by Maryse Pelletier and Mich`eleSoria.
[TR015] Philippe Flajolet, Joaquim Gabarr´o,and Helmut Pekari. Analytic urns. Technical Report ALCOMFT-TR-03-16, ALCOM Project, 2003. 52 pages. For published version, see [PF183].
[TR018] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics: Basic complex asymp- totics. Technical Report ALCOMFT-TR-03-100, ALCOM Project, 2003. 133 pages. Preliminary material for the book [PF201].
[PF177] Brigitte Chauvin, Philippe Flajolet, Dani`eleGardy, and Bernhard Gittenberger. And/Or trees revisited. Combinatorics, Probability and Computing, 13:475–497, 2004.
[PF178] Michael Drmota, Philippe Flajolet, Dani`eleGardy, and Bernhard Gittenberger, editors. Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Proba- bilities. Trends in Mathematics. Birkh¨auserVerlag, Basel, 2004. 554 pages. Proceedings
38 of the 3rd International Colloquium of Mathematics and Computer Science, held at Technische Universit¨atWien. 3 page introduction by the editors.
[PF179] Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Proba- bility and Computing, 13:577–625, 2004. For preliminary versions, see [PF170, TR014].
[PF044b] Philippe Flajolet. Calcul, math´ematique. In Encyclopædia Universalis. Ency- clopædia Universalis, 2004. Available electronically at http://www.universalis.fr/ encyclopedie/calcul-mathematique/.
[PF180] Philippe Flajolet. Counting by coin tossings. In Michael J. Maher, editor, Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making; Proceedings of the 9th Asian Computing Science Conference; Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, volume 3321 of Lecture Notes in Computer Science, pages 1–12. Springer, Berlin/Heidelberg, 2004.
[PF181] Philippe Flajolet, Bruno Salvy, and Gilles Schaeffer. Airy phenomena and analytic com- binatorics of connected graphs. Electronic Journal of Combinatorics, 11(1)(#R34):1–30, 2004. For preliminary versions, see [RR4581, TR013].
[PF182] James Allen Fill, Philippe Flajolet, and Nevin Kapur. Singularity analysis, Hadamard products, and tree recurrences. Journal of Computational and Applied Mathematics, 174:271–313, 2005. For preliminary version, see [TR016].
[S02-04a] Philippe Flajolet. Analytic urns (Seminar 10). In Fr´ed´ericChyzak, editor, Algorithms Seminar, 2002–2004, Research Report 5542, pages 55–60. Institut National de Recherche en Informatique et en Automatique (INRIA), 2005. Summary by Pierre Nicod`eme.
[S2005] Philippe Flajolet. The Fermat cubic, elliptic functions, continued fractions, and a com- binatorial tale (Algorithms Seminar). Institut National de Recherche en Informatique et en Automatique (INRIA), 2005. Joint work with Eric Conrad. 42 pages.
[PF183] Philippe Flajolet, Joaquim Gabarr´o,and Helmut Pekari. Analytic urns. Annals of Probability, 33:1200–1233, 2005. For preliminary version, see [TR015].
[PF184] Philippe Flajolet, Stefan Gerhold, and Bruno Salvy. On the non-holonomic character of logarithms, powers, and the nth prime function. Electronic Journal of Combinatorics, 11(2)(#A2):1–16, 2005.
[P05] G´erardHuet and Philippe Flajolet. Math´ematiqueset informatique. In Jean-Cristophe Yoccoz, editor, Les math´ematiquesdans le monde scientifique contemporain, volume 20 of Rapport sur la science et la technologie, pages 215–237. Acad´emiedes sciences, Paris, 2005.
[PF185] Alin Bostan, Philippe Flajolet, Bruno Salvy, and Eric´ Schost. Fast computation of special resultants. Journal of Symbolic Computation, 41:1–29, 2006. For preliminary version, see [RR4579].
[PF186] Eric van Fossen Conrad and Philippe Flajolet. The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion. S´eminaire Lotharingien de Combi- natoire, 54(B54g):1–44, 2006. The Viennot Festschrift.
39 [S2006] Philippe Flajolet. Boltzmann sampling and random generation of combinatorial struc- tures (Algorithms Seminar). Institut National de Recherche en Informatique et en Au- tomatique (INRIA), 2006. Based on joint works with Philippe Duchon, Eric´ Fusy, Guy Louchard, Carine Pivoteau, and Gilles Schaeffer. [PF023b] Philippe Flajolet. Combinatorial aspects of continued fractions. Discrete Mathematics, 306:992–1021, 2006. 35th Special Anniversary Issue. Reprint of the original 1980 version. See [PF023a]. [PF187] Philippe Flajolet. The ubiquitous digital tree. In Bruno Durand and Wolfgang Thomas, editors, Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2006), volume 3884 of Lecture Notes in Computer Science, pages 1–22. Springer, Berlin/Heidelberg, 2006. [PF188] Philippe Flajolet, Philippe Dumas, and Vincent Puyhaubert. Some exactly solvable models of urn process theory. In Philippe Chassaing, editor, Fourth Colloquium on Mathematics and Computer Science, volume AG of DMTCS Proceedings, pages 59–118. 2006. [PF189] Philippe Flajolet, Eric´ Fusy, Xavier Gourdon, Daniel Panario, and Nicolas Pouyanne. A hybrid of Darboux’s method and singularity analysis in combinatorial asymptotics. Electronic Journal of Combinatorics, 13(#R103):1–35, 2006. [PF190] Philippe Flajolet, Markus Nebel, and Helmut Prodinger. The scientific works of Rainer Kemp (1949–2004). Theoretical Computer Science, 355:371–381, 2006. [PF191] Philippe Flajolet, Wojciech Szpankowski, and Brigitte Vall´ee. Hidden word statistics. Journal of the ACM, 53:147–183, 2006. For preliminary versions, see [PF164, TR012]. [U04] Vincent Dumas, Philippe Flajolet, Philippe Robert, and Roberto Tauraso. Coupon collection with group drawings. Unpublished memoir, 2007. 9 pages. [PF192] Philippe Flajolet. Analytic combinatorics—a calculus of discrete structures. In Pro- ceedings of the Eighteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA ’07), pages 137–148. 2007. [S2007] Philippe Flajolet. Comptages probabilistes, de l’analyse aux programmes (Algorithms Seminar). Institut National de Recherche en Informatique et en Automatique (INRIA), 2007. [PF193] Philippe Flajolet, Eric´ Fusy, Olivier Gandouet, and Fr´ed´ericMeunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Philippe Jacquet, editor, Proceedings of the 2007 Conference on Analysis of Algorithms (AofA ’07), volume AH of DMTCS Proceedings, pages 127–146. 2007. [PF194] Philippe Flajolet, Eric´ Fusy, and Carine Pivoteau. Boltzmann sampling of unlabelled structures. In David L. Applegate, Gerth Stølting Brodal, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO ’07), pages 201–211. SIAM, 2007. [PF195] Nicolas Broutin and Philippe Flajolet. The height of random binary unlabelled trees. In Uwe R¨osler,editor, Fifth Colloquium on Mathematics and Computer Science, volume AI of DMTCS Proceedings, pages 121–134. 2008. This version is subsumed by [PF206].
40 [CP03] Philippe Flajolet. Colloquium for Philippe Flajolet’s 60th birthday, 2008. (Conference Poster.) Paris, France, 1–2 December 2008.
[PF196] Philippe Flajolet and Thierry Huillet. Analytic combinatorics of the Mabinogion urn. In Uwe R¨osler,editor, Fifth Colloquium on Mathematics and Computer Science, volume AI of DMTCS Proceedings, pages 549–571. 2008.
[PF197] Philippe Flajolet and Linas Vepstas. On differences of zeta values. Journal of Compu- tational and Applied Mathematics, 220:58–73, 2008.
[PF198] Mikl´osB´onaand Philippe Flajolet. Isomorphism and symmetries in random phylogenetic trees. Journal of Applied Probability, 46:1005–1019, 2009.
[PF199] Y. K. Cheung, Philippe Flajolet, Mordecai Golin, and C. Y. James Lee. Multidimen- sional divide-and-conquer and weighted digital sums (extended abstract). In Conrado Mart´ınezand Robert Sedgewick, editors, Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO ’09), pages 58–65. SIAM, 2009.
[C01] Philippe Flajolet. A happy new year, 2009. See also one page supplement, “A Happy New Year” [PF203b] from 2010.
[S2009] Philippe Flajolet. Pseudo-factorials, elliptic functions & continued fractions (Algorithms Seminar). Institut National de Recherche en Informatique et en Automatique (INRIA), 2009. Joint work with Roland Bacher. 41 pages.
[PF201] Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009. xiv+810 pages. Also available electronically from the authors’ home pages. For preliminary versions, see [PF110, PF111, PF118, PF137, PF166, TR003, TR011, TR018].
[PF202] Brigitte Vall´ee, Julien Cl´ement, James Allen Fill, and Philippe Flajolet. The num- ber of symbol comparisons in QuickSort and QuickSelect. In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, and Wolfgang Thomas, editors, Proceedings of the 36th International Colloquium on Automata, Languages and Program- ming: Part I (ICALP 2009), volume 5555 of Lecture Notes in Computer Science, pages 750–763. Springer, Berlin/Heidelberg, 2009.
[PF203a] Roland Bacher and Philippe Flajolet. Pseudo-factorials, elliptic functions, and continued fractions. Ramanujan Journal, 21:71–97, 2010. See also one page supplement, “A Happy New Year” [PF203b].
[PF204] Nicholas R. Beaton, Philippe Flajolet, and Anthony J. Guttmann. The unusual asymp- totics of three-sided prudent polygons. Journal of Physics A: Mathematical and Theo- retical, 43(34):342001, 10pp, 2010.
[R04] Mikl´osB´ona. Review of Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick. ACM SIGACT News, 41(2):11–14, June 2010.
[PF203b] Philippe Flajolet. A happy new year, 2010. A one page follow up to [PF203a]. See also one page supplement, “A Happy New Year” [C01] from 2009.
[CP02] Philippe Flajolet. Three lectures, 2010. (Conference Poster.) Taiwan, 8–11 March 2010.
41 [PF207] Philippe Flajolet, Stefan Gerhold, and Bruno Salvy. Lindel¨ofrepresentations and (non-)holonomic sequences. Electronic Journal of Combinatorics, 17(#R3):1–28, 2010. [PF208] Philippe Flajolet, Mathieu Roux, and Brigitte Vall´ee. Digital trees and memoryless sources: from arithmetics to analysis. In Michael Drmota and Bernhard Gittenberger, ed- itors, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Meth- ods in the Analysis of Algorithms (AofA ’10), volume AM of DMTCS Proceedings, pages 233–260. 2010. [R03] Robin Pemantle. Review of Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick. SIAM Review, 52:572–576, 2010. [P06] Nicholas R. Beaton, Philippe Flajolet, and Anthony J. Guttmann. The enumeration of prudent polygons by area and its unusual asymptotics. Journal of Combinatorial Theory, Series A, 118:2261–2290, 2011. [PF205] Pawel Blasiak and Philippe Flajolet. Combinatorial models of creation-annihilation. S´eminaire Lotharingien de Combinatoire, 65(B65c):1–78, 2011. [O11] Alin Bostan, Nicolas Broutin, Fr´ed´ericChyzak, , Virginie Collette, Philippe Dumas, and Bruno Salvy. Philippe Flajolet chez ALGO. Gazette des Math´ematiciens, 129:115–116, July 2011. [PF206] Nicolas Broutin and Philippe Flajolet. The distribution of height and diameter in random non-plane binary trees, May 2011. To appear; arXiv:1009.1515v2, arXiv. 34 pages. For preliminary version, see [PF195]. [O10] Brigitte Chauvin, Bruno Salvy, Mich`ele,and Brigitte Vall´ee. Philippe Flajolet, le fon- dateur de la combinatoire analytique. Gazette des Math´ematiciens, 129:113–114, July 2011. [O12] Luc Devroye. My friend. Gazette des Math´ematiciens, 129:116–117, July 2011. [CP01] Philippe Flajolet. Philippe flajolet and analytic combinatorics, 2011. (Conference Poster.) Paris, France, 14–16 December 2011. [PF200] Philippe Flajolet, Maryse Pelletier, and Mich`eleSoria. On Buffon machines and num- bers. In Proceedings of the Twenty-Second Annual ACM–SIAM Symposium on Discrete Algorithms (SODA ’11), pages 172–183. 2011. [O02] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee.In memoriam: Philippe Flajolet, the father of analytic combinatorics. Random Structures & Algorithms, 39:iii–iv, 2011. [O03] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Obituary. Philippe Flajolet. Journal of Symbolic Computation, 46:1085–1086, 2011. [O06] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Obituary. Philippe Flajolet (1948–2011), the father of analytic combinatorics. Bulletin of the European Association for Theoretical Computer Science (EATCS), 104:16–18, 2011. [O09] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, 1 december 1948–22 march 2011. Combinatorics, Probability and Computing, 20:647–649, 2011.
42 [O01] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics. DMTCS Proceedings, AO:1–2, 2011.
[O04] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics. Theoretical Computer Science, 412:4469–4470, 2011.
[O05] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics. Algorithmica, Online First:1–2, 2011.
[O07] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics. ACM Communications in Com- puter Algebra, 45:90–91, 2011.
[O15] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics. ACM Transactions on Algo- rithms, 7(Article 40), 2011.
[O08] Bruno Salvy, Bob Sedgewick, Mich`eleSoria, Wojtek Szpankowski, and Brigitte Vall´ee. Philippe Flajolet, the father of analytic combinatorics, 1948–2011. ACM SIGACT News, 42(2):101–102, 2011.
[O14] Jean-Marc Steyaert. Avoir eu vingt ans avec Philippe. Gazette des Math´ematiciens, 129:121–122, July 2011.
[O13] Brigitte Vall´ee. Vingt-cinq ans de compagnonnage scientifique avec Philippe Flajolet. Gazette des Math´ematiciens, 129:118–120, July 2011.
[L01] Philippe Flajolet and Robert Sedgewick. Computer Science 504: Mathematical analy- sis of algorithms. Handouts for a graduate course, Princeton University, Spring 1986. 60 pages.
43