Login / Signup

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.

Erik D. DemaineAndrea LincolnQuanquan C. LiuJayson LynchVirginia Vassilevska Williams
Published in: ITCS (2018)
Keyphrases
  • fine grained
  • worst case
  • coarse grained
  • lower bound
  • computational complexity
  • access control
  • upper bound
  • learning algorithm
  • lower and upper bounds
  • online algorithms