Private Lossless Multiple Release
Fuente:
arXiv
Guardado en:
| Autores principales: | Andersson, Joel Daniel, Retschmeier, Lukas, Nelson, Boel, Pagh, Rasmus |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024)
por: Pagh, Rasmus, et al.
Publicado: (2024)
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024)
por: Pagh, Rasmus, et al.
Publicado: (2024)
Streaming Private Continual Counting via Binning
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
A Smooth Binary Mechanism for Efficient Private Continual Observation
por: Andersson, Joel Daniel, et al.
Publicado: (2023)
por: Andersson, Joel Daniel, et al.
Publicado: (2023)
PLAN: Variance-Aware Private Mean Estimation
por: Aumüller, Martin, et al.
Publicado: (2023)
por: Aumüller, Martin, et al.
Publicado: (2023)
Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)
por: Wu, Hao, et al.
Publicado: (2024)
Count on Your Elders: Laplace vs Gaussian Noise
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
Continual Counting with Gradual Privacy Expiration
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
The Correlated Gaussian Sparse Histogram Mechanism
por: Lebeda, Christian Janos, et al.
Publicado: (2024)
por: Lebeda, Christian Janos, et al.
Publicado: (2024)
Improved Accuracy for Private Continual Cardinality Estimation in Fully Dynamic Streams via Matrix Factorization
por: Andersson, Joel Daniel, et al.
Publicado: (2026)
por: Andersson, Joel Daniel, et al.
Publicado: (2026)
Differentially Private Continual Release of Histograms and Related Queries
por: Henzinger, Monika, et al.
Publicado: (2023)
por: Henzinger, Monika, et al.
Publicado: (2023)
Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)
por: Dinitz, Michael, et al.
Publicado: (2025)
Differentially Private Release of Israel's National Registry of Live Births
por: Hod, Shlomi, et al.
Publicado: (2024)
por: Hod, Shlomi, et al.
Publicado: (2024)
Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)
por: Patel, Sarvar, et al.
Publicado: (2025)
Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)
por: Cafaro, Massimo, et al.
Publicado: (2025)
Differentially Private Ad Conversion Measurement
por: Delaney, John, et al.
Publicado: (2024)
por: Delaney, John, et al.
Publicado: (2024)
Near-Optimal Generalized Private Testing
por: Chaturvedi, Anamay, et al.
Publicado: (2026)
por: Chaturvedi, Anamay, et al.
Publicado: (2026)
Differentially Private Gomory-Hu Trees
por: Aamand, Anders, et al.
Publicado: (2024)
por: Aamand, Anders, et al.
Publicado: (2024)
Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)
por: Hillebrand, Quentin, et al.
Publicado: (2025)
Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)
por: Ghazi, Badih, et al.
Publicado: (2025)
Private Synthetic Data Generation in Bounded Memory
por: Holland, Rayne, et al.
Publicado: (2024)
por: Holland, Rayne, et al.
Publicado: (2024)
Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)
por: Epasto, Alessandro, et al.
Publicado: (2024)
Scalable Private Partition Selection via Adaptive Weighting
por: Chen, Justin Y., et al.
Publicado: (2025)
por: Chen, Justin Y., et al.
Publicado: (2025)
Nearly-Optimal Private Selection via Gaussian Mechanism
por: Leeman, Ethan, et al.
Publicado: (2025)
por: Leeman, Ethan, et al.
Publicado: (2025)
Fast and Optimal Differentially Private Frequent-Substring Mining
por: Guo, Peaker, et al.
Publicado: (2026)
por: Guo, Peaker, et al.
Publicado: (2026)
Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)
por: Manurangsi, Pasin
Publicado: (2024)
Skirting Additive Error Barriers for Private Turnstile Streams
por: Aamand, Anders, et al.
Publicado: (2026)
por: Aamand, Anders, et al.
Publicado: (2026)
Differentially Private Algorithms for Graphs Under Continual Observation
por: Fichtenberger, Hendrik, et al.
Publicado: (2021)
por: Fichtenberger, Hendrik, et al.
Publicado: (2021)
Private Counting of Distinct Elements in the Turnstile Model and Extensions
por: Henzinger, Monika, et al.
Publicado: (2024)
por: Henzinger, Monika, et al.
Publicado: (2024)
Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
por: Harrison, Charlie, et al.
Publicado: (2025)
por: Harrison, Charlie, et al.
Publicado: (2025)
Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)
por: Bernardini, Giulia, et al.
Publicado: (2024)
Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)
por: Hladík, Richard, et al.
Publicado: (2024)
Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
por: Kerschbaum, Florian, et al.
Publicado: (2025)
por: Kerschbaum, Florian, et al.
Publicado: (2025)
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
por: Henzinger, Monika, et al.
Publicado: (2024)
por: Henzinger, Monika, et al.
Publicado: (2024)
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)
por: Cummings, Rachel, et al.
Publicado: (2025)
Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)
por: Chandra, Rishi, et al.
Publicado: (2024)
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
por: Dhulipala, Laxman, et al.
Publicado: (2025)
por: Dhulipala, Laxman, et al.
Publicado: (2025)
Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
por: Jain, Palak, et al.
Publicado: (2024)
por: Jain, Palak, et al.
Publicado: (2024)
Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
por: Lyu, Xin, et al.
Publicado: (2024)
por: Lyu, Xin, et al.
Publicado: (2024)
Differential Privacy with Multiple Selections
por: Goel, Ashish, et al.
Publicado: (2024)
por: Goel, Ashish, et al.
Publicado: (2024)
Ejemplares similares
-
Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024) -
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024) -
Streaming Private Continual Counting via Binning
por: Andersson, Joel Daniel, et al.
Publicado: (2024) -
A Smooth Binary Mechanism for Efficient Private Continual Observation
por: Andersson, Joel Daniel, et al.
Publicado: (2023) -
PLAN: Variance-Aware Private Mean Estimation
por: Aumüller, Martin, et al.
Publicado: (2023)