Rank-Sensitive Data Structures

Abstract

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)
DOI: 10.1007/11575832_10

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics