2 papers
cs.DS2016
A Linear Potential Function for Pairing Heaps
John Iacono, Mark Yagnatinsky
We present the first potential function for pairing heaps with linear range. This implies that the runtime of a short sequence of operations is faster than previously known. It is…
cs.CG2013
How To Place a Point to Maximize Angles
Boris Aronov, Mark V. Yagnatinsky
We describe a randomized algorithm that, given a set of points in the plane, computes the best location to insert a new point , such that the Delaunay triangulation of $P\cu…