Searching for "Bounded Round Numbers." – sorted by Relevance.
-
Efficient Bounded Timestamping Using Traceable Use Abstraction - Is Writer's Guessing Better Than
- timestamping systems [7, 8], atomic snapshot objects [2], bounded round numbers [9]. In this paper, we
- Cited by 7 (1 self) – Add To MetaCart
-
Tight Bounds on Early Local Decisions in
- (i.e., the runs which are \synchronous" from the very beginning) we can bound the number of rounds
- Add To MetaCart
-
Modular Competitiveness for Distributed Algorithms
- algorithms for consensus, snapshots, coin ipping, bounded round numbers, timestamps, and multi
- Cited by 13 (2 self) – Add To MetaCart
-
A Theory of Competitive Analysis for Distributed Algorithms
- -memory applications, including nearly all algorithms known to us for consensus, snapshots, coin ipping, bounded round
- Cited by 30 (5 self) – Add To MetaCart
-
Spreading Rumors Rapidly Despite an Adversary
- , bounded round numbers, timestamps, and multi-writer registers) use the naive algorithm for performing
- Cited by 14 (4 self) – Add To MetaCart
-
The Complexity of Broadcasting in Planar and Decomposable Graphs
- rounds as possible. This number is called the minimum broadcasting time of the network. Broadcasting is a
- Cited by 1 (1 self) – Add To MetaCart

