Storing a Sparse Table with O(1) Worst Case Access Time
Michael L. FredmanJános KomlósEndre SzemerédiPublished in: FOCS (1982)
Keyphrases
- worst case
- average case
- error bounds
- data structure
- lower bound
- sparse data
- approximation algorithms
- high dimensional
- database
- sparse representation
- worst case analysis
- sparse matrix
- random access
- greedy algorithm
- np hard
- data sets
- database management systems
- upper bound
- information systems
- compressed sensing
- theoretical guarantees
- remote access
- machine learning