2 citations · 4 across the 3 of their papers we have counts for
3 papers
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…
cs.CG2010★ 2 cited
Point Location in Disconnected Planar Subdivisions
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let be a (possibly disconnected) planar subdivision and let be a probability measure over . The current paper shows how to preprocess into an O(n) size data s…