18 citations · 72 across the 35 of their papers we have counts for
4 papers · 1 filter
Weighted dynamic finger in binary search trees
John Iacono, Stefan Langerman
It is shown that the online binary search tree data structure GreedyASS performs asymptotically as well on a sufficiently long sequence of searches as any static binary search tree…
Spanning Properties of Theta-Theta-6
Mirela Damian, John Iacono, Andrew Winslow
We show that, unlike the Yao-Yao graph , the Theta-Theta graph defined by six cones is a spanner for sets of points in convex position. We also show that, for sets of…
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…
Subquadratic Encodings for Point Configurations
Jean Cardinal, Timothy M. Chan, John Iacono +2
For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation o…