Toward more localized local algorithms: removing assumptions concerning global knowledge
暂无分享,去创建一个
Jean-Sébastien Sereni | Laurent Viennot | Amos Korman | L. Viennot | Amos Korman | Jean-Sébastien Sereni
[1] Andrzej Pelc,et al. Communication algorithms with advice , 2010, J. Comput. Syst. Sci..
[2] Shay Kutten,et al. Tight Fault Locality , 2000, SIAM J. Comput..
[3] Christoph Lenzen,et al. What can be approximated locally?: case study: dominating sets in planar graphs , 2008, SPAA '08.
[4] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.
[5] Shay Kutten,et al. Distributed verification of minimum spanning trees , 2006, PODC '06.
[6] Leonid Barenboim,et al. Distributed deterministic edge coloring using bounded neighborhood independence , 2011, PODC.
[7] Andrew V. Goldberg,et al. Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] Leonid Barenboim,et al. Distributed deterministic edge coloring using bounded neighborhood independence , 2011, PODC '11.
[9] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.
[10] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[11] Pierre Fraigniaud,et al. Local MST computation with short advice , 2007, SPAA.
[12] Leonid Barenboim,et al. Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.
[13] Shay Kutten,et al. Proof labeling schemes , 2005, PODC '05.
[14] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[15] Sundar Vishwanathan,et al. Locality based graph coloring , 1993, STOC.
[16] Roger Wattenhofer,et al. A new technique for distributed symmetry breaking , 2010, PODC '10.
[17] Pierre Fraigniaud,et al. Local MST Computation with Short Advice , 2007, SPAA '07.
[18] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[19] Stephan Olariu,et al. Uniform leader election protocols for radio networks , 2001, International Conference on Parallel Processing, 2001..
[20] Andrzej Pelc,et al. Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.
[21] Roger Wattenhofer,et al. An optimal maximal independent set algorithm for bounded-independence graphs , 2010, Distributed Computing.
[22] Nico Eigenmann. ( Δ + 1 )-COLORING IN LINEAR ( IN Δ ) TIME , 2009 .
[23] Richard Cole,et al. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.
[24] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[25] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[26] Leonid Barenboim,et al. Deterministic Distributed Vertex Coloring in Polylogarithmic Time , 2010, JACM.
[27] Aravind Srinivasan,et al. On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.
[28] Pierre Fraigniaud,et al. Local Distributed Decision , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[29] Nathan Linial,et al. Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[30] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[31] Alessandro Panconesi,et al. On the distributed complexity of computing maximal matchings , 1997, SODA '98.
[32] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[33] M. Kaufmann. What Can Be Computed Locally ? , 2003 .
[34] Boaz Patt-Shamir,et al. Distributed approximate matching , 2007, PODC '07.
[35] Fabian Kuhn. Weak graph colorings: distributed algorithms and applications , 2009, SPAA '09.
[36] Alessandro Panconesi,et al. Some simple distributed algorithms for sparse networks , 2001, Distributed Computing.
[37] Andrzej Pelc,et al. Drawing maps with advice , 2010, J. Parallel Distributed Comput..
[38] Bilel Derbel,et al. On the locality of distributed sparse spanner construction , 2008, PODC '08.
[39] Reuven Cohen,et al. Label-guided graph exploration by a finite automaton , 2005, TALG.