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.

Tight Bounds for Parallel Paging and Green Paging

Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato. Tight Bounds for Parallel Paging and Green Paging. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 3022-3041, SIAM, 2022. [doi]

Authors

Kunal Agrawal

This author has not been identified. Look up 'Kunal Agrawal' in Google

Michael A. Bender

This author has not been identified. Look up 'Michael A. Bender' in Google

Rathish Das

This author has not been identified. Look up 'Rathish Das' in Google

William Kuszmaul

This author has not been identified. Look up 'William Kuszmaul' in Google

Enoch Peserico

This author has not been identified. Look up 'Enoch Peserico' in Google

Michele Scquizzato

This author has not been identified. Look up 'Michele Scquizzato' in Google
runs on