2 citations · 2 across the 2 of their papers we have counts for
3 papers
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.DS2010★ 2 cited
Should Static Search Trees Ever Be Unbalanced?
Prosenjit Bose, Karim Douïeb
In this paper we study the question of whether or not a static search tree should ever be unbalanced. We present several methods to restructure an unbalanced k-ary search tree …
cs.CG2010
Odds-On Trees
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measu…