New Techniques and Tighter Bounds for Local Computation Algorithms

@article{Reingold2016NewTA,
  title={New Techniques and Tighter Bounds for Local Computation Algorithms},
  author={Omer Reingold and Shai Vardi},
  journal={J. Comput. Syst. Sci.},
  year={2016},
  volume={82},
  pages={1180-1200}
}
Given an input x, and a search problem F , local computation algorithms (LCAs) implement access to specified locations of y in a legal output y ∈ F (x), using polylogarithmic time and space. Mansour et al., (2012), had previously shown how to convert certain online algorithms to LCAs. In this work, we expand on that line of work and develop new techniques for designing LCAs and bounding their space and time complexity. Our contributions are fourfold: (1) We significantly improve the running… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 39 references

A Local Computation Approximation Scheme to Maximum Matching

APPROX-RANDOM • 2013
View 5 Excerpts
Highly Influenced

Algorithmic and analysis techniques in property testing , Found

Ron Dana
Trends Theor . Comput . Sci . • 2016

Survey of local algorithms

ACM Comput. Surv. • 2013
View 1 Excerpt