Login / Signup
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy.
Erik D. Demaine
Andrea Lincoln
Quanquan C. Liu
Jayson Lynch
Virginia Vassilevska Williams
Published in:
CoRR (2017)
Keyphrases
</>
fine grained
lower bound
worst case
coarse grained
computational complexity
tightly coupled
memory efficient
access control
space complexity
massively parallel
learning algorithm
average case complexity
online algorithms
branch and bound
data management
upper bound
relational databases
data structure