暂无分享,去创建一个
[1] Hagit Attiya,et al. The Combinatorial Structure of Wait-Free Solvable Tasks , 2002, SIAM J. Comput..
[2] Dmitry N. Kozlov,et al. Chromatic subdivision of a simplicial complex , 2012 .
[3] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.
[4] Maurice Herlihy,et al. Distributed Computing Through Combinatorial Topology , 2013 .
[5] Dmitry N. Kozlov,et al. Combinatorial Algebraic Topology , 2007, Algorithms and computation in mathematics.
[6] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[7] Maurice Herlihy,et al. The topological structure of asynchronous computability , 1999, JACM.
[8] Michael E. Saks,et al. Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.
[9] Marshall M. Cohen. A Course in Simple-Homotopy Theory , 1973 .
[10] John Havlicek. A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes , 2004, SIAM J. Comput..