6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DS2011★ 6 cited
Upper Bounds for Maximally Greedy Binary Search Trees
Kyle Fox
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der…
cs.DS2010
Online Scheduling on Identical Machines using SRPT
Kyle Fox, Benjamin Moseley
Due to its optimality on a single machine for the problem of minimizing average flow time, Shortest-Remaining-Processing-Time (\srpt) appears to be the most natural algorithm to co…