A theory of competitive analysis for distributed algorithms

Miklos Ajtai; James Aspnes; Cynthia Dwork; Orli Waarts

oai:CiteSeerX.psu:10.1.1.74.500

A theory of competitive analysis for distributed algorithms

Authors: Miklos Ajtai
James Aspnes
Cynthia Dwork
Orli Waarts
Publication date: 1994
Publisher

Abstract

We demonstrate our method by studying the cooperative collect primitive, first abstracted by Saks, Shavit, and Woll [57]. We present two algorithms (with different strengths) for this primitive, and provide a competitive analysis for each one. \Lambd

text

Similar works

Full text

CiteSeerX

Provided original full text link

oai:CiteSeerX.psu:10.1...Last time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.