Private measures, random walks, and synthetic data
From MaRDI portal
Publication:6550176
Recommendations
Cites work
- scientific article; zbMATH DE number 3746840 (Why is no real title available?)
- A (slightly) improved approximation algorithm for metric TSP
- A basic course in probability theory
- A learning theory approach to noninteractive database privacy
- Calculation of the Wasserstein Distance Between Probability Distributions on the Line
- Differentially private data releasing for smooth queries
- Distance-based classification with Lipschitz functions
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- High-dimensional probability. An introduction with applications in data science
- Minimax Optimal Procedures for Locally Private Estimation
- New inapproximability bounds for TSP
- On the geometry of differential privacy
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal Transport
- Pcps and the hardness of generating private synthetic data
- The algorithmic foundations of differential privacy
- The complexity of differential privacy
Cited in
(2)
This page was built for publication: Private measures, random walks, and synthetic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550176)