The Random Access Hierarchy (Preliminary Report)


To be considered fast, algorithms for operations on large data structures should operate in polylog time, i.e., with the number of steps bounded by a polynomial in log(N) where N is the size of the data structure. Example: an ordered list of reasonably short strings can be searched in log2 (N) time via binary search. To measure the time and space complexity… (More)
DOI: 10.1145/800061.808766


Figures and Tables

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

Slides referencing similar topics