External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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. Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA. Volume 94 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Authors

Erik D. Demaine

This author has not been identified. Look up 'Erik D. Demaine' in Google

Andrea Lincoln

This author has not been identified. Look up 'Andrea Lincoln' in Google

Quanquan C. Liu

This author has not been identified. Look up 'Quanquan C. Liu' in Google

Jayson Lynch

This author has not been identified. Look up 'Jayson Lynch' in Google

Virginia Vassilevska Williams

This author has not been identified. Look up 'Virginia Vassilevska Williams' in Google
runs on