Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
The Power and Limitations of Static Binary Search Trees with Lazy Finger
Prosenjit Bose, Karim Douïeb, John Iacono +1
A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic o…
cs.DS2009
Layered Working-Set Trees
Prosenjit Bose, Karim Douïeb, Vida Dujmović +1
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as spl…