Space-efficient local computation algorithms

Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called local computation algorithms. In this model, a computation problem F may have more than one legal solution and each of them consists of many bits. The local computation algorithm for F should answer in an online fashion, for any index i, the ith bit of some legal solution of F. Further, all the answers given by the algorithm should be consistent with at least one solution of F. In this work, we continue the study of local computation algorithms. In particular, we develop a technique which under certain conditions can be applied to construct local computation algorithms that run not only in polylogarithmic time but also in polylogarithmic space. Moreover, these local computation algorithms are easily parallelizable and can answer all parallel queries consistently. Our main technical tools are pseudorandom numbers with bounded independence and the theory of branching processes.

[1]  Bernard Chazelle,et al.  Online geometric reconstruction , 2006, SCG '06.

[2]  Moni Naor,et al.  What Can be Computed Locally? , 1995, SIAM J. Comput..

[3]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[4]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[5]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[6]  Moni Naor,et al.  Derandomized Constructions of k-Wise (Almost) Independent Permutations , 2005, Algorithmica.

[7]  Roger Wattenhofer,et al.  On the complexity of distributed graph coloring , 2006, PODC '06.

[8]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Fabian Kuhn,et al.  Distributed Approximation of Capacitated Dominating Sets , 2007, SPAA '07.

[10]  Sofya Raskhodnikova,et al.  Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Bernard Chazelle,et al.  Property-Preserving Data Reconstruction , 2004, Algorithmica.

[12]  Fabian Kuhn.  Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time , 2009, STACS.

[13]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[14]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..

[15]  Moni Naor,et al.  Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[16]  Noga Alon,et al.  A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.

[17]  Dana Ron,et al.  Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.

[18]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[19]  R. Otter.  The Multiplicative Process , 1949 .

[20]  Yuichi Yoshida,et al.  An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.

[21]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[22]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[23]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[24]  Krzysztof Onak,et al.  New sublinear methods in the struggle against classical problems , 2010 .

[25]  Michael E. Saks,et al.  Local Monotonicity Reconstruction , 2010, SIAM J. Comput..