Varun Ganesan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A point set P is arborally satisfied if, for any pair of points with no shared coordinates, the box they span contains another point in P . At SODA 2009, Demaine, Harmon, Iacono, Kane, and Pǎtrascu proved a connection between the longstanding dynamic optimality conjecture about binary search trees and the problem of finding the minimum-size arborally(More)
  • 1