Image de couverture de livre

Private Approximations of a Convex Hull in Low Dimensions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gao, Yue, Sheffet, Or
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms Computational Geometry Cryptography and Security
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input
par: Mahpud, Bar, et autres
Publié: (2025)

Computational Hardness of Private Coreset
par: Ghazi, Badih, et autres
Publié: (2026)

Dynamic Convex Hulls for Simple Paths
par: Brewer, Bruce, et autres
Publié: (2024)

Engineering Fully Dynamic Convex Hulls
par: van der Hoog, Ivor, et autres
Publié: (2026)

Differentially Private Matchings
par: Dinitz, Michael, et autres
Publié: (2025)

Private Lossless Multiple Release
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Differentially Private Set Representations
par: Patel, Sarvar, et autres
Publié: (2025)

Space-Efficient Private Estimation of Quantiles
par: Cafaro, Massimo, et autres
Publié: (2025)

Profile Reconstruction from Private Sketches
par: Wu, Hao, et autres
Publié: (2024)

Differentially Private Ad Conversion Measurement
par: Delaney, John, et autres
Publié: (2024)

Near-Optimal Generalized Private Testing
par: Chaturvedi, Anamay, et autres
Publié: (2026)

Differentially Private Gomory-Hu Trees
par: Aamand, Anders, et autres
Publié: (2024)

Improved Differentially Private Algorithms for Rank Aggregation
par: Hillebrand, Quentin, et autres
Publié: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
par: Ghazi, Badih, et autres
Publié: (2025)

Private Synthetic Data Generation in Bounded Memory
par: Holland, Rayne, et autres
Publié: (2024)

Fast and Optimal Differentially Private Frequent-Substring Mining
par: Guo, Peaker, et autres
Publié: (2026)

Scalable Private Partition Selection via Adaptive Weighting
par: Chen, Justin Y., et autres
Publié: (2025)

Improved Lower Bound for Differentially Private Facility Location
par: Manurangsi, Pasin
Publié: (2024)

Skirting Additive Error Barriers for Private Turnstile Streams
par: Aamand, Anders, et autres
Publié: (2026)

Nearly-Optimal Private Selection via Gaussian Mechanism
par: Leeman, Ethan, et autres
Publié: (2025)

Differentially Private Algorithms for Graphs Under Continual Observation
par: Fichtenberger, Hendrik, et autres
Publié: (2021)

Differentially Private Continual Release of Histograms and Related Queries
par: Henzinger, Monika, et autres
Publié: (2023)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
par: Henzinger, Monika, et autres
Publié: (2024)

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
par: Asi, Hilal, et autres
Publié: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
par: Bernardini, Giulia, et autres
Publié: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
par: Hladík, Richard, et autres
Publié: (2024)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
par: Harrison, Charlie, et autres
Publié: (2025)

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
par: Epasto, Alessandro, et autres
Publié: (2026)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
par: Kerschbaum, Florian, et autres
Publié: (2025)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
par: Henzinger, Monika, et autres
Publié: (2024)

Differentially Private Release of Israel's National Registry of Live Births
par: Hod, Shlomi, et autres
Publié: (2024)

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
par: Aliakbarpour, Maryam, et autres
Publié: (2025)

The Price of Privacy For Approximating Max-CSP
par: Dharangutte, Prathamesh, et autres
Publié: (2026)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
par: Chandra, Rishi, et autres
Publié: (2024)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
par: Cummings, Rachel, et autres
Publié: (2025)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
par: Dhulipala, Laxman, et autres
Publié: (2025)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
par: Jain, Palak, et autres
Publié: (2024)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
par: Lebeda, Christian Janos, et autres
Publié: (2023)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
par: Afshani, Peyman, et autres
Publié: (2026)