ACM references m-z
"Median split trees: a fast lookup technique for frequently occurring keys ",
Communications of the ACM, 21, 11, pp. 947-958, November 1978.
|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)