![]() The best previous data structure with linear space, by Krizanc, Morin, and Smid (ISAAC 2003), requires O(sqrt(n) loglog n) query time. Each query consists of an input pair of indices (i, j) for which a mode of A must be returned. Given an array A of n elements, we consider a basic problem: constructing a static data structure that efficiently answers range mode queries on A.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |