"Median Split Trees: A Fast Lookup Technique for Frequently Occurring Keys."

B. A. Sheil (1978)

> Home

Details and statistics

DOI: 10.1145/359642.359653

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cacm/Sheil78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Sheil78
B. A. Sheil:
Median Split Trees: A Fast Lookup Technique for Frequently Occurring Keys. Commun. ACM 21(11): 947-958 (1978)

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.