Can We Locally Compute Sparse Connected Subgraphs?
暂无分享,去创建一个
[1] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[2] Leonid Barenboim,et al. Deterministic Distributed Vertex Coloring in Polylogarithmic Time , 2010, JACM.
[3] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[4] David Zuckerman,et al. List-decoding reed-muller codes over small fields , 2008, STOC '08.
[5] Ronitt Rubinfeld,et al. A Local Algorithm for Constructing Spanners in Minor-Free Graphs , 2016, APPROX-RANDOM.
[6] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..
[7] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[8] Ronitt Rubinfeld,et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time , 2005, SIAM J. Comput..
[9] Paolo Ferragina,et al. A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.
[10] Sofya Raskhodnikova,et al. Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy , 2013, SIAM J. Comput..
[11] Avinatan Hassidim,et al. Local computation mechanism design , 2013, EC.
[12] Leonid Barenboim,et al. Distributed (Delta+1)-Coloring in Linear (in Delta) Time , 2014, SIAM J. Comput..
[13] Roberto Grossi,et al. Squeezing succinct data structures into entropy bounds , 2006, SODA '06.
[14] Rodrigo González,et al. Statistical Encoding of Succinct Data Structures , 2006, CPM.
[15] Ronitt Rubinfeld,et al. Local Reconstructors and Tolerant Testers for Connectivity and Diameter , 2012, APPROX-RANDOM.
[16] Roger Wattenhofer,et al. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.
[17] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[18] Roger Wattenhofer,et al. A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.
[19] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[20] Yishay Mansour,et al. A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.
[21] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[22] Dana Ron,et al. Best of Two Local Models: Local Centralized and Local Distributed Algorithms , 2014, ArXiv.
[23] Ronitt Rubinfeld,et al. Local Algorithms for Sparse Spanning Graphs , 2014, APPROX-RANDOM.
[24] Zeyuan Allen Zhu,et al. Flow-Based Algorithms for Local Graph Clustering , 2013, SODA.
[25] David Peleg,et al. The Hardness of Approximating Spanner Problems , 1999, Theory of Computing Systems.
[26] Moni Naor,et al. What Can be Computed Locally? , 1995, SIAM J. Comput..
[27] Artur Czumaj,et al. Sublinear-Time Algorithms , 2006, Bull. EATCS.
[28] Alejandro Cornejo,et al. Local distributed algorithms for multi-robot systems , 2013 .
[29] Leonid Barenboim,et al. Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.
[30] Bernard Chazelle,et al. Property-Preserving Data Reconstruction , 2004, Algorithmica.
[31] Artur Czumaj,et al. Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time , 2009, SIAM J. Comput..
[32] Ronitt Rubinfeld,et al. Constructing near spanning trees with few local inspections , 2015, Random Struct. Algorithms.
[33] Joan Feigenbaum,et al. Random-Self-Reducibility of Complete Sets , 1993, SIAM J. Comput..
[34] Ronitt Rubinfeld,et al. Local Computation Algorithms for Graphs of Non-Constant Degrees , 2015, SPAA.
[35] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[36] Vahab S. Mirrokni,et al. Local Computation of PageRank Contributions , 2007, Internet Math..
[37] Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons , 2009, Distributed Computing.
[38] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[39] Jennifer Widom,et al. Scaling personalized web search , 2003, WWW '03.
[40] Leonid Barenboim,et al. The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[41] Shubhangi Saraf,et al. Local list-decoding and testing of random linear codes from high error , 2010, STOC '10.
[42] Roger Wattenhofer,et al. A new technique for distributed symmetry breaking , 2010, PODC '10.
[43] Yuval Peres,et al. Noise Tolerance of Expanders and Sublinear Expansion Reconstruction , 2013, SIAM J. Comput..
[44] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[45] David Peleg,et al. An Optimal Synchronizer for the Hypercube , 1989, SIAM J. Comput..
[46] Dana Ron,et al. Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.
[47] Fabian Kuhn,et al. Distributed approximation of capacitated dominating sets , 2007, SPAA.
[48] Pierre Fraigniaud,et al. Local Distributed Decision , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[49] Ronitt Rubinfeld,et al. Fast Local Computation Algorithms , 2011, ICS.
[50] Silvio Lattanzi,et al. A Local Algorithm for Finding Well-Connected Clusters , 2013, ICML.
[51] Ronitt Rubinfeld,et al. Learning Polynomials with Queries: The Highly Noisy Case , 2000, SIAM J. Discret. Math..
[52] Mohsen Ghaffari,et al. An Improved Distributed Algorithm for Maximal Independent Set , 2015, SODA.
[53] Krzysztof Onak,et al. Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[54] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.
[55] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[56] András A. Benczúr,et al. To randomize or not to randomize: space optimal summaries for hyperlink analysis , 2006, WWW '06.
[57] Nancy A. Lynch,et al. Keeping Mobile Robot Swarms Connected , 2009, DISC.
[58] Moni Naor,et al. Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[59] Ronitt Rubinfeld,et al. A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support , 2013, 2013 Data Compression Conference.
[60] Michael E. Saks,et al. Local Monotonicity Reconstruction , 2010, SIAM J. Comput..
[61] Yuval Peres,et al. Finding sparse cuts locally using evolving sets , 2008, STOC '09.
[62] Sergey Yekhanin,et al. Private information retrieval , 2010, CACM.
[63] Fan Chung Graham,et al. Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[64] Sofya Raskhodnikova,et al. Limitations of Local Filters of Lipschitz and Monotone Functions , 2015, TOCT.
[65] Krzysztof Onak,et al. A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size , 2011, SODA.
[66] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.
[67] Fabian Kuhn. Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time , 2009, STACS.
[68] Pavel Berkhin,et al. Bookmark-Coloring Algorithm for Personalized PageRank Computing , 2006, Internet Math..
[69] Yishay Mansour,et al. Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.
[70] Kyomin Jung,et al. Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners , 2012, SIAM J. Discret. Math..
[71] Amnon Ta-Shma,et al. Local List Decoding with a Constant Number of Queries , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[72] S. Muthukrishnan,et al. Workload-Optimal Histograms on Streams , 2005, ESA.
[73] Yuichi Yoshida,et al. An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.
[74] Noga Alon,et al. Space-efficient local computation algorithms , 2011, SODA.
[75] Moti Medina,et al. Non-local Probes Do Not Help with Many Graph Problems , 2016, DISC.