Multi-finger binary search trees

ISAAC, 2018.

Cited by: 2|Bibtex|Views34|DOI:https://doi.org/10.4230/LIPIcs.ISAAC.2018.55
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the well-studied $k$-server problem. Finger search is a popular technique for speeding up BST operations when a query sequence has locality of reference. BSTs with multiple fingers can exploit more general regularities ...More

Code:

Data:

Your rating :
0

 

Tags
Comments