Show simple item record

dc.contributor.authorAgrawal, Kunal
dc.contributor.authorBender, Michael
dc.contributor.authorDas, Rathish
dc.contributor.authorKuszmaul, William
dc.contributor.authorPeserico, Enoch
dc.contributor.authorScquizzato, Michele
dc.date.accessioned2022-11-14T14:21:19Z
dc.date.available2022-11-14T14:21:19Z
dc.date.issued2022-07-11
dc.identifier.isbn978-1-4503-9146-7
dc.identifier.urihttps://hdl.handle.net/1721.1/146373
dc.publisherACM|Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architecturesen_US
dc.relation.isversionofhttps://doi.org/10.1145/3490148.3538577en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceACM|Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architecturesen_US
dc.titleOnline Parallel Paging with Optimal Makespanen_US
dc.typeArticleen_US
dc.identifier.citationAgrawal, Kunal, Bender, Michael, Das, Rathish, Kuszmaul, William, Peserico, Enoch et al. 2022. "Online Parallel Paging with Optimal Makespan."
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-11-03T07:47:17Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-03T07:47:18Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record