Imagen de Portada

Skirting Additive Error Barriers for Private Turnstile Streams

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aamand, Anders, Chen, Justin Y., Silwal, Sandeep
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Cryptography and Security
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Differentially Private Gomory-Hu Trees
por: Aamand, Anders, et al.
Publicado: (2024)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
por: Aamand, Anders, et al.
Publicado: (2025)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
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)

Efficiently Computing Similarities to Private Datasets
por: Backurs, Arturs, et al.
Publicado: (2024)

Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation
por: Jain, Palak, et al.
Publicado: (2023)

Scalable Private Partition Selection via Adaptive Weighting
por: Chen, Justin Y., et al.
Publicado: (2025)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)

Differentially Private Clustering in Data Streams
por: Epasto, Alessandro, et al.
Publicado: (2023)

Private Continual Counting of Unbounded Streams
por: Jacobsen, Ben, et al.
Publicado: (2025)

On the Structure of Replicable Hypothesis Testers
por: Aamand, Anders, et al.
Publicado: (2025)

Improved Approximations for Hard Graph Problems using Predictions
por: Aamand, Anders, et al.
Publicado: (2025)

Learning-Augmented Frequent Directions
por: Aamand, Anders, et al.
Publicado: (2025)

Streaming Private Continual Counting via Binning
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)

Near-Optimal Generalized Private Testing
por: Chaturvedi, Anamay, et al.
Publicado: (2026)

Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)

Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)

Differentially Private Ad Conversion Measurement
por: Delaney, John, et al.
Publicado: (2024)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Private Synthetic Data Generation in Bounded Memory
por: Holland, Rayne, et al.
Publicado: (2024)

Almost Tight Error Bounds on Differentially Private Continual Counting
por: Henzinger, Monika, et al.
Publicado: (2022)

Fast and Optimal Differentially Private Frequent-Substring Mining
por: Guo, Peaker, et al.
Publicado: (2026)

Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)

Nearly-Optimal Private Selection via Gaussian Mechanism
por: Leeman, Ethan, et al.
Publicado: (2025)

Differentially Private Algorithms for Graphs Under Continual Observation
por: Fichtenberger, Hendrik, et al.
Publicado: (2021)

Differentially Private Continual Release of Histograms and Related Queries
por: Henzinger, Monika, et al.
Publicado: (2023)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
por: Harrison, Charlie, et al.
Publicado: (2025)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
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)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
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)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
por: Jain, Palak, 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)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
por: Harrison, Charlie, et al.
Publicado: (2025)