2008

2007

• HyperLoglog: the analysis of a near-optimal cardinality estimation algorithm, by Philippe Flajolet, �ric Fusy, Olivier Gandouet, and Fr�d�ric Meunier. Proceedings of the AofA07 Conference (Analysis of Algorithms-2007), published in Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, vol AH, pp. 127--146 (2007).
• Boltzmann Sampling of Unlabelled Structures, by Philippe Flajolet, Éric Fusy, and Carine Pivoteau. In Proceedings of ANALCO'07 (Analytic Combinatorics and Algorithms) Conference, New Orleans, January 2007. SIAM Press, pp. 201--211.
• Analytic Combinatorics---A Calculus of Discrete Structures, by Philippe Flajolet. Invited lecture at the ACM-SIAM SODA Conference (Symposium on Discrete Algorithms), SIAM Press 2007, pp. 137--148.

2006

• Some exactly solvable models of urn process theory. Philippe Flajolet, Philippe Dumas, and Vincent Puyhaubert. In Discrete Mathematics and Computer Science, vol. AG, pp. 59--118 (2006). Proceedings of Fourth Colloquium on Mathematics and Computer Science, Ph. Chassaing Editor.
• A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. Philippe Flajolet, Eric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne. In Electronic Journal of Combinatorics, 13(1) R103, pp. 1--35 (November 2006).
• The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion. Eric Conrad and Philippe Flajolet. Version of March 25, 2006 (with minor revisions). In Séminaire Lotharingien de Combinatoire (SLC) volume 54 (2006), 44 pages..
• The Ubiquitous Digital Tree, by Philippe Flajolet. Invited lecture at the annual Symposium on Theoretical Aspects of Computer Science, Marseille, February 2006. In STACS 2006, Volume 3884 of Lecture Notes in Computer Science, B. Durand and W. Thomas Ed., pp. 1-22.
• Hidden Word Statistics, Philippe Flajolet, Wojciech Szpankowski, and Brigitte Vallée. In Journal of the ACM, Volume 53:1, January 2006, pages 147--183.

  
  

• The scientific works of Rainer Kemp (1949--2004). By Philippe Flajolet, Markus Nebel, and Helmut Prodinger. In Theoretical Computer Science, volume 355:3 (April 2006),pages 371--381.
• Fast Computation of Special Resultants. - Bostan (Alin), Flajolet (Philippe), Salvy (Bruno), and Schost (�ric). Journal of Symbolic Computation, Volume 41, Issue 1, Pages 1-29 (January 2006)

2005

• Analytic Urns, by Philippe Flajolet, Joaquim Gabarró, Helmut Pekari. In Annals of Probability, Volume 33(3), April 2005, pages 1200-1233.
• On the non-holonomic character of logarithms, powers, and the nth prime function. Philippe Flajolet, Stefan Gerhold, and Bruno Salvy. Version of January 21, 2005. Appears in the Electronic Journal of Combinatorics, Volume (2), 2004-2005, pages A2:1--16.
• Singularity Analysis, Hadamard Products, and Tree Recurrences, by Jim Fill, Philippe Flajolet, and Nevin Kapur. In Journal of Computational and Applied Mathematics, volume 174 (February 2005), pages 271--313. [PS | PS.GZ].

2004

• Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Series: Trends in Mathematics (Mathematics, Computer Science). Edited by Drmota, M.; Flajolet, P.; Gardy, D.; Gittenberger, B. 2004, XV, 554 p., Hardcover ISBN: 3-7643-7128-5 A Birkhäuser book.
  See my Books page for details.
• Boltzmann Samplers for the Random Generation of Combinatorial Structures, by Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer. In Combinatorics, Probability, and Computing, Special issue on Analysis of Algorithms, 2004, Vol. 13, No 4--5, pp. 577-625.
  This paper received the 2007 Outstanding Simulation Publication Award of INFORMS, the Institute For Operations Research and the Management Sciences.
