Analytical depoissonization and its applications

Theoretical Computer Science

Volumn 201, Issue 1-2, 1998, Pages 1-62

  Jacquet, Philippe ^a   Szpankowski, Wojciech ^b  

^a INRIA ROCQUENCOURT   (France)

^b Purdue University   (United States)

Author keywords

Analysis of algorithms and data structures; Analytical combinatorics; Cauchy integral formula; Depoissonization; Digital trees; Limiting distributions; Mellin transform of complex variable; Poissonization; Saddle point method

Indexed keywords

EID: 0002560302     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00167-9     Document Type: Review

References (61)

1. D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, Springer, New York, 1989.
2. R. Arratia, S. Tavaré, Independent processes approximations for random combinatorial structures, Adv. Math. 104 (1994) 90-154.
3. N.G. de Bruijn, Asymptotic Methods in Analysis, Dover, New York, 1962.
4. J. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inform Theory 25 (1979) 505-515.
5. J. Capetanakis, Generalized TDMA: The multiaccessing tree protocol, IEEE Trans. Comm. 27 (1979) 1476-1484.
6. T.S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978.
7. L. Comtet, Advanced Combinatorics, Reidel, Boston, 1974.
8. B. Davis, Integral Transforms and Their Applications, Springer, New York, 1985.
9. L. Devroye, The expected length of the longest probe sequence when the distribution is not uniform, J. Algorithms 6 (1985) 1-9.
10. G. Doetsch, Handbuch der Laplace Transformation, Birkhäuser, Basel, 1950.
11. G. Fayolle, P. Flajolet, M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel, Adv. Appl. Probab. 18 (1986) 441-472.
12. G. Fayolle, P. Flajolet, M. Hofri, P. Jacquet, Analysis of stack algorithm for random multiple-access communication, IEEE Trans. Inform. Theory 31 (1985) 244-254.
13. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1971.
14. J. Fill, H. Mahmoud, W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab. 6 (1996) 1260-1283.
15. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret. Comput. Sci. 144 (1995) 3-58.
16. P. Flajolet, G.N. Martin, Probabilistic counting algorithms for data base applications, J. Comp. System Sci. 31 (1985) 182-209.
17. P. Flajolet, A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Methods 3 (1990) 216-240.
18. P. Flajolet, M. Régnier, D. Sotteau, Algebraic methods for trie statistics, Ann. Discrete Math. 25 (1985) 145-188.
19. P. Flajolet, B. Richmond, Generalized digital trees and their difference-differenlial equations, Random Structures Algorithms 3 (1992) 305-320.
20. G.H. Gonnet, The expected length of the longest probe sequence in Hash code searching, J. ACM 28 (1981) 289-304.
21. G. Gonnet, J. Munro, The analysis of linear probing sort by the use of a new mathematical transform, J. Algorithms 5 (1984) 451-470.
22. M. Hofri, Analysis of Algorithms, Oxford University Press, New York, 1995.
23. L. Holst, On birthday, collector's, occupancy and other classical um problems, Internat. Statist. Rev. 54 (1986) 15-27.
24. H.-K. Hwang, Asymptotic estimates of elementary probability distributions, Studies Appl. Math., to appear.
25. P. Jacquet, Contribution de l'Analyse d'Algorithmes a l'Evaluation de Protocoles de Communication. Thèse Université de Paris Sud-Orsay, 1989.
26. P. Jacquet, M. Régnier, Limiting distributions for trie parameters, Lecture Notes in Computer Science, vol. 214, 196-210, 1986.
27. P. Jacquet, M. Régnier, Normal limiting distribution of the size of tries, in: Proc. Performance'87, North-Holland, Amsterdam, 1987, pp. 209-223.
28. P. Jacquet, W. Szpankowski, Ultimate characterization of the burst response of an interval searching algorithm: a study of a functional equation, SIAM J. Comput. 18 (1989) 777-791.
29. P. Jacquet, W. Szpankowski, Analysis of digital tries with Markovian dependency, IEEE Trans. Inform. Theory 37 (1991) 1470-1475.
30. P. Jacquet, W. Szpankowski, Autocorrelation on words and ils applications, analysis of suffix trees by string-ruler approach, J. Combin. Theory Ser. A 66 (1994) 237-269.
31. P. Jacquet, W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoret. Comput. Sci. 144 (1995) 161-197.
32. P. Jacquet, W. Szpankowski, Towards analytical information theory: entropy computations, Purdue University, CSD-TR-96-085, 1996.
33. S. Janson, W. Szpankowski, Analysis of an asymmetric leader election algorithm, Electronic Journal of Combinatorics 4 (1997).
34. M. Kac, On the deviations between theoretical and empirical distributions, Proc. Natl. Acad. Sci. USA 35 (1949) 252-257.
35. P. Kirschenhofer, H. Prodinger, W. Szpankowski, Digital search trees again revisited: the internal path length perspective, SIAM J. Comput. 23 (1994) 598-616.
36. P. Kirschenhofer, H. Prodinger, W. Szpankowski, Analysis of a splitting process arising in probabilistic counting and other related algorithms, Random Structures Algorithms 9 (1996) 379-402.
37. D. Knuth, The Art of Computer Programming, Sorting and Searching, vol. 3., Addison-Wesley, Reading, MA, 1973.
38. G. Louchard, W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Inform. Theory 41 (1995) 478-488.
39. G. Louchard, W. Szpankowski, On the average redundancy rate of the Lempel-Ziv code, IEEE Inform. Theory 43 (1997) 2-8.
40. G. Louchard, W. Szpankowski, J. Tang, Average profile for the generalized digital search trees and the generalized Lempel-Ziv algorithm, SIAM J. Comput, to appear.
41. H. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
42. P. Mathys, P. Flajolet, Q-ary collision resolution algorithms in random-access systems with free and blocked channel access, IEEE Trans. Inform. Theory 31 (1985) 217-243.
43. A. Odlyzko, Asymptotic enumeration, in: Handbook of Combinatorics, vol. II, in: R. Graham, M. Götschel, L. Lovász (Eds.), Elsevier, Amsterdam, 1995, pp. 1063-1229.
44. P.V. Poblete, Approximating functions, by their Poisson Transform, Inform. Process. Lett. 23 (1986) 127-130.
45. P. Poblete, A. Viola, J.I. Munro, The diagonal poisson transform and its application to the analysis of a Hashing scheme, Random Structures Algorithms 10 (1997) 221-256.
46. H. Prodinger, How to select a loser, Discrete Math. 120 (1993) 149-159.
47. B. Rais, P. Jacquet, W. Szpankowski, A limiting distribution for the depth in PATRICIA tries, SIAM J. Discrete Math. 6 (1993) 197-213.
48. M. Regnier, P. Jacquet, New results on the size of tries, IEEE Trans. Inform, Theory 35 (1989) 203-205.
49. R. Remmert, Theory of Complex Functions, Springer, New York, 1991.
50. S. Ross, Stochastic Processes, Wiley, New York, 1983.
51. U. Schmid, The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects, in: Proc. ICALP 92, Vienna, 1992, pp. 223-234.
52. R. Sedgewick, P. Flajolet, Analysis of Algorithms, Addison-Wesley, Reading, MA, 1995.
53. R. Stanley, Enumerative Combinatorics, Wadsworth, Monterey, 1986.
54. W. Szpankowski, On a recurrence eqjation arising in the analysis of conflict resolution algorithms, Stochastic Models 3 ( 1987) 89-114.
55. W. Szpankowski, Patricia trie again revisited, J. ACM 37 (1990) 691-711.
56. B. Tsybakov, V. Mikhailiov, Random multiple packet access: part-and-try algorithm, Prob. Inform. Transmission 16 (1980) 305-317.
57. J. Vitter, P. Flajolet, Analysis of algorithms and data structures, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, North-Holland, Amsterdam, 1990. pp. 431-524.
58. H. Wilf, Generating functionology, Academic Press, Boston, 1990.
59. A.D. Wyner, J. Ziv, Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression, IEEE Trans. Inform. Theory 35 (1989) 1250-1258.
60. J. Ziv, A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory 23 (1977) 337-343.
61. J. Ziv, A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory 24 (1978) 530-536.