Show simple item record

dc.contributor.authorBender, Michael A.
dc.contributor.authorFarach-Colton, Mart?n
dc.contributor.authorKuszmaul, John
dc.contributor.authorKuszmaul, William
dc.contributor.authorLiu, Mingmou
dc.date.accessioned2022-11-15T13:16:47Z
dc.date.available2022-11-15T13:16:47Z
dc.date.issued2022-06-09
dc.identifier.isbn978-1-4503-9264-8
dc.identifier.urihttps://hdl.handle.net/1721.1/146419
dc.publisherACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3519935.3519969en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.titleOn the Optimal Time/Space Tradeoff for Hash Tablesen_US
dc.typeArticleen_US
dc.identifier.citationBender, Michael A., Farach-Colton, Mart?n, Kuszmaul, John, Kuszmaul, William and Liu, Mingmou. 2022. "On the Optimal Time/Space Tradeoff for Hash Tables."
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicensePUBLISHER_POLICY
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-03T12:10:06Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-03T12:10:06Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record