Topology in Distributed Computing
暂无分享,去创建一个
[1] Leslie Lamport,et al. Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.
[2] Nicola Santoro,et al. Time is Not a Healer , 1989, STACS.
[3] Bernadette Charron-Bost,et al. Revisiting Safety and Liveness in the Context of Failures , 2000, CONCUR.
[4] Shlomo Moran,et al. Closed schedulers: a novel technique for analyzing asynchronous protocols , 1995, Distributed Computing.
[5] Maurice Herlihy,et al. Algebraic spans , 1995, PODC '95.
[6] Danny Dolev,et al. On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[7] Yoram Moses,et al. A Layered Analysis of Consensus , 2002, SIAM J. Comput..
[8] H. Herrlich,et al. Category theory : an introduction , 1973 .
[9] R. Ho. Algebraic Topology , 2022 .
[10] Michael E. Saks,et al. Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.
[11] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[12] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[13] Maurice Herlihy,et al. The asynchronous computability theorem for t-resilient tasks , 1993, STOC.
[14] Faith Ellen,et al. Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.
[15] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..