D . E . K = (100)8

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 150-162

  Flajolet, Philippe ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035539861     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10022     Document Type: Article

References (80)

1. D. Aldous and P. Shields, A diffusion limit for a class of randomly growing binary trees, Probability Theory and Related Fields 79(4) (1988), 509-542.
2. G.E. Andrews, D. Crippa, and K. Simon, q-series arising from the study of random graphs, SIAM Journal on Discrete Mathematics 10(1) (1997), 41-56.
3. E.A. Bender, Central and local limit theorems applied to asymptotic enumeration, Journal of Combinatorial Theory 15 (1973), 91-111.
4. E.A. Bender and L.B. Richmond, Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions, Journal of Combinatorial Theory, Series A 34 (1983), 255-265.
5. J. Bentley and R. Sedgewick, Fast algorithms for sorting and searching strings, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1997.
6. J.L. Bentley and D. McIlroy, Engineering a sorting function, Software Practice and Experience 23 (1993), 1249-1265.
7. B. Bollobás, Random graphs, Academic Press, New York, 1985.
8. B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim, and D.B. Wilson, The scaling window of the 2-SAT transition, Random Structures & Algorithms 18(3) (2001), 201-256.
9. J. Clément, P. Flajolet, and B. Vallée, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica 29(1/2) (2001), 307-369.
10. T.M. Cover and J.A. Thomas, Elements of information theory, Wiley, New York, 1991. [A Wiley-Interscience Publication].
11. N.G. de Bruijn, Asymptotic methods in analysis, Dover, New York, 1981, [A reprint of the third North Holland edition, 1970 (first edition, 1958)].
12. L. Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Informatica 21 (1984), 229-237.
13. _, A note on the expected height of binary search trees, Journal of the ACM 33 (1986), 489-498.
14. _, Branching processes in the analysis of the heights of trees, Acta Informatica 24 (1987), 277-298.
15. M. Drmota, An analytic approach to the height of binary search trees, Algorithmica 29 (2001), 89-119.
16. O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, SODA'2000, Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 126-127.
17. J.A. Fill and S. Janson, Quicksort asymptotics, Technical Report #597, Department of Mathematical Sciences, The Johns Hopkins University, 2001.
18. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science 144(1/2) (1995), 3-58.
19. P. Flajolet, X. Gourdon, and D. Panario, The complete analysis of a polynomial factorization algorithm over finite fields, Journal of Algorithms 40 (2001), 37-81.
20. P. Flajolet, Y. Guivarc'h, W. Szpankowski, and B. Vallée, "Hidden pattern statistics", F. Orejas, P. Spirakis, and J. van Leeuwen, (Editors), Automata, Languages, and Programming, Lecture Notes in Computer Science, no. 2076, 2001, Proceedings of the 28th ICALP Conference, Crete, July 2001, pp. 152-165.
21. P. Flajolet, D.E. Knuth, and B. Pittel, The first cycles in an evolving graph, Discrete Mathematics 75 (1989), 167-215.
22. P. Flajolet, P. Poblete, and A. Viola, On the analysis of linear probing hashing, Algorithmica 22 (4) (1998), 490-515.
23. P. Flajolet and B. Richmond, Generalized digital trees and their difference-differential equations, Random Structures & Algorithms 3(3) (1992), 305-320.
24. P. Flajolet and R. Sedgewick, Analytic combinatorics, 2001, Book in preparation: Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162, 4103 and electronically under http://algo.inria.fr/flajolet/Publications/books.html.
25. C. Friesen and D. Hensley, The statistics of continued fractions for polynomials over a finite field, Proceedings of the American Mathematical Society 124(9) (1996), 2661-2673.
26. G.H. Gonnet and R. Baeza-Yates, Handbook of algorithms and data structures: in Pascal and C, 2nd ed., Addison-Wesley, Reading, MA, 1991.
27. R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete mathematics, Addison-Wesley, Reading, MA, 1989.
28. D.H. Greene and D.E. Knuth, Mathematics for the analysis of algorithms, Birkhäuser, Boston, 1981.
29. G.H. Hardy, Ramanujan: Twelve lectures on subjects suggested by his life and work, 3rd ed., Chelsea Publishing Company, New-York, 1978. [Reprinted and Corrected from the 1st Edition, Cambridge, 1940].
30. M. Hofri, Analysis of algorithms: Computational methods and mathematical tools, Oxford University Press, Oxford, 1995.
31. H.-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmetiques, Ph.D. thesis, École Polytechnique, December 1994.
32. _, Large deviations for combinatorial distributions. I. Central limit theorems, The Annals of Applied Probability 6(1) (1996), 297-319.
33. _, Large deviations of combinatorial distributions. II. Local limit theorems, The Annals of Applied Probability 8(1) (1998), 163-181.
34. _, On convergence rates in the central limit theorems for combinatorial structures, European Journal of Combinatorics 19(3) (1998), 329-343.
35. P. Jacquet and W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoretical Computer Science 144(1/2) (1995), 161-197.
36. _, Analytical de-Poissonization and its applications, Theoretical Computer Science 201(1/2) (1998), 1-62.
37. S. Janson, D.E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures & Algorithms 4(3) (1993), 233-358.
38. M. Karoński, Random graphs, Handbook of combinatorics R. Graham, M. Grötschel, and L. Lovász; (Editors), vol. I, Elsevier, Amsterdam, 1995, pp. 351-380.
39. P. Kirschenhofer and H. Prodinger, On some applications of formulæ of Ramanujan in the analysis of algorithms, Mathematika 38 (1991), 14-33.
40. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, On the variance of the external path length in a symmetric digital trie, Discrete Applied Mathematics 25 (1989), 129-143.
41. C. Knessl and W. Szpankowski, Quicksort algorithm again revisited, Discrete Mathematics & Theoretical Computer Science 3(2) (1999), 43-64. [Available electronically at http://dmtcs.loria.fr/].
42. q [X], Mathematika 35 (1988), 297-304.
43. D.E. Knuth, Notes on "Open" Addressing, Available electronically at http://algo.inria.fr/ AofA/Research/11-97.html, 1963, Manuscript dated 7/22/63; transcribed by Helmut Prodinger, November 1997.
44. _, Mathematical analysis of algorithms, Information processing 71, North Holland, Amsterdam, 1972, Proceedings of IFIP Congress, Ljubljana, 1971, pp. 19-27.
45. _, The genesis of attribute grammars, Attribute grammars and their applications (Paris, 1990), Lecture Notes in Computer Science, vol. 461, Springer, Berlin, 1990, pp. 1-12.
46. _, The art of computer programming, 3rd ed., vol. 1: Fundamental algorithms, Addison-Wesley, Reading, MA, 1997.
47. _, The art of computer programming, 3rd ed., vol. 2: Seminumerical algorithms, Addison-Wesley, Reading, MA, 1998.
48. _, The art of computer programming, 2nd ed., vol. 3: Sorting and searching, Addison-Wesley, Reading, MA, 1998.
49. _, Linear probing and graphs, Algorithmica 22(4) (1998), 561-568.
50. _, Selected papers on analysis of algorithms, CSLI Publications, Stanford, CA, 2000.
51. D.E. Knuth and A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoretical Computer Science 6 (1978), 281-315.
52. G. Louchard, The Brownian motion: a neglected tool for the complexity analysis of sorted table manipulation, RAIRO Theoretical Informatics 17 (1983), 365-385.
53. G. Louchard and W. Szpankowski, On the average redundancy rate of the Lempel-Ziv code, IEEE Transactions on Information Theory 43(1) (1997), 2-8.
54. H.M. Mahmoud, Evolution of random search trees, John Wiley, New York, 1992.
55. _, Sorting, a distribution theory, Wiley-Interscience, New York, 2000.
56. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, Cambridge, 1995.
57. R. Neininger, Asymptotic distributions for partial match queries k-d trees, Random Structures & Algorithms 17(3/4) (2000), 403-427.
58. R. Neininger and L. Rüschendorf, On the internal path length of d-dimensional quad trees, Random Structures & Algorithms 15(1) (1988), 25-41.
59. P. Nicodème, B. Salvy, and P. Flajolet, Motif statistics, Algorithms, ESA'99, J. Nešetril, (Editor), Lecture Notes in Computer Science, vol. 1643, 1999, pp. 194-211.
60. A. Nijenhuis and H.S. Wilf, Combinatorial algorithms, 2nd ed., Academic Press, New York, 1978.
61. S. Nilsson and G. Karlsson, IP-address lookup using LC tries, IEEE Journal on Selected Areas in Communications 17(6) (1999), 1083-1092.
62. A.M. Odlyzko, Asymptotic enumeration methods, Handbook of combinatorics, R. Graham, M. Grötschel, and L. Lovász, (Editors), vol. II, Elsevier, Amsterdam, 1995, pp. 1063-1229.
63. D. Panario, Combinatorial and algebraic aspects of polynomials over finite fields, Ph.D. thesis, University of Toroto, 1997, Available as Technical Report 306/97, Department of Computer Science. University of Toronto.
64. A. Panholzer and H. Prodinger, A generating functions approach for the analysis of grand averages for multiple quickselect, Random Structures & Algorithms 13 (1998), 189-209.
65. R. Pemantle, Generating functions with high-order poles are nearly polynomial, Mathematics and computer science (Versailles, 2000), Birkhäuser, Basel, 2000, pp. 305-321.
66. M. Petkovšek, H.S. Wilf, and D. Zeilberger, A = B, A.K. Peters Ltd., Wellesley, MA, 1996.
67. B. Pittel, Paths in a random digital tree: Limiting distributions, Advances in Applied Probability 18 (1986), 139-155.
68. H. Prodinger, Knuth's old sum - a survey, EATCS Bulletin 54 (1994), 232-245, [Available electronically from the author's web page].
69. _, Combinatorics of geometrically distributed random variables: left-to-right maxima, Discrete Mathematics 153 (1-3) (1996), 253-270, Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics (Florence, 1993).
70. M. Régnier and W. Szpankowski, On pattern frequency occurrences in a Markovian sequence, Algorithmica 22(4) (1998), 631-649.
71. U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica 29(1/2) (2001), 3-33.
72. G. Schaeffer, Random sampling of large planar maps and convex polyhedra, Proceedings of the thirty-first annual ACM symposium on theory of computing (STOC'99) (Atlanta, Georgia), ACM, New York, 1999, pp. 760-769.
73. Robert Sedgewick, Quicksort, Garland, New York, 1980, Reprint of Ph.D. thesis, Stanford University, 1975.
74. _, Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1998.
75. R. Sedgewick and P. Flajolet, An introduction to the analysis of algorithms, Addison-Wesley, Reading, MA, 1996.
76. W. Szpankowski, Average-case analysis on algorithms on sequences, Wiley, New York, 2001.
77. B. Vallée, Dynamics of the binary Euclidean algorithm: Functional analysis and operators, Algorithmica 22(4) (1998), 660-685.
78. _, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica 29(1/2) (2001), 262-306.
79. J. von zur Gathen and J. Gerhard, Modern computer algebra, Cambridge University Press, New York, 1999.
80. H.S. Wilf, Generatingfunctionology, Academic Press, New York, 1990.