The Diagonal Poisson Transform and Its Application to the Analysis of a Hashing Scheme

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 221-255

  Poblete, Patricio V ^a   Viola, Alfredo ^b   Munro, J Ian ^c  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031541995     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<221::aid-rsa12>3.0.co;2-b     Document Type: Review

References (56)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1972.
2. O. Amble and D. E. Knuth, Ordered hash tables, Comput. J., 17(2), 135-142 (1974).
3. R. P. Brent, Reducing the retrieval time of scatter storage techniques, Commun. ACM, 16(2), 105-109 (1973).
4. A. Broder, Two counting problems solved via string encodings, in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds., NATO Advance Science Institute Series. Series F: Computer and System Sciences, Springer-Verlag, New York, 1985, Vol. 12, pp. 229-240.
5. S. Carlsson, J. I. Munro, and P. V. Poblete, On linear probing hashing, unpublished manuscript, 1987.
6. A. Cauchy, Exercises de mathématiques, Paris, 1826, pp. 62-73.
7. P. Celis, Robin Hood hashing, Ph.D. thesis, Technical Report CS-86-14, Computer Science Department, University of Waterloo, Waterloo, ON, Canada, April 1986.
8. JP. Celis, P.-Å. Larson, and J. I. Munro, Robin Hood hashing, 26th IEEE Symposium on the Foundations of Computer Science, 1985, pp. 281-288.
9. B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan, and S. M. Watt, MAPLE V Reference Manual, Springer-Verlag, New York, 1991.
10. K. J. Compton and C. Ravishankar, Expected deadlock time in a multiprocessing system, J. ACM, 42(3), 562-583 (1995).
11. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
12. P. C. Consul, Generalized Poisson Distributions. Properties and Applications, Marcel Dekker, New York, 1989.
13. M. A. Evgrafov, Analytic Functions, Dover, New York, 1978.
14. R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible hashing - a fast access method for dynamic files, ACM Trans. Database Syst., 4(3), 315-344 (1979).
15. P. Flajolet, personal communication, 1995.
16. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics; harmonic sums, Theor. Comput. Sci., 144(1-2), 3-58 (1995).
17. P. Flajolet, P. Grabner, P. Kirschenhofer, and H. Prodinger, On Ramanujan's Q-function, J. Comput. Appl. Math., 58(1), 103-116 (1995).
18. P. Flajolet, D. E. Knuth, and B. Pittel, The first cycles in an evolving graph, Discrete Math. 75, 167-215 (1989).
19. P. Flajolet and A. M. Odlyzko, The average height of binary trees and other simple trees, J. Comput. Syst. Sci., 25, 171-213 (1982).
20. P. Flajolet and A. M. Odlyzko, Random mapping statistics, in Advances in Cryptology, J.-J. Quisquater and J. Vandewalle, Eds., Lecture Notes in Computer Science 434, Proceedings of EUROCRYPT'89, Houtalen, Belgium, April 1989, Springer-Verlag, New York, pp. 329-354.
21. J. Flajolet and A. M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math., 3(2), 216-240 (1990).
22. P. Flajolet and R. Sedgewick, The average case analysis of algorithms: complex asymptotics and generating functions, Research Report 2026, INRIA, September 1993.
23. P. Flajolet and R. Sedgewick, The average case analysis of algorithms: counting and generating function, Research Report 1888, INRIA Rocquencourt, April 1993.
24. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structure, 2nd ed., Addison-Wesley, Reading, MA, 1991.
25. G. H. Gonnet and J. I. Munro, Efficient ordering of hash tables, SIAM J. Comput., 8(3), 463-478 (1979).
26. G. H. Gonnet and J. I. Munro, The analysis of linear probing sort by the use of a new mathematical transform, J. Alg., 5, 451-470 (1984).
27. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
28. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
29. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford University Press, Oxford, 1979.
30. P. Jacquet and M. Régnier, Trie partitioning process: limiting distributions, CAAP'86, Proc. 11th Colloquium on Trees in Algebra and Programming, P. Franchi-Zanetacchi, Ed., Nice, France, March 1986, LNCS Vol. 214, pp. 196-210.
31. P. Jacquet and W. Szpankowski, Ultimate characterizations of the burst response of an interval searching algorithm: a study of a functional equation, SIAM J. Comput., 8, 777-791 (1989).
32. P. Jacquet and W. Szpankowski, A functional equation arising in the analysis of algorithms, Proceedings of the 26th ACM Symposium on the Theory of Computing (STOC) (May), 780-789 (1994).
33. P. Jacquet and W. Szpankowski, Asymptotic behaviour of the Lempel-Ziv parsing scheme and digital search trees, Theor. Comput. Sci., 144, 161-197 (1995).
34. T. Kløve, Bounds for the worst case probability of undetected error, IEEE Inf. Theory, 41, 298-300 (1995).
35. D. E. Knuth, The Art of Computer Programming, Vol. 1. Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968.
36. D. E. Knuth, The Art of Computer Programming, Vol. 2. Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1969.
37. D. E. Knuth, The Art of Computer Programming, Vol. 3. Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
38. D. E. Knuth, Analysis of optimum caching, J. Alg. 6, 181-199 (1985).
39. D. E. Knuth, S. Janson, T. Łuczak, and B. Pittel, The birth of the giant component, Random Struct. Alg., 4, 233-358 (1993).
40. D. E. Knuth and B. Pittel, A recurrence related to trees, Proc. Amer. Math. Soc., 105, 335-349 (1989).
41. D. E. Knuth and G. S. Rao, Activity in an interleaved memory, IEEE Trans. Comput., C-24, 943-944 (1975).
42. D. E. Knuth and A. Schönhage, The expected linearity of a simple equivalence algorithm, Theor. Comput. Sci., 6, 281-315 (1978).
43. G. Louchard and W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Inf. Theory, 41, 478-488 (1995).
44. J. W. Moon, Counting Labelled Trees, Canadian Mathematical Monographs, Montreal, 1970.
45. A. M. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional equations, Adv. Math., 44, 180-205 (1982).
46. F. W. J. Olver, Asymptotics and Special Functions, Academic, New York, 1974.
47. P. V. Poblete, Approximating functions by their Poisson transform, Inf. Process. Lett., 23, 127-130 (1986).
48. P. V. Poblete and J. I. Munro, Last-come-first-served hashing, J. Alg. 10, 228-248 (1989).
49. P. V. Poblete, A. Viola, and J. I. Munro, The analysis of a hashing scheme by a new transform, 2nd European Symposium on Algorithms, Lecture Notes in Computer Science 434, 1994, pp. 94-105.
50. S. Ramanujan, Question 294, J. Ind. Math. Soc., 3, 128 (1911).
51. S. Ramanujan, On question 294, J. Ind. Math. Soc., 4, 151-152 (1912).
52. J. Riordan, Combinatorial Identities, Wiley, New York, 1968.
53. W. Szpankowski, On asymptotics of certain sums arising in coding theory, IEEE Trans. Inf. Theory, 41, 2087-2090 (1995).
54. J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, New York, 1982.
55. A. Viola, Analysis of hashing algorithms and a new mathematical transform. Ph.D. thesis, Technical Report CS-95-50, Computer Science Department, University of Waterloo, Waterloo, ON, Canada, November 1995.
56. H. S. Wilf, generating functionology, Academic, New York, 1994.