Skip to main content
SpringerLink
Log in

Linear Probing and Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Stanford University, Stanford, CA 94305-9045, USA., , , , , , US

    D. E. Knuth

Authors
  1. D. E. Knuth
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received November 9, 1997; revised January 15, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Knuth, D. Linear Probing and Graphs. Algorithmica 22, 561–568 (1998). https://doi.org/10.1007/PL00009240

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009240

Search

Navigation