Iwona Bialynicka-Birula

Learn More
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + l) time, where t(n) is the cost of traversing the structure and l ≤ n is the number of reported items satisfying the query. In this paper we focus on rank-sensitive data structures, which are additionally given a(More)
  • 1