Show simple item record

dc.contributor.authorBiswas, Amartya Shankha
dc.contributor.authorDory, Michal
dc.contributor.authorGhaffari, Mohsen
dc.contributor.authorMitrovic, Slobodan
dc.contributor.authorNazari, Yasamin
dc.date.accessioned2022-10-24T17:06:43Z
dc.date.available2022-10-24T17:06:43Z
dc.date.issued2021-07-06
dc.identifier.isbn978-1-4503-8070-6
dc.identifier.urihttps://hdl.handle.net/1721.1/145969
dc.publisherACM|Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROMen_US
dc.relation.isversionofhttps://doi.org/10.1145/3409964.3461784en_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 33rd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROMen_US
dc.titleMassively Parallel Algorithms for Distance Approximation and Spannersen_US
dc.typeArticleen_US
dc.identifier.citationBiswas, Amartya Shankha, Dory, Michal, Ghaffari, Mohsen, Mitrovic, Slobodan and Nazari, Yasamin. 2021. "Massively Parallel Algorithms for Distance Approximation and Spanners."
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-10-20T14:15:11Z
dc.language.rfc3066en
dc.rights.holderACM
dspace.date.submission2022-10-20T14:15:11Z
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