Linear probing: the probable largest search time grows logarithmically with the number of records

  • Authors:
  • B. Pittel

  • Affiliations:
  • -

  • Venue:
  • Journal of Algorithms
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract