Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Local Reconstruction

  • Comandur SeshadhriEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_698

Years and Authors of Summarized Original Work

  • 2010; Saks, Seshadhri

Problem Definition

Consider some massive dataset represented as a function f : DR, where D is discrete and R is an arbitrary range. This dataset could be as varied as an array of numbers, a graph, a matrix, or a high-dimensional function. Datasets are often useful because they possess some property of interest. An array might be sorted, a graph might be connected, a matrix might be orthogonal, or a function might be convex. These properties are critical to the use of the dataset. Yet, due to unavoidable errors (say, in storing the dataset), these properties might not hold any longer. For example, a sorted array could become unsorted because of roundoff errors.

Can we find a function g : DR that satisfies the property and is “sufficiently close” to f? Let us formalize this question. Let \(\mathcal{P}\)

Keywords

Data reconstruction Property testing Sublinear algorithms 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Ailon N, Chazelle B, Comandur S, Liu D (2008) Property-preserving data reconstruction. Algorithmica 51(2):160–182MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Austin T, Tao T (2010) Testability and repair of hereditary hypergraph properties. Random Struct Algorithms 36(4):373–463MathSciNetzbMATHGoogle Scholar
  3. 3.
    Awasthi P, Jha M, Molinaro M, Raskhodnikova S (2012) Limitations of local filters of lipschitz and monotone functions. In: Workshop on approximation, randomization, and combinatorial optimization. Algorithms and techniques (RANDOM-APPROX), pp 374–386Google Scholar
  4. 4.
    Benjamini I, Schramm O, Shapira A (2010) Every minor-closed property of sparse graphs is testable. Adv Math 223(6):2200–2218MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Bhattacharyya A, Grigorescu E, Jha M, Jung K, Raskhodnikova S, Woodruff D (2012) Lower bounds for local monotonicity reconstruction from transitive-closure spanners. SIAM J Discret Math 26(2):618–646MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Brakerski Z (2008) Local property restoring. ManuscriptGoogle Scholar
  7. 7.
    Campagna A, Guo A, Rubinfeld R (2013) Local reconstructors and tolerant testers for connectivity and diameter. In: Workshop on approximation, randomization, and combinatorial optimization. Algorithms and techniques (RANDOM-APPROX), pp 411–424Google Scholar
  8. 8.
    Chazelle B, Seshadhri C (2011) Online geometric reconstruction. J ACM 58(4):14MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Jha M, Raskhodnikova S (2013) Testing and reconstruction of lipschitz functions with applications to data privacy. SIAM J Comput 42(2):700–731MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Kale S, Seshadhri C (2011) Testing expansion in bounded degree graphs. SIAM J Comput 40(3):709–720MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Parnas M, Ron D, Rubinfeld R (2006) Tolerant property testing and distance approximation. J Comput Syst Sci 6(72):1012–1042MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Rubinfeld R, Tamir G, Vardi S, Xie N (2011) Fast local computation algorithms. In: Proceedings of innovations in computer science, pp 223–238Google Scholar
  13. 13.
    Saks M, Seshadhri C (2006) Local monotonicity reconstruction. SIAM J Comput 39(7):2897–2926MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Sandia National LaboratoriesLivermoreUSA
  2. 2.Department of Computer Science, University of CaliforniaSanta CruzUSA