• And/Or Trees Revisited. Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger. In Combinatorics, Probablity, and Computing, Special issue on Analysis of Algorithms, 2004, Volume 13, No 4--5, pp. 475-497. [ps | pdf].
• Counting by coin tossings, by Philippe Flajolet. Version of 27 September 2004. Invited lecture at ASIAN'04 (the Ninth Asian Computing Science Conference held at Chiang Mai in December 2004). In Lecture Notes in Computer Science, vol 3321 (2004), M. Maher (Editor), pages 1--12. [PS]
• Airy Phenomena and Analytic Combinatorics of Connected Graphs, Philippe Flajolet, Bruno Salvy, and Gilles Schaeffer. In Electronic Journal of Combinatorics, Volume 11(1), 2004, #R34, pp. 1-30. Published May 27, 2004. (The unfortunately uggly typography is theirs, not ours!) [ps | ps.gz].

2003

• Loglog Counting of Large Cardinalities, by Marianne Durand and Philippe Flajolet, 14 pages. In the "Engineering and Applications Track" of the 11th Annual European Symposium on Algorithms (ESA03). Proceedings published by Springer, Lecture Notes in Computer Science, vol 2832, pp.605-617. This document is dated September 2003. [PS | PS.GZ].
• Hachage, Arbres, Chemins, et Graphes [in French]. by Philippe Chassaing and Philippe Flajolet. In Gazette des Mathématiciens vol. 95, pp.29-49, January 2003. [ps| pdf]

2002

• Variations on Redundancy Rates of Renewal Processes. Philippe Flajolet and Wojtek Szpankowski. In IEEE Transactions on Information Theory 48(11), 2002, pp. 2911--2921.
• Motif Statistics [html], Nicodème (Pierre), Salvy (Bruno), and Flajolet (Philippe). Appears in Theoretical Computer Science 287:2, 2002, pages 593-617. [ps | ps.gz | pdf]
• On the Robustness of Interconnections in Random Graphs: A Symbolic Approach. Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, and Paul Spirakis. In Theoretical Computer Science 287:2, 2002, pages 513-534.
  
• Analytic Combinatorics---Symbolic Combinatorics. Philippe Flajolet and Robert Sedgewick. 186p.+viii, May 2002. [PS(5.3Mb)| PDF(3.7Mb)]
• Singular Combinatorics. Philippe Flajolet. In Proceedings of the International Congress of Mathematicians 2002, vol III, World Scientific, 2002, pp. 561--571. (Invited lecture at ICM02, Beijing, August 2002.) [ps| pdf]
• Basic Analytic Combinatorics of Directed Lattice Paths. by Cyril Banderier and Philippe Flajolet. In Theoretical Computer Science 281:1-2 (2002), pp. 37-80. [ps| pdf]
• Generating Functions of Generating Trees. Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps. In Discrete Mathematics 246(1-3), March 2002, pp. 29-55. [ps| pdf]
  

  ---

2001 (Happy New Millennium to all!)

• Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena. Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michele Soria. In Random Structures and Algorithms (3-4), 2001, pp 194--246.
• Analytic Variations on the Airy Distribution. Philippe Flajolet and Guy Louchard. In Algorithmica 31 2001 (Special issue on Analysis of Algorithms), pp. 361--377.
• The complete analysis of a polynomial factorization algorithm over finite fields. P. Flajolet, X. Gourdon, and D. Panario. In Journal of Algorithms 40, 2001, pp. 37-81. [ps | pdf].
• Dynamical Sources in Information Theory: A General Analysis of Trie Structures, J. Clément, P. Flajolet, B. Vallée. In Algorithmica 29(1/2), 2001, pp. 307-369. (Preliminary version available here is INRIA Research Report RR-3645, March 1999, 61 pages.) [ps | pdf]

👁 Image

