Local Computation Algorithms
暂无分享,去创建一个
[1] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[2] Pavel Berkhin,et al. Bookmark-Coloring Algorithm for Personalized PageRank Computing , 2006, Internet Math..
[3] Fabian Kuhn,et al. Distributed approximation of capacitated dominating sets , 2007, SPAA.
[4] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[5] Roger Wattenhofer,et al. A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.
[6] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[7] Jennifer Widom,et al. Scaling personalized web search , 2003, WWW '03.
[8] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[9] Yuichi Yoshida,et al. An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.
[10] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.
[11] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[12] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[13] Roger Wattenhofer,et al. A new technique for distributed symmetry breaking , 2010, PODC '10.
[14] Moni Naor,et al. Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[15] András A. Benczúr,et al. To randomize or not to randomize: space optimal summaries for hyperlink analysis , 2006, WWW '06.
[16] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[17] Noga Alon,et al. A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.
[18] L. Lovász. Combinatorial problems and exercises , 1979 .
[19] Bernard Chazelle,et al. Online geometric reconstruction , 2006, SCG '06.
[20] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[21] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1985, JACM.
[22] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[23] Michael E. Saks,et al. Local Monotonicity Reconstruction , 2010, SIAM J. Comput..
[24] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[25] Fan Chung Graham,et al. Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[26] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[27] Fabian Kuhn. Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time , 2009, STACS.
[28] Leonid Barenboim,et al. Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.
[29] Noga Alon,et al. Single Round Simulation on Radio Networks , 1992, J. Algorithms.
[30] Dana Ron,et al. Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.
[31] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[32] Andrew V. Goldberg,et al. Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..