On the analysis of linear probing hashing

Algorithmica (New York)

Volumn 22, Issue 4, 1998, Pages 490-515

  Flajolet, P ^a   Poblete, P ^b   Viola, A ^c  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF CHILE   (Chile)

^c Pedeciba Informatica   (Uruguay)

Author keywords

Airy functions; Analysis of algorithms; Hashing; Linear probing; Parking problem

Indexed keywords

EID: 19544388116     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009236     Document Type: Article

References (54)

1. Berndt, B. C. Ramanujan's Notebooks, Part II. Springer-Verlag, Berlin, 1989.
2. Broder, A. Two counting problems solved via string encodings. In Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds., vol. 12 of NATO Advance Science Institute Series. Series F: Computer and System Sciences. Springer-Verlag, Berlin, 1985, pp. 229-240.
3. De Bruijn, N. G. Asymptotic Methods in Analysis. Dover, New York, 1981. A reprint of the third North-Holland edition, 1970 (first edition, 1958).
4. Flajolet, P., Grabner, P., Kirschenhofer, P., and Prodinger, H. On Ramanujan's Q-function. Journal of Computational and Applied Mathematics 58(1) (1995), 103-116.
5. Flajolet, P., Knuth, D. E., and Pittel, B. The first cycles in an evolving graph. Discrete Mathematics 75 (1989), 167-215.
6. Flajolet, P., and Odlyzko, A. M. Random mapping statistics. In Advances in Cryptology, J.-J. Quisquater and J. Vandewalle, Eds., vol. 434 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1990, pp. 329-354. Proceedings of Eurocrypt '89, Houtalen, Belgium, April 1989.
7. Flajolet, P., and Odlyzko, A. M. Random mapping statistics. In Advances in Cryptology, J.-J. Quisquater and J. Vandewalle, Eds., vol. 434 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1990, pp. 329-354. Proceedings of Eurocrypt '89, Houtalen, Belgium, April 1989.
8. Flajolet, P., and Odlyzko, A. M. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3(2) (1990), 216-240.
9. Flajolet, P., and Sedgewick, R. Analytic Combinatorics. Book in preparation, 1998. (Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162.)
10. Gamkrelidze, R. V., Ed. Analysis I, Integral Representations and Asymptotic Methods, vol. 13 of Encyclopedia of Mathematical Sciences. Springer-Verlag, Berlin, 1989.
11. Gardy, D. Some results on the asymptotic behaviour of coefficients of large powers of functions. Discrete Mathematics 139(1-3) (1995), 189-217.
12. Gessel, I., Sagan, B. E., and Yeh, Y.-N. Enumeration of trees by inversions. Journal of Graph Theory 19(4) (1995), 435-459.
13. Gessel, I., and Wang, D. L. Depth-first search as a combinatorial correspondence. Journal of Combinatorial Theory, Series A 26(3) (1979), 308-313.
14. Gonnet, G., and Munro, J. The analysis of linear probing sort by the use of a new mathematical transform. Journal of Algorithms 5 (1984), 451-470.
15. Gonnet, G. H., and Baeza-Yates, R. Handbook of Algorithms and Data Structures: in Pascal and C, second edn. Addison-Wesley, Reading, MA, 1991.
16. Goulden, I. P., and Jackson, D. M. Combinatorial Enumeration. Wiley, New York, 1983.
17. Greene, D. H., and Knuth, D. E. Mathematics for the Analysis of Algorithms, second edn. Birkhäuser, Boston, 1982.
18. Hennequin, P. Combinatorial analysis of quicksort algorithm. RAIRO Theoretical Informatics and Applications 23(3) (1989), 317-333.
19. Janson, S., Knuth, D. E., Luczak, T., and Pittel, B. The birth of the giant component. Random Structures and Algorithms 4(3) (1993), 233-358.
20. Kirschenhofer, P., Prodinger, H., and Tichy, R. Über einige Funktionaldifferentialgleichingen aus des Analyse von Algorithmen. In Zahlentheoretische Analysis II, E. Hlawka, Ed., no. 1262 in Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1987, pp. 111-123.
21. Knuth, D. E. Notes on "open" addressing. Unpublished memorandum, 1963. (Memo dated July 22, 1963. With annotation "My first analysis of an algorithm, originally done during Summer 1962 in Madison." Also conjectures the asymptotics of the Q-function, with annotation "Proved May 24, 1965.")
22. Knuth, D. E. Notes on "open" addressing. Unpublished memorandum, 1963. (Memo dated July 22, 1963. With annotation "My first analysis of an algorithm, originally done during Summer 1962 in Madison." Also conjectures the asymptotics of the Q-function, with annotation "Proved May 24, 1965.")
23. Knuth, D. E. Notes on "open" addressing. Unpublished memorandum, 1963. (Memo dated July 22, 1963. With annotation "My first analysis of an algorithm, originally done during Summer 1962 in Madison." Also conjectures the asymptotics of the Q-function, with annotation "Proved May 24, 1965.")
24. Knuth, D. E. The Art of Computer Programming, vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, MA, 1968.
25. Knuth, D. E. The Art of Computer Programming, vol. 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA, 1969.
26. Knuth, D. E. The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
27. Knuth, D. E. Analysis of optimum caching. Journal of Algorithms 6 (1985), 181-199.
28. Knuth, D. E. Linear probing and graphs. Algorithmica, this issue, pp. 561-568.
29. Knuth, D. E., and Rao, G. S. Activity in an interleaved memory. IEEE Transactions on Computers 24 (1975), 943-944.
30. Knuth, D. E., and Schönhage, A. The expected linearity of a simple equivalence algorithm. Theoretical Computer Science 6 (1978), 281-315.
31. Kreweras, G. Une famille de polynômes ayant plusieurs propriétés énumératives. Periodica Mathematica Hungarica 11 (1980), 309-320.
32. Louchard, G. The Brownian excursion: a numerical analysis. Computers and Mathematics with Applications 10(6) (1984), 413-417.
33. Louchard, G. Kac's formula, Lévy's local time and Brownian excursion. Journal of Applied Probability 21 (1984), 479-499.
34. Mallows, C. L., and Riordan, J. The inversion enumerator for labeled trees. Bulletin of the American Mathematical Society 74 (1968), 92-94.
35. Moon, J. W. Counting labelled trees. In Canadian Mathematical Monographs, vol. 1. Canadian Mathematical Congress, Montreal, 1970.
36. Odlyzko, A. M. Asymptotic enumeration methods. In Handbook of Combinatorics, vol. II, M. G. R. Graham and L. Lovász, Eds. Elsevier, Amsterdam, 1995, pp. 1063-1229.
37. Pittel, B. Linear probing: the probable largest search time grows logarithmically with the number of records. Journal of Algorithms 8 (1987), 236-249.
38. Poblete, P. Approximating functions by their Poisson transform. Information Processing Letters 23 (1986), 127-130.
39. Prellberg, T. Uniform q-series asymptotics for staircase polygons. Journal of Physics A: Mathematics and General 28 (1995), 1289-1304.
40. Rice, S. O. The integral of the absolute value of the pinned Wienerprocess - calculation of its probability density by numerical integration. Annals of Probability 10 (1982), 240-243.
41. Sedgewick, R. Algorithms, second edn. Addison-Wesley, Reading, MA, 1988.
42. Sedgewick, R., and Flajolet, P. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA, 1996.
43. Shepp, L. A. On the integral of the absolute value of the pinned Wiener process. Annals of Probability 10 (1982), 234-239.
44. Sloane, N. J. A., and Plouffe, S. The Encyclopedia of Integer Sequences. Academic Press, New York, 1995.
45. Spencer, J. Enumerating graphs and Brownian motion. Communications on Pure and Applied Mathematics 50 (1997), 293-296.
46. Takács, L. A Bernoulli excursion and its various applications. Advances in Applied Probability 23 (1991), 557-585.
47. Takács, L. Conditional limit theorems for branching processes. Journal of Applied Mathematics and Stochastic Analysis 4(4) (1991), 263-292.
48. Takács, L. On a probability problem connected with railway traffic. Journal of Applied Mathematics and Stochastic Analysis 4(1) (1991), 1-27.
49. Takács, L. The asymptotic distribution of the total heights of random rooted trees. Acta Scientifica Mathematica (Szeged) 57 (1993), 613-625.
50. Wilf, H. S. generatingfunctionology. Academic Press, New York, 1994.
51. Wong, R. Asymptotic Approximations of Integrals. Academic Press, New York, 1989.
52. Wright, E. M. The number of connected sparsely edged graphs. Journal of Graph Theory 1 (1977), 317-330.
53. Wright, E. M. The number of connected sparsely edged graphs. II. Smooth graphs. Journal of Graph Theory 2 (1978), 299-305.
54. Wright, E. M. The number of connected sparsely edged graphs. III. Asymptotic results. Journal of Graph Theory 4 (1980), 393-407.