• Continued Fractions, Comparison Algorithms, and Fine Structure Constants. Philippe Flajolet and Brigitte Vallée. In "Constructive, Experimental, and Nonlinear Analysis", M. Théra Ed., (CMS Conf. Proc., 27, Amer. Math. Soc., Providence), pp. 53-82. (Volume in the honour of Jonathan Borwein.) This is a preliminary version as INRIA Research Report 4072, 2000. [ps].
• The Formal Theory of Birth-and-Death Processes, Lattice Path Combinatorics, and Continued Fractions (145kb), Philippe Flajolet and Fabrice Guillemin. In Advances in Applied Probability 32(3), 2000, pp. 750-778. Preliminary version as INRIA Research Report RR-3667, April 1999, 23 pages. [ps | pdf]
• Analytic Variations on Bucket Selection and Sorting (121kb), Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, and Mireille Régnier. In Acta Informatica 36(9-10), 2000, pp. 735-760. The preliminary form available here is INRIA RR3399, April 1998, 22 pages. [ps]
• Analytic Combinatorics of Chord Diagrams (261k). Philippe Flajolet and Marc Noy, Appears in Formal Power Series and Algebraic Combinatorics, 2000, pp. 191-201 (D. Krob, A. A. Mikhalev, A. V. Mikhalev Editors; Springer Verlag. Proc. of FPSAC'2000, June 2000, Moscow). The form available here is INRIA RR3914, March 2000. [ps | pdf]]

  1999

• Analytic Combinatorics of Non-crossing Configurations (146kb), P. Flajolet, M. Noy. In Discrete Mathematics 204(1-3), 1999, 203-229 (Selected papers in honor of Henry W. Gould). The version available here is a preliminary version: INRIA RR3196, June 1997. 22 pages. [ps]
• Properties of Random Triangulations and Trees [abstract]. L. Devroye, P. Flajolet, F. Hurtado, M. Noy, W. Steiger. In Discrete and Computational Geometry 22, pp. 105-117 (1999) Subscribers to Springer's service may view the full text in pdf.
• Stirling Numbers for Complex Arguments and Hankel Contours (HTML with gif pages). Philippe Flajolet, Helmut Prodinger. SIAM Journal on Discrete Mathematics 12:2, 1999, pp. 155-159. The preliminary version offered here is INRIA Report RR3373, March 1998, 5 pages [ps.gz | ps]
• Singularity analysis and asymptotics of Bernoulli sums, Philippe Flajolet. In Theoretical Computer Science 215(1-2), 1999, pp. 371--381. The form available here is INRIA RR3401, April 1998, 10 pages. [ps]

  1998

• On the Analysis of Linear Probing Hashing Philippe Flajolet, Patricio Poblete, and Alfredo Viola In Algorithmica 22, (December 1998), pp. 490-515. (Special Issue on Analysis of Algorithms.)
• Euler Sums and Contour Integral Representations. P. Flajolet and B. Salvy. In Journal of Experimental Mathematics, volume 7(1), 1998, pp. 15-35, where it is available electronically freely by courtesy of the publisher.
• Continued Fraction Algorithms, Functional Operators, and Structure Constants (148kb), P. Flajolet and B. Vallée. The full paper appears in Theoretical Computer Science, March 1998, vol 194 (1-2), pp. 1-34. Here is a preliminary version (INRIA, RR2931, July 1996. 33 pages) that is the text of an invited lecture at the 7th conference "Fibonacci Numbers and Applications", Graz, July 1996.
• The Analysis of Hybrid Trie Structures , Julien Clément, Philippe Flajolet, Brigitte Vallée. In Proceedings of the Ninth ACM_SIAM Symposium on Discrete Algorithms (SODA'98), San Francisco, January 1998, pp. 531-539.
• The Maximum of a Random Walk and Its Application to Rectangle Packing (98kb), E.~G.~Coffman, Philippe Flajolet, Leopold Flatto, and Micha Hofri. In Probability in Engineering and Informational Sciences, 12 (1998), pp. 373-386. The form available here is (INRIA, RR3223), July 1997. 14 pages. [ps]

  1997

• An average-case analysis of the Gaussian algorithm for lattice reduction (132kb), H. Daudé, P. Flajolet, and B. Vallée. In Combinatorics, Probability and Computing 6 (4), 1997, pp. 397-433. (Preliminary version available here: INRIA, RR 2798, February 1996.)
• The SIGSAM Challenges: Symbolic Asymptotics in Practice. Philippe Flajolet and Bruno Salvy. In SIGSAM Bulletin, vol 31 (4), 1997, pages 36-47.
• Patterns in Random Binary Search Trees (104kb), P. Flajolet, X. Gourdon, C. Martinez. (INRIA, RR2997), October 1996. 23 pages. Final version appears in Random Structures and Algorithms, volume 11 (3), October 1997, pp. 223-244.
• Adaptive Sampling. Philippe Flajolet. In Encyclopaedia of Mathematics, M. Hazewinkel Editor (1997). In Suppl. I, p. 28.

  1996

• Zeta Function expansions of Classical Constants. Philippe Flajolet and Ilan Vardi. This is the current edition of an unpublished memo that was devopped around 1990-1992 and has been circulated around for a while.
• Random Triangulations [Extended Abstract] (138kb), L. Devroye, P. Flajolet, F. Hurtado, M. Noy, and W. Steiger, 2852), April 1996. 10 pages. Accepted for publication in Discrete and Computational Geometry.
• Asymptotique des récurrences mahleriennes: le cas cyclotomique, P. Dumas, P. Flajolet, Journal de Théorie des Nombres de Bordeaux 8(1), 1996, pp. 1-30. Available from the wonderful NUMDAM Site.

  1995

• Computer Algebra Libraries for Combinatorial Structures, Philippe Flajolet and B. Salvy. In Journal of Symbolic Computation, vol 20, 1995, pp. 653-671.
• Hypergeometrics and the Cost Structure of Quadtrees, Philippe Flajolet, Gilbert Labelle, Louise Laforest and B. Salvy. In Random Structures and Algorithms , vol. 7 (2), 1995, pp. 117-144.
• Mellin Transforms and Asymptotics : Harmonic Sums, P. Flajolet, X. Gourdon, P. Dumas. In Theoretical Computer Science , vol. 144 (1-2), 1995, pp. 3-58. There is also a list of Corrigenda, updated in 2004.
• Mellin Transforms and Asymptotics : Finite Differences and Rice's Integrals, P. Flajolet, R. Sedgewick. In Theoretical Computer Science , vol. 144 (1-2), 1995, pp. 101-124.
• On Ramanujan's Q-function, P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger. In J. Computational and Applied Mathematics, vol. 58 (1), 1995, pp. 103-116.

  1994

• Mellin Transforms and Asymptotics : The Mergesort Recurrence, P. Flajolet, M Golin. In Acta Informatica , vol. 31, 1994, pp. 673-696.
  
• Mellin Transforms and Asymptotics : Digital Sums, P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, R. Tichy. In Theoretical Computer Science, vol. 123 (2), 1994, pp. 291-314.
• A Calculus for the Random Generation of Labelled Combinatorial Structures(362kb), P. Flajolet, P. Zimmermann, B. Van Cutsem, In Theoretical Computer Science, vol. 132 (1-2), 1994, pp. 1-35. [pdf]
• Search Costs in Quadtrees and Singularity Perturbation Asymptotics , P. Flajolet, Thomas Lafforgue. In Discrete and Computational Geometry, vol 12 (4), 1994, pp. 151-175.

  1993

• Analytic Variations on Quadtrees. Philippe Flajolet, Gaston Gonnet, Claude Puech and J. M. Robson. In Algorithmica 10:7, pp. 473-500, December 1993.
• The distribution of heights of binary trees and other simple trees. P. Flajolet, Z. Gao, A. Odlyzko, and B. Richmond. In Combinatorics, Probability, and Computing, vol 2 (1993), pp. 145-156.
• General Combinatorial Schemas: Gaussian Limit Distributions and Exponential Tails, P. Flajolet, M. Soria. In Discrete Mathematics, , vol 114, 1993, pp. 159--180.

  1992

• Analytic Analysis of Algorithms (378kb). Philippe Flajolet. Invited lecture given at the 19th International Colloquium ICALP'92, Vienna, July 1992. Proceedings published as Automata, Languages and Programming, in Lecture Notes in Computer Science Vol. 623, W. Kuich Editor (1992), pp 186--210. [ps (2727kb)]
• 👁 Image
  Varieties of Increasing Trees. F. Bergeron, P. Flajolet, and B. Salvy. In Proceedings of the 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 1992. Proceedings published in Lecture Notes in Computer Science vol. 581, J.-C. Raoult Ed., 1992, pp. 24-48.
• Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-organizing Search, Discrete Applied Mathematics 39 (1992), 207--229.
• Page Usage in a Quadtree Index, M. Hoshi, P. Flajolet. In BIT,, vol 32, 1992, pp. 384-402.
• Generalized Digital Trees and Their Difference--differential Equations, P. Flajolet, B. Richmond. In Random Structures and Algorithms,, vol 3 (3), 1992, pp. 305-320.

  1991

• Automatic average-case analysis of algorithms P. Flajolet, B. Salvy, and P. Zimmermann. In Theoretical Computer Science, vol. 79, no. 1, 1991, pp. 37-109.
• The Cycle Construction (19kb), P. Flajolet, M. Soria. In SIAM J. Discr. Math., , vol 4 (1), 1991, pp. 58-60.
• Polya Festoons, P. Flajolet. In INRIA Research Report, No 1507, September 1991. 6pp.

  1990

• Average-Case Analysis of Algorithms and Data Structures, by J. S. Vitter and Ph. Flajolet. Chapter 9 in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (edited by J. van Leeuwen), Elsevier, 1990, 431-524. (The version offered here is without figures.)
• Analytic Variations on the Common Subexpression Problem, , P. Flajolet, P. Sipala, and J-M. Steyaert, In Proceedings of the 17th ICALP Conference, Warwick, July 1990. Lecture Notes in Computer Science, Vol. 443, pp. 220-234.
• Gaussian Limiting Distributions for the Number of Components in Combinatorial Structures (57kb). P. Flajolet, M. Soria. In J. Combinatorial Theory, Series A, , vol 53, 1990, pp. 165-182.
• Singularity analysis of generating functions. P. Flajolet and A. M. Odlyzko. In SIAM J. Discrete Math., vol 3 (1990) pp. 216-240.
• Random Mapping Statistics (175kb), P. Flajolet, A. Odlyzko. In Advances in Cryptology, Proc. Eurocrypt'89, , J-J. Quisquater Ed., Lect. Notes in Comp. Sc. vol 434, 1990, pp. 329-354.
• 👁 Image
  Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series , P. Flajolet and R. Schott. In European Journal of Combinatorics, Vol 11, 1990, pp. 412-432. [ps|ps.gz]
• On adaptive sampling. P. Flajolet. In Computing, Vol 34, 1990, pp. 391-400.

  ---

  Prehistory (before 1990)

• 👁 Image
  Elliptic Functions, Continued Fractions and Doubled Permutations. By Philippe Flajolet and Jean Francon. In European Journal of Combinatorics vol 10 (1989), pp. 235-241.
• Lambda-Upsilon-Omega the 1989 cookbook (INRIA RR 1073) P. Flajolet, B. Salvy, and P. Zimmermann, 1989.
• 👁 Image
  Deviations from uniformity in random strings. By Flajolet, Philippe, Kirschenhofer, Peter and Tichy, Robert F.. In Probability Theory and Related Fields, 1988, vol 80, 139--150.
  
• 👁 Image
  Random Tree Models in the Analysis of Algorithms. By Philippe Flajolet. Invited lecture at the PERFORMANCE'87 Conference, Brussels, 1988. Proceedings published by Elsevier Science Publishers (North Holland), P.-J. Courtois and G. Latouche Editors., pp. 171--187.
• 👁 Image
  Mathematical Methods in the Analysis of Algorithms and Data Structures. Philippe Flajolet. In Trends in Theoretical Computer Science, Chapter VI, Computer Science Press, 1988, E. Börger Editor. Pages 225--304. (Lecture Notes for A Graduate Course in Computation Theory, Udine, 1984)
• 👁 Image
  Evaluation de protocoles de communications: Aspects mathematiques (98kb). This document (in French) corresponds to a plenary lecture at the Annual Meeting of Societe Mathematique de France. January 1988. (Some figures missing.) [ps]
• 👁 Image
  Analytic Models and Ambiguity of Context-Free Languages, by Philippe Flajolet. In Theoretical Computer Science, 49, 1987, pp. 283--309. {Scanned PDF with OCR.]
• 👁 Image
  Level number sequences for trees, by Flajolet, Philippe and Prodinger, Helmut. In Discrete Mathematics 65, 1987, pp. 149--156.
• 👁 Image
  Analytic models for tree communication protocols. by P. Flajolet and P. Jacquet. In A. R. Odoni, L. Bianco, and G. Szeg�, editors, Flow Control of Congested Networks, volume 38 of NATO Advance Science Institute Series. Series F: Computer and Systems Sciences, pages 223-234. Springer Verlag, 1987. (Invited Lecture).
• 👁 Image
  Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. Albert G. Greenberg, Philippe Flajolet and Richard E. Ladner; Journal of the ACM 34, 2 (Apr. 1987), Pages 289-325 (full text for subscribers of ACM's digital library) .
• 👁 Image
  Digital Search Trees Revisited. Philippe Flajolet and Robert Sedewick. In SIAM Journal on Computing 15:3, pp. 748--767.
• 👁 Image
  On a Functional Equation Arising in the Analysis of a Protocol for a Multi-Access Broadcast Channel. Guy Fayolle, Philippe Flajolet, and Micha Hofri. In Advances in Applied Probability vol 18 (1986), pp. 441--472. 👁 Image
  The evolution of two stacks in bounded space and random walks in a triangle. Philippe Flajolet. Mathematical Foundations of Computer Science, in Lecture Notes in Computer Science 233, (1986).J. Gruska et al. Eds, Pages 325--340.
• 👁 Image
  Partial match retrieval of multidimensional data. Philippe Flajolet and Claude Puech. Journal of the ACM, Volume 33, Issue 2 (1986). Pages 371-407.
• 👁 Image
  The Analysis of Simple List Structures. By Flajolet, Philippe and Puech, Claude and Vuillemin, Jean. In Information Sciences 1986, pages 121--146, Volume 38.
• 👁 Image
  Q-ary collision resolution algorithms in random-access systems with free or blocked channel access. Peter Mathys and Philippe Flajolet. Invited paper in IEEE Transactions on Information Theory, vol 31:2, pp. 217-243.
• 👁 Image
  Probabilistic Counting Algorithms for Data Base Applications. Philippe Flajolet and G. Nigel Martin. In Journal of Computer and System Sciences, vol 31(2), 1985, pp. 182-209.
• 👁 Image
  Approximate Counting: A Detailed Analysis [pdf]. Philippe Flajolet. In BIT vol 25 (1985), pp. 113-134.
• 👁 Image
  Algebraic Methods for Trie Statistics. By Flajolet, Philippe and R�gnier, Mireille and Sotteau, Dominique. In Annals of Discrete Mathematics 25, pp. 145--188. (From Proceedings of Analysis and Design of Algorithms for Combinatorial Problems, G. Ausiello and M. Lucertini Editors.)
• 👁 Image
  Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumeration. (59kb) P. Flajolet and A. M. Odlyzko. In Math. Proc. Cambridge Phil. Soc., 96 (1984). pp. 237-253.
• 👁 Image
  On congruences and continued fractions for some classical combinatorial quantities. Philippe Flajolet. In Discrete Mathematics 41 (1982), no. 2, 145-153.
• 👁 Image
  The Average Height of Binary Trees and Other Simple Trees". Philippe Flajolet and Andrew Odlyzko. In Journal of Computer and System Scienes, vol 25, 1982, pp. 171-213.
• 👁 Image
  A Recursive Partitioning Process of Computer Science. By Philippe Flajolet and Dominique Sotteau. In Second World Conference on Mathematics at the Service of Man, Las Palmas, Canary Islands, Spain, 1982, pages 25--30.
• 👁 Image
  Dynamic Data Structures: Fiite Files, Limiting Profiles and Variance Analysis. Ch�no, Laurent, Flajolet, Philippe, Fran�on, Jean, Puech, Claude, and Vuillemin, Jean. In Proceedings of the Eighteenth Annual Conference on Communication, Control, and Computing. October 1980, Allerton, IL, pp. 223--232.
• 👁 Image
  Sequence of Operations Analysis for Dynamic Data Structures. Philippe Flajolet, Jean Françon, Jean Vuillemin. Journal of Algorithms 1, pp. 111-141.
• 👁 Image
  Combinatorial Aspects of Continued Fractions (2.4Mb). Philippe Flajolet. In Discrete Mathematics 32 (1980), pp. 125-161. A classic (!) now available in digitized form (with OCR and search!). Reprinted in the 35th Special Anniversary Issue of Discrete Mathematics, Volume 306, Issue 10--11, Pages 992-1021 (2006).

To obtain copies of other works or paper copy, please contact me.
Technical comments are also most welcome!