Show simple item record

dc.contributor.authorSornat, Krzysztof
dc.contributor.authorVassilevska Williams, Virginia
dc.contributor.authorXu, Yinzhan
dc.date.accessioned2022-07-21T17:01:04Z
dc.date.available2022-07-21T17:01:04Z
dc.date.issued2021
dc.identifier.urihttps://hdl.handle.net/1721.1/143943
dc.language.isoen
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionof10.1145/3465456.3467630en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceACMen_US
dc.titleFine-Grained Complexity and Algorithms for the Schulze Voting Methoden_US
dc.typeArticleen_US
dc.identifier.citationSornat, Krzysztof, Vassilevska Williams, Virginia and Xu, Yinzhan. 2021. "Fine-Grained Complexity and Algorithms for the Schulze Voting Method." Proceedings of the 22nd ACM Conference on Economics and Computation.
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.relation.journalProceedings of the 22nd ACM Conference on Economics and Computationen_US
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-07-21T16:55:09Z
dspace.orderedauthorsSornat, K; Vassilevska Williams, V; Xu, Yen_US
dspace.date.submission2022-07-21T16:55:10Z
mit.licensePUBLISHER_CC
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