Property-preserving data reconstruction
From MaRDI portal
Publication:930593
DOI10.1007/S00453-007-9075-9zbMATH Open1147.68017OpenAlexW2141078756MaRDI QIDQ930593FDOQ930593
Nir Ailon, Seshadhri Comandur, Ding Liu, Bernard Chazelle
Publication date: 1 July 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9075-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Property testing and its connection to learning and approximation
- Self-testing/correcting with applications to numerical problems
- Robust Characterizations of Polynomials with Applications to Program Testing
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Tolerant property testing and distance approximation
- The height of a random binary search tree
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cited In (14)
- Local Property Reconstruction and Monotonicity
- Steiner transitive-closure spanners of low-dimensional posets
- Preserving data utility via BART
- Approximating convex functions via non-convex oracles under the relative noise model
- Preventing Silent Data Corruptions from Propagating During Data Reconstruction
- Limitations of local filters of Lipschitz and monotone functions
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets
- Can we locally compute sparse connected subgraphs?
- Local algorithms for sparse spanning graphs
- Sampling Correctors
- Title not available (Why is that?)
- Transitive-Closure Spanners: A Survey
- Constructing near spanning trees with few local inspections
- Local computation algorithms for graphs of non-constant degrees
This page was built for publication: Property-preserving data reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930593)
