|
|
Conferences in DBLP
- Uri Abraham, Shai Ben-David, Shlomo Moran
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:1-8 [Conf]
- Mustaque Ahamad, James E. Burns, Phillip W. Hutto, Gil Neiger
Causal Memory. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:9-30 [Conf]
- Efthymios Anagnostou, Ran El-Yaniv
More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms (Preliminary Report). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:31-51 [Conf]
- James H. Anderson, Bojan Groselj
Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:52-70 [Conf]
- Anish Arora, Shlomi Dolev, Mohamed G. Gouda
Maintaining Digital Clocks In Step. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:71-79 [Conf]
- Hagit Attiya
Implementing FIFO Queus and Stacks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:80-94 [Conf]
- Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
Optimal Amortized Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:95-107 [Conf]
- Rida A. Bazzi, Gil Neiger
Optimally Simulating Crash Failures in a Byzantine Environment. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:108-128 [Conf]
- Piotr Berman, Juan A. Garay
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:129-142 [Conf]
- Gabriel Bracha, Ophir Rachman
Randomized Consensus in Expected O(n²log n) Operations. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:143-150 [Conf]
- Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch
Using Adaptive Timeouts to Achive At-Most-Once Message Delivery. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:151-166 [Conf]
- Shlomi Dolev, Amos Israeli, Shlomo Moran
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:167-180 [Conf]
- Yung-Chen Hung, Gen-Huey Chen
The Quickest Path Problem in Distributed Computing Systems. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:181-192 [Conf]
- Alon Itai
The Communication Complexity of the Two List Problem. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:193-199 [Conf]
- Giuseppe F. Italiano
Distributed Algorithms for Updating Shortest Paths (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:200-211 [Conf]
- Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd
Minimal Shared Information for Concurrent Reading and Writing. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:212-228 [Conf]
- Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:229-241 [Conf]
- Yossi Malka, Sergio Rajsbaum
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:242-253 [Conf]
- Keith Marzullo, Gil Neiger
Detection of Global State Predicates. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:254-272 [Conf]
- Keith Marzullo, Laura S. Sabel
Using Consistent Subcuts for Detecting Stable Properties. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:273-288 [Conf]
- Michael Merritt, Gadi Taubenfeld
Atomic m-Register Operations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:289-294 [Conf]
- Sampath Rangarajan, Satish K. Tripathi
A Robust Distributed Mutual Exclusion Algorithm. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:295-308 [Conf]
- Lior Shabtay, Adrian Segall
Message Delaying Synchronizers. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:309-318 [Conf]
|
