activity
20062023
most citedAn O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

6 citations · 10 across the 13 of their papers we have counts for

collaborators
Showing 2017Show all

2 papers · 1 filter

cs.DS2017★ 2 cited

Biased Predecessor Search

Prosenjit Bose, Rolf Fagerberg, John Howat +1

We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data stru…

cs.CG2017

On Plane Constrained Bounded-Degree Spanners

Prosenjit Bose, Rolf Fagerberg, André van Renssen +1

Let be a finite set of points in the plane and a set of non-crossing line segments with endpoints in . The visibility graph of with respect to , denoted $Vis(P,S)…