Lower bounds for randomized mutual exclusion
暂无分享,去创建一个
Eyal Kushilevitz | Yishay Mansour | David Zuckerman | Michael O. Rabin | Y. Mansour | M. Rabin | E. Kushilevitz | David Zuckerman
[1] Hagit Attiya,et al. Better Computing on the Anonymous Ring , 1991, J. Algorithms.
[2] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[3] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[4] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[5] Eyal Kushilevitz,et al. Randomized mutual exclusion algorithms revisited , 1992, PODC '92.
[6] Andrew Chi-Chih Yao,et al. On the improbability of reaching Byzantine agreements , 1989, STOC '89.
[7] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[8] Edsger W. Dijkstra,et al. Solution of a problem in concurrent programming control , 1965, CACM.
[9] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[10] Amos Israeli,et al. On processor coordination using asynchronous hardware , 1987, PODC '87.
[11] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[12] Gabriel Bracha,et al. An O(lg n) expected rounds randomized Byzantine generals protocol , 1985, STOC '85.
[13] Michael O. Rabin,et al. N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..
[14] Hagit Attiya,et al. Better Computing on the Anonymous Ring , 1988, J. Algorithms.
[15] Isaac Saias,et al. Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion , 1992, PODC '92.
[16] Nancy A. Lynch,et al. Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable , 1982, JACM.
[17] Gabriel Bracha,et al. An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.