Linear probing and graphs
<|reference_start|>Linear probing and graphs: Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connected graphs in 1977, and Kreweras related the inversions of trees to the so-called ``parking problem'' in 1980. A~combination of these three results leads to a surprisingly simple analysis of the behavior of hashing by linear probing, including higher moments of the cost of successful search.<|reference_end|>
@article{knuth1998linear,
    title={Linear probing and graphs},
    author={Donald E. Knuth},
    journal={Algorithmica 22 (1998), no. 4, 561--568},
    year={1998},
    number={Knuth migration 11/2004},
    archivePrefix={arXiv},
    eprint={cs/9801103},
    primaryClass={cs.DS}
}