Recommendations
- Private Approximation of Search Problems
- Private approximation of NP-hard functions
- The Asymptotic Capacity of Private Search
- Theory of Cryptography
- scientific article; zbMATH DE number 2090941
- Near-optimal private approximation protocols via a black box transformation
- Privately solving linear programs
- Differentially private combinatorial optimization
- Privacy-preserving linear and nonlinear approximation via linear programming
- Private approximation of clustering and vertex cover
Cited in
(13)- How Should We Solve Search Problems Privately?
- Functionally private approximations of negligibly-biased estimators
- Private Approximation of Clustering and Vertex Cover
- Private Approximation of Search Problems
- Fast Private Norm Estimation and Heavy Hitters
- Differentially private combinatorial optimization
- Private multiparty sampling and approximation of vector combinations
- How should we solve search problems privately?
- Private approximation of NP-hard functions
- Private approximation of clustering and vertex cover
- scientific article; zbMATH DE number 975414 (Why is no real title available?)
- Brief announcement: Zero-knowledge protocols for search problems
- scientific article; zbMATH DE number 2222198 (Why is no real title available?)
This page was built for publication: Private approximation of search problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931376)
