Self-adjusting $k$-ary search-trees
Murray Sherk
J. Algorithms
19(1):25–44, Jul 1995
Cites:
Offline algorithms for dynamic minimum spanning tree problems
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine