Show simple item record

dc.contributor.authorRadeva, Tsvetomira
dc.contributor.authorLynch, Nancy Ann
dc.date.accessioned2012-09-26T16:23:21Z
dc.date.available2012-09-26T16:23:21Z
dc.date.issued2011
dc.date.submitted2011
dc.identifier.urihttp://hdl.handle.net/1721.1/73185
dc.description.abstractPartial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we show that such labeling is not necessary and outline a simpler direct proof of the acyclicity property.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-0726514)en_US
dc.description.sponsorshipUnited States. Air Force Office of Scientific Research (Grant FA9550-08-1-0159)en_US
dc.description.sponsorshipAkamai Technologies, Inc. (Presidential Fellowship)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1993806.1993880en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleBrief Announcement: Partial Reversal Acyclicityen_US
dc.typeArticleen_US
dc.identifier.citationTsvetomira Radeva and Nancy Lynch. "Brief Announcement: Partial Reversal Acyclicity." In Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11). ACM, New York, NY, USA, 353-354.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorRadeva, Tsvetomira
dc.contributor.mitauthorLynch, Nancy Ann
dc.relation.journalProceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsRadeva, Tsvetomira; Lynch, Nancyen
dc.identifier.orcidhttps://orcid.org/0000-0003-3045-265X
dc.identifier.orcidhttps://orcid.org/0000-0003-1261-6681
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record