暂无分享,去创建一个
[1] R. Ho. Algebraic Topology , 2022 .
[2] Eli Gafni,et al. Three-Processor Tasks Are Undecidable , 1999, SIAM J. Comput..
[3] Petr Kuznetsov,et al. A generalized asynchronous computability theorem , 2013, PODC.
[4] Maurice Herlihy,et al. The topological structure of asynchronous computability , 1999, JACM.
[5] Maurice Herlihy,et al. An algorithmic approach to the asynchronous computability theorem , 2018, J. Appl. Comput. Topol..
[6] Petr Kuznetsov,et al. An Asynchronous Computability Theorem for Fair Adversaries , 2018, PODC.
[7] Dmitry N. Kozlov,et al. Chromatic subdivision of a simplicial complex , 2012 .
[8] Maurice Herlihy,et al. The decidability of distributed decision tasks (extended abstract) , 1997, STOC '97.
[9] Maurice Herlihy,et al. Distributed Computing Through Combinatorial Topology , 2013 .
[10] Eli Gafni,et al. A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.
[11] Petr Kuznetsov,et al. Read-Write Memory and k-Set Consensus as an Affine Task , 2016, OPODIS.
[12] Maurice Herlihy,et al. Asynchronous Computability Theorems for t-Resilient Systems , 2016, DISC.