暂无分享,去创建一个
[1] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[2] Ramsey Theory,et al. Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.
[3] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[4] Fabian Kuhn,et al. The price of locality: exploring the complexity of distributed coordination primitives , 2005 .
[5] Hagit Attiya,et al. Computing on an anonymous ring , 1988, JACM.
[6] Dana Angluin,et al. Finite common coverings of pairs of regular graphs , 1981, J. Comb. Theory B.
[7] Christoph Lenzen,et al. Synchronization and symmetry breaking in distributedsystems , 2011 .
[8] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[9] Sebastiano Vigna,et al. Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.
[10] Shay Kutten,et al. Efficient Distributed Weighted Matchings on Trees , 2006, SIROCCO.
[11] SuomelaJukka,et al. Lower bounds for local approximation , 2013 .
[12] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[13] Jukka Suomela,et al. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks , 2010, SPAA '10.
[14] Jukka Suomela,et al. Distributed maximal matching: greedy is optimal , 2012, PODC '12.
[15] Christoph Lenzen,et al. Leveraging Linial's Locality Limit , 2008, DISC.
[16] George W. Polites,et al. An introduction to the theory of groups , 1968 .
[17] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[18] Masafumi Yamashita,et al. Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..
[19] Roger Wattenhofer,et al. Fault-Tolerant Clustering in Ad Hoc and Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).
[20] Pierre Fraigniaud,et al. On the Impact of Identifiers on Local Decision , 2012, OPODIS.
[21] Geoffrey Exoo,et al. On the limitations of the use of solvable groups in Cayley graph cage constructions , 2010, Eur. J. Comb..
[22] Moni Naor,et al. A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring , 1991, SIAM J. Discret. Math..
[23] P. S. Aleksandrov,et al. An introduction to the theory of groups , 1960 .
[24] V. M. Kopytov,et al. Right-ordered groups , 1996 .
[25] Roger Wattenhofer,et al. Distributed Weighted Matching , 2004, DISC.
[26] Jukka Suomela. Distributed algorithms for edge dominating sets , 2010, PODC '10.
[27] Valentin Polishchuk,et al. Local algorithms in (weakly) coloured graphs , 2010, ArXiv.
[28] Mehrdad Shahshahani,et al. On the girth of random Cayley graphs , 2007, Random Struct. Algorithms.
[29] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[30] Jukka Suomela,et al. Survey of local algorithms , 2013, CSUR.
[31] Moni Naor,et al. Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[32] Mehrdad Shahshahani,et al. On the girth of random Cayley graphs , 2009 .
[33] Masafumi Yamashita,et al. Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..
[34] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[35] Dan Suciu,et al. Journal of the ACM , 2006 .
[36] M. Kaufmann. What Can Be Computed Locally ? , 2003 .
[37] Valentin Polishchuk,et al. A Local 2-Approximation Algorithm for the Vertex Cover Problem , 2009, DISC.
[38] Jukka Suomela,et al. A Bibliography of Local Algorithms , 2014 .
[39] Lauri Hella,et al. Weak models of distributed computing, with connections to modal logic , 2012, PODC '12.
[40] Roger Wattenhofer,et al. Constant Time Distributed Dominating Set Approximation , 2022 .
[41] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[42] Andrzej Czygrinow,et al. Fast Distributed Approximations in Planar Graphs , 2008, DISC.
[43] M. Gromov. Groups of polynomial growth and expanding maps , 1981 .
[44] Miroslav Chlebík,et al. Approximation hardness of edge dominating set problems , 2006, J. Comb. Optim..