Lower Bounds for Oblivious Data Structures.
Riko JacobKasper Green LarsenJesper Buus NielsenPublished in: SODA (2019)
Keyphrases
- lower bound
- data structure
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- upper and lower bounds
- lower and upper bounds
- optimal solution
- lower bounding
- objective function
- vc dimension
- data types
- main memory
- index structure
- quadratic assignment problem
- efficient data structures
- worst case
- suffix tree
- online algorithms
- set of randomly generated instances
- neural network
- multidimensional data
- quadtree
- peer to peer
- domain specific
- database systems