Copertina

Differentially Private Substring and Document Counting with Near-Optimal Error

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bernardini, Giulia, Bille, Philip, Gørtz, Inge Li, Steiner, Teresa Anna
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Cryptography and Security
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Private Counting of Distinct Elements in the Turnstile Model and Extensions
di: Henzinger, Monika, et al.
Pubblicazione: (2024)

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

String Indexing with Compressed Patterns
di: Bille, Philip, et al.
Pubblicazione: (2019)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
di: Raskhodnikova, Sofya, et al.
Pubblicazione: (2024)

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

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
di: Dhulipala, Laxman, et al.
Pubblicazione: (2025)

Count on Your Elders: Laplace vs Gaussian Noise
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Continual Counting with Gradual Privacy Expiration
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

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

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

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

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

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
di: Cummings, Rachel, et al.
Pubblicazione: (2025)

Near-Optimal Differentially Private k-Core Decomposition
di: Dhulipala, Laxman, et al.
Pubblicazione: (2023)

Differentially Private Matchings
di: Dinitz, Michael, et al.
Pubblicazione: (2025)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
di: Kerschbaum, Florian, et al.
Pubblicazione: (2025)

Differentially Private Set Representations
di: Patel, Sarvar, et al.
Pubblicazione: (2025)

Differentially Private Ad Conversion Measurement
di: Delaney, John, et al.
Pubblicazione: (2024)

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

Skirting Additive Error Barriers for Private Turnstile Streams
di: Aamand, Anders, et al.
Pubblicazione: (2026)

Triangle Counting with Local Edge Differential Privacy
di: Eden, Talya, et al.
Pubblicazione: (2023)

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

String Indexing for Top-$k$ Close Consecutive Occurrences
di: Bille, Philip, et al.
Pubblicazione: (2020)

Improved Lower Bound for Differentially Private Facility Location
di: Manurangsi, Pasin
Pubblicazione: (2024)

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

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

Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
di: Lebeda, Christian Janos, et al.
Pubblicazione: (2025)

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
di: Hillebrand, Quentin, et al.
Pubblicazione: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
di: Henzinger, Monika, et al.
Pubblicazione: (2024)

Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
di: Henzinger, Monika, et al.
Pubblicazione: (2025)

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2025)

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

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
di: Chandra, Rishi, et al.
Pubblicazione: (2024)

Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates
di: Zhao, Puning, et al.
Pubblicazione: (2024)

The Fine-Grained Complexity of Episode Matching
di: Bille, Philip, et al.
Pubblicazione: (2021)

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

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
di: Asi, Hilal, et al.
Pubblicazione: (2024)

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

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
di: Dong, Wei, et al.
Pubblicazione: (2024)