| 
|
QuoteRef: tarjRE3_1987
topics >
all references >
ThesaHelp:
references t-z
ThesaHelp:
ACM references m-z
Topic:
search algorithms
Topic:
efficiency
Topic:
understanding systems
Reference
Tarjan, R.E., "Algorithm design", Communications of the ACM, 30, 3, pp. 204-212, March 1987, Turing award lecture. Google
210 ;;Quote: a retrieval in a splay tree moves the retrieved node to the root, halves the length of the access path, and slightly increases other access paths
211 ;;Quote: conjecture that splay trees are optimal for binary search under amortized costs
212 ;;Quote: need a programming language that is easy to understand and efficient to execute; currently too detailed or too inefficient
ThesaHelp: references t-z (309 items)
ThesaHelp: ACM references m-z (280 items)
Topic: search algorithms (40 items)
Topic: efficiency (96 items)
Topic: understanding systems (48 items)