Brief announcement: pareto optimal solutions to consensus and set consensus
暂无分享,去创建一个
[1] Rachid Guerraoui,et al. The Complexity of Early Deciding Set Agreement: How can Topology help? , 2009, Electron. Notes Theor. Comput. Sci..
[2] Rachid Guerraoui,et al. A Topological Treatment of Early-Deciding Set-Agreement , 2006, OPODIS.
[3] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[4] Maurice Herlihy,et al. Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions , 2011, PODC '11.
[5] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.
[6] Yoram Moses,et al. Programming simultaneous actions using common knowledge , 1987, Algorithmica.
[7] Yoram Moses,et al. Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.
[8] Danny Dolev,et al. Requirements for Agreement in a Distributed System , 1982, DDB.
[9] Rachid Guerraoui,et al. The Complexity of Early Deciding Set Agreement , 2011, SIAM J. Comput..
[10] Joseph Y. Halpern,et al. Knowledge and common knowledge in a distributed environment , 1984, JACM.
[11] Ronald Fagin,et al. Reasoning about knowledge , 1995 .
[12] Michel Raynal,et al. Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes , 2005, PaCT.
[13] Joseph Y. Halpern,et al. A characterization of eventual Byzantine agreement , 1990, PODC '90.
[14] Dan Alistarh,et al. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement , 2011, Algorithmica.
[15] Nancy A. Lynch,et al. Tight bounds for k-set agreement , 2000, J. ACM.