James Aspnes
- 1.K. Abrahamson. On achieving consensus using a shared memory. In Seventh ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 1988. Google Scholar
Digital Library
- 2.~. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots. Private Communication, 1990.Google Scholar
- 3.Anderson. Composite registers. Technical Report TR- 89-25, University of Texas at Austin, September 1989. Google ScholarDigital Library
- 4.J. Aspnes and M. Herlihy. Fast randomizexl consensus using shared memory. Accepted for publication, Journal of Algorithms. Google ScholarDigital Library
- 5.1. Aspnes and M. Herlihy. Wait-flee synchronization in the asynchronous pram model. Submitted for publication.Google Scholar
- 6.H. Attiya, D. Dolev, and N. Shavit. Bounded polynomial randomize~ consensus. In Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing, pages 281-294, August 1989. Google ScholarDigital Library
- 7.B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 86-97, 1987. Google ScholarDigital Library
- 8.B. Chor and L. Moscovici. Solvability in asynchronous environments. In 30th Annual Symposium on Foundations of Computer Science, pages 422-427, October 1989.Google ScholarDigital Library
- 9.D. Dolev, C. Dwork, and L Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987. Google ScholarDigital Library
- 10.E.B. Dynkin and A.A. Yushkevich. ControlledMarkov Processes. Springer-Verlag, 1975.Google Scholar
- 11.M. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2), April 1985. Google ScholarDigital Library
- 12.M.P. Herlihy. impossibility and universality results for wait-free synchronization. In Seventh ACM SIGACT- SIGOPS Symposium on Principles of Distributed Computing, August 1988. Google ScholarDigital Library
- 13.S. Plotkin. Sticky bits and universality of consensus. In Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing, pages 159-176, August 1989. Google ScholarDigital Library
Index Terms
- Time-and space-efficient randomized consensus
Recommendations
Faster randomized consensus with an oblivious adversary
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computingTwo new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceWe prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...
Comments