30 citations · 82 across the 38 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Dynamic Trees with Almost-Optimal Access Cost
Mordecai Golin, John Iacono, Stefan Langerman +2
An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expens…
cs.CG2018
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
Timothy M. Chan, Yakov Nekrich, Saladi Rahul +1
In this work, we present a collection of new results on two fundamental problems in geometric data structures: orthogonal point location and rectangle stabbing. -We give the first…