Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy

DOI10.1109/FOCS.2011.13MaRDI QIDQ5494982zbMATH OpenFDO

Authors Madhav Jha, Sofya Raskhodnikova

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2011.13

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60)

Cited in

(9)

• Local algorithms for sparse spanning graphs
• Local correction with constant error rate
• Improved approximation for the directed spanner problem
• Steiner transitive-closure spanners of low-dimensional posets
• Steiner transitive-closure spanners of low-dimensional posets
• Sampling correctors
• Transitive-closure spanners: a survey
• On the probe complexity of local computation algorithms
• Space-efficient local computation algorithms

This page was built for publication: Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494982)