Miklos Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts  Home/Search
Context Related
| yale.edu/homes/aspnes/focs94full.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu/homes/aspnes...directory (more) Homepages: J.Aspnes |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Bartal, Fiat, and Rabani [18], and of Awerbuch, Kutten, and Peleg [16], in the context of data management and job scheduling. In these papers, as well... (Update)
Context of citations to this paper: More
.... c such that for all A in A, I in I, and E in E , cost(A; I; E) k Delta cost(A ; I; E) c: 2 These terms were suggested by [AADW94] Worst Case vs. Best Case Inputs. A more useful measure arises if one assumes that the inputs are not shared between the candidate and the...
...is the measure of performance. There is an adversary who controls timing of the processes in an asynchronous computation. Ajtai et al. [1] showed that the problem for n processes can be solved deterministically with work O(n 3=2 log n) by an adaptation of the algorithm of...
Cited by: More
Gossiping to Reach Consensus - Chlebus, Kowalski (2002) (Correct)
Collective Asynchronous Reading with Polylogarithmic.. - Chlebus, Kowalski.. (Correct)
The Do-All Problem in Broadcast Networks - Chlebus, Kowalski (2001) (Correct)
Similar documents (at the sentence level):
22.6%: A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes, Dwork, Waarts (1994) (Correct)
Active bibliography (related documents): More All
1.9: Modular Competitiveness for Distributed Algorithms - Aspnes, Waarts (2000) (Correct)
1.9: A Modular Measure of Competitive Performance for Distributed.. - Aspnes, Waarts (1995) (Correct)
1.0: Spreading Rumors Rapidly Despite an Adversary - James Aspnes William (1998) (Correct)
Similar documents based on text: More All
0.5: Fairness in Scheduling - Ajtai, Aspnes, Naor, Rabani.. (1997) (Correct)
0.3: Sparser: A paradigm for running distributed algorithms - Afek, Ricklin (1990) (Correct)
0.3: Fairness in Scheduling (Extended Abstract) - Ajtai, Aspnes, Naor, Rabani.. (1995) (Correct)
Related documents from co-citation: More All
13: Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
10: Competitive Algorithms for Distributed Data Management - Bartal, Fiat et al.
9: Optimal Time Randomized Consensus- Making Resilient Algorithms Fast in Practice (context) - Saks, Shavit et al. - 1991
BibTeX entry: (Update)
M. Ajtai, J. Aspnes, C. Dwork and O. Waarts, A Theory of Competitive Analysis for Distributed Algorithms, Proc. 36th IEEE FOCS (1994) 401--411. http://citeseer.ist.psu.edu/ajtai03theory.html More
@inproceedings{ ajtai94theory,
author = "Miklos Ajtai and James Aspnes and Cynthia Dwork and Orli Waarts",
title = "A Theory of Competitive Analysis for Distributed Algorithms",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "401--411",
year = "1994",
url = "citeseer.ist.psu.edu/ajtai03theory.html" }
Citations (may not include all citations):264 Knowledge and Common Knowledge in a Distributed Environment - Halpern, Moses - 1990
104 Sparse Partitions (context) - Awerbuch, Peleg - 1990
101 Competitive algorithms for distributed data management - Bartal, Fiat et al. - 1992
94 Knowledge and Common Knowledge in a Byzantine Environment: C.. (context) - Dwork, Moses - 1990
78 Fast randomized consensus using shared memory - Aspnes, Herlihy - 1990
77 Amortized eciency of list update and paging rules (context) - Sleator, Tarjan - 1985
66 Beyond Competitive Analysis - Koutsoupias, Papadimitriou - 1994
61 Immediate atomic snapshots and fast renaming (context) - Borowsky, Gafni - 1993
59 Bounded Time Stamps (context) - Israeli, Li - 1987
58 Programming Simultaneous Actions Using Common Knowledge - Moses, Tuttle - 1988
55 On achieving consensus using a shared memory (context) - Abrahamson - 1988
52 Parts I and II (context) - Lamport, Communication - 1986
46 On processor coordination using asynchronous hardware (context) - Chor, Israeli et al. - 1987
45 Wait-Free Data Structures in the Asynchronous PRAM Model - Aspnes, Herlihy - 1990
42 Early Stopping in Byzantine Agreement (context) - Dolev, Reischuk et al. - 1990
36 Wait-free Parallel Algorithms for the Union-Find Problem - Anderson, Woll - 1991
35 Optimal time randomized consensus | making resilient algorit.. (context) - Saks, Shavit et al. - 1991
34 Time-lapse snapshots - Dwork, Herlihy et al. - 1992
32 Atomic Shared Register Access by Asynchronous Hardware (context) - Vitanyi, Awerbuch - 1986
31 Competitive distributed job scheduling (context) - Awerbuch, Kutten et al. - 1992
30 Bounded Concurrent Time-Stamp Systems are Constructible (context) - Dolev, Shavit - 1989
27 as Good as Synchronous PRAMs (context) - Martel, Subramonian et al. - 1990
24 Randomized consensus in expected O (context) - Bracha, Rachman - 1991
23 Concurrent Timestamping Made Simple - Gawlick, Lynch et al. - 1992
23 A Characterization of Eventual Byzantine Agreement - Halpern, Moses et al. - 1990
22 Atomic Snapshots in O (context) - Attiya, Rachman - 1993
22 Randomized consensus in expected O (context) - Aspnes, Waarts - 1992
20 Randomized wait-free concurrent objects (context) - Herlihy - 1991
19 Lower bounds on the competitive ratio for mobile user tracki.. (context) - Alon, Kalai et al. - 1992
19 Linear Programming Without the Matrix (context) - Papadimitriou, Yannakakis - 1993
18 Reading Many Variables in One Atomic Operation Solutions Wit.. - Kirousis, Spirakis et al. - 1991
17 Fault-Tolerant Decision Making in Totally Asynchronous Distr.. (context) - Bridgeland, Watro - 1987
15 Time-optimal message-ecient work performance in the presence.. (context) - Prisco, Mayer et al. - 1994
15 A Concurrent Time-Stamp Scheme which is Linear in Time and S.. (context) - Israeli, Pinhasov - 1991
14 Optimal Clock Synchronization under Different Delay Assumpti.. - Attiya, Herzberg et al. - 1993
13 A Theory of Clock Synchronization (context) - Patt-Shamir, Rajsbaum - 1994
13 Ecient Robust Parallel Computations (context) - Kedem, Palem et al. - 1990
12 Ecient Parallel Algorithms Can Be Made Robust (context) - Kanellakis, Shvartsman
11 Bounded Round Numbers (context) - Dwork, Herlihy et al. - 1993
11 Constructions of permutation arrays for certain scheduling c.. (context) - Naor, Roth
11 Common knowledge and consistent simultaneous coordination - Neiger, Tuttle - 1990
10 Competitive distributed le allocation (context) - Awerbuch, Bartal et al. - 1993
10 Using Consensus to solve Atomic Snapshots (context) - Chandra, Dwork
10 Time- and space-ecient randomized consensus (context) - Aspnes - 1993
9 th ACM Symposium on Principles of Distributed Computing (context) - Anderson, Proc - 1990
9 Generating pseudo-random permutations and maximum- ow algori.. (context) - Alon - 1990
8 the Complexity of Certi ed Write-All Algorithms (context) - Martel, Subramonian - 1993
7 th ACM Symposium on Principles of Distributed Computing (context) - Afek, Attiya et al. - 1990
6 Simple and Ecient Bounded Concurrent Timestamping or Bounded.. (context) - Dwork, Waarts - 1992
5 Accomplishing Work in the Presence of Failures (context) - Dwork, Halpern et al. - 1992
3 Using knowledge to achieve consistent coordination in distri.. (context) - Neiger - 1990
3 Sacri cing Serializability to Attain High Availablity of Dat.. (context) - Fischer, Michael - 1982
3 A competitive distributed translator for k-server algorithms (context) - Bartal, Rosen et al. - 1992
3 Ecient bounded timestamping using traceable use abstraction .. (context) - Haldar - 1993
1 Local optimization of global objectives: Comptitive distribu.. (context) - Awerbuch, Azar - 1994
1 Ecient atomic snapshots using lattice agreement (context) - Attiya, Herlihy et al. - 1992
1 Certi ed Write-All on a Strongly Asynchronous PRAM (context) - Buss, Ragde - 1990
1 Combining Tentative and De nitie Algorithms for Very Fast De.. (context) - Kedem, Palem et al. - 1991
1 Ecient Robust Parallel Computations (context) - Kanellakis, Shvartsman - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs-www.cs.yale.edu/homes/aspnes/directory.html): More
Fault-tolerant Routing in Peer-to-peer Systems - Aspnes, Diamadi, Shah (2003) (Correct)
Load Balancing and Locality in Range-Queriable Data - Aspnes, Kirsch, Krishnamurthy (2004) (Correct)
Computation in Networks of Passively Mobile.. - Angluin, Aspnes.. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC