1994 · 59 citations · 8 references
ComputingComputer ScienceAlgorithmsDistributed SystemsTheory Of ComputationAlgorithm AnalysisDistributed AlgorithmsDistributed ComputingRandomized AlgorithmsRandomized ComputationLower Bounds For Randomized AlgorithmsRandomized Distributed AlgorithmsResponse Time Bounds
Article Free Access Share on Proving time bounds for randomized distributed algorithms Authors: Nancy Lynch Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MAView Profile , Isaac Saias Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MAView Profile , Roberto Segala Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computingAugust 1994 Pages 314–323https://doi.org/10.1145/197917.198117Published:14 August 1994Publication History 45citation508DownloadsMetricsTotal Citations45Total Downloads508Last 12 Months10Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
8
Automatic verification of probabilistic concurrent finite state programs
Moshe Y. Vardi · 1985 · 675 citations
Another advantage of free choice (Extended Abstract)
Michael Ben-Or · 1983 · 575 citations · Full text
Fast randomized consensus using shared memory
James Aspnes, Maurice Herlihy · Journal of Algorithms · 1990 · 260 citations · Full text
On the andvantages of free choice
Daniel Lehmann, Michael O. Rabin · 1981 · 226 citations
Verification of multiprocess probabilistic protocols
Amir Pnueli, Lenore D. Zuck · Distributed Computing · 1986 · 121 citations