B. A. Sheil

Learn More
Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains two key values&#8212;a <italic>node</italic> value which is a maximally frequent key in that subtree, and a <italic>split</italic> value which partitions the remaining keys (with respect to(More)
DoradoLisp is an implementation of the Interlisp programming system on a large personal computer. It has evolved from AltoLisp, an implementation on a less powerful machine. The major goal of the Dorado implementation was to eliminate the performance deficiencies of the previous system. This paper describes the current status of the system and discusses(More)
  • 1