"Linear Probing: The Probable Largest Search Time Grows Logarithmically ..."

Boris G. Pittel (1987)

> Home

Details and statistics

DOI: 10.1016/0196-6774(87)90040-X

access: closed

type: Journal Article

metadata version: 2019-07-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Pittel87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Pittel87
Boris G. Pittel:
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. J. Algorithms 8(2): 236-249 (1987)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.