Kostya Ross

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
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the k least numbers in one of the lists. We first solve the problem in O(k log(n)) time for queries and O(log(n)) time for updates using the tournament tree data structure, where n is(More)
  • 1