Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
From MaRDI portal
Publication:2840991
DOI10.1137/110840741zbMath1271.68197OpenAlexW2161906179MaRDI QIDQ2840991
Madhav Jha, Sofya Raskhodnikova
Publication date: 24 July 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110840741
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20) Authentication, digital signatures and secret sharing (94A62) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (12)
Testing Lipschitz functions on hypergrid domains ⋮ Parameterized property testing of functions ⋮ Bounded invariant verification for time-delayed nonlinear networked dynamical systems ⋮ Can we locally compute sparse connected subgraphs? ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Erasure-Resilient Property Testing ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Local computation algorithms for graphs of non-constant degrees ⋮ Unnamed Item ⋮ Testing piecewise functions ⋮ Limitations of Local Filters of Lipschitz and Monotone Functions ⋮ Unnamed Item
This page was built for publication: Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
