Property-preserving data reconstruction
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1857651 (Why is no real title available?)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Distribution-free property testing
- Property testing and its connection to learning and approximation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- The height of a random binary search tree
- Tolerant property testing and distance approximation
Cited in
(17)- Can we locally compute sparse connected subgraphs?
- Preventing Silent Data Corruptions from Propagating During Data Reconstruction
- Sampling correctors
- Limitations of local filters of Lipschitz and monotone functions
- Local property reconstruction and monotonicity
- Steiner transitive-closure spanners of low-dimensional posets
- Steiner transitive-closure spanners of low-dimensional posets
- Preserving data utility via BART
- Constructing near spanning trees with few local inspections
- Transitive-closure spanners: a survey
- Local monotonicity reconstruction
- Limitations of local filters of Lipschitz and monotone functions
- Local algorithms for sparse spanning graphs
- Local computation algorithms for graphs of non-constant degrees
- Approximating convex functions via non-convex oracles under the relative noise model
- Algorithms and Computation
- Space-efficient local computation algorithms
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)