Login / Signup
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds.
Kasper Green Larsen
Omri Weinstein
Huacheng Yu
Published in:
Electron. Colloquium Comput. Complex. (2017)
Keyphrases
</>
data structure
lower bound
upper bound
worst case
dynamic environments
information retrieval
objective function
np hard
data types
set of randomly generated instances
efficient data structures
space efficient
upper and lower bounds
boolean functions
quadtree
search algorithm
database systems