Show simple item record

dc.contributor.authorGhaffari, Mohsen
dc.contributor.authorZuzic, Goran
dc.date.accessioned2022-11-15T17:07:41Z
dc.date.available2022-11-15T17:07:41Z
dc.date.issued2022-07-20
dc.identifier.isbn978-1-4503-9262-4
dc.identifier.urihttps://hdl.handle.net/1721.1/146460
dc.publisherACM|Proceedings of the 2022 ACM Symposium on Principles of Distributed Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3519270.3538429en_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 2022 ACM Symposium on Principles of Distributed Computingen_US
dc.titleUniversally-Optimal Distributed Exact Min-Cuten_US
dc.typeArticleen_US
dc.identifier.citationGhaffari, Mohsen and Zuzic, Goran. 2022. "Universally-Optimal Distributed Exact Min-Cut."
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:25:27Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-03T12:25:28Z
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