Linear probing and graphs

Algorithmica (New York)

Volumn 22, Issue 4, 1998, Pages 561-568

  Knuth, D E ^a  

^a Stanford University   (United States)

Author keywords

Hashing; Inversions; Labeled trees; Linear probing; Parking problem; Sparse graphs

Indexed keywords

EID: 19544364512     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009240     Document Type: Article

References (12)

1. I. Gessel and D.-L. Wang, Depth-first search as a combinatorial correspondence, Journal of Combinatorial Theory, Series A 26 (1979), 308-313.
2. S. Janson, D. E. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Structures and Algorithms 4 (1993), 233-358.
3. D. E. Knuth, Seminumerical Algorithms, third edition (Reading, Massachusetts: Addison-Wesley, 1997).
4. D. E. Knuth, Sorting and Searching, second edition (Reading, Massachusetts: Addison-Wesley, 1998).
5. A. G. Konheim and B. Weiss, An occupancy discipline and applications, SIAM Journal on Applied Mathematics 14 (1966), 1266-1274.
6. G. Kreweras, Une famille de polynômes ayant plusieurs propriétés énumératives, Periodica Mathematica Hungarica 11 (1980), 309-320.
7. C. L. Mallows and J. Riordan, The inversion enumerator for labelled trees, Bulletin of the American Mathematical Society 74 (1968), 92-94.
8. R. J. Riddell, Jr., Contributions to the Theory of Condensation (Ann Arbor, Michigan: University of Michigan, 1951). The main results of this dissertation were published as R. J. Riddell, Jr., and G. E. Uhlenbeck, On the theory of the virial development of the equation of the state of monoatomic gases, Journal of Chemical Physics 21 (1953), 2056-2064.
9. R. J. Riddell, Jr., Contributions to the Theory of Condensation (Ann Arbor, Michigan: University of Michigan, 1951). The main results of this dissertation were published as R. J. Riddell, Jr., and G. E. Uhlenbeck, On the theory of the virial development of the equation of the state of monoatomic gases, Journal of Chemical Physics 21 (1953), 2056-2064.
10. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms (Reading, Massachusetts: Addison-Wesley, 1996).
11. A. Viola and P. V. Poblete, Analysis of the total displacement in linear probing hashing, presented at the third Dagstuhl Seminar in Analysis of Algorithms (9 July 1997).
12. E. M. Wright, The number of connected sparsely edged graphs, Journal of Graph Theory 1 (1977), 317-330.