| 
|
QuoteRef: shelBA11_1978
topics >
all references >
ThesaHelp:
ACM references m-z
ThesaHelp:
references sa-sz
Topic:
search algorithms
Reference
Shell, B.A., "Median split trees: a fast lookup technique for frequently occurring keys ", Communications of the ACM, 21, 11, pp. 947-958, November 1978. Google
abstract ;;Quote: a median split tree is a balanced tree with the most frequent key at the root
ThesaHelp: ACM references m-z (280 items)
ThesaHelp: references sa-sz (237 items)
Topic: search algorithms (40 items)