Copertina

Near-Optimal Differentially Private k-Core Decomposition

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dhulipala, Laxman, Li, George Z., Liu, Quanquan C.
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms Cryptography and Security Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Fine-Grained Privacy Guarantees for Coverage Problems
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

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

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

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

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

Practical and Accurate Local Edge Differentially Private Graph Algorithms
di: Mundra, Pranay, et al.
Pubblicazione: (2025)

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

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

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

Optimal Differentially Private Sampling of Unbounded Gaussians
di: Iverson, Valentio, et al.
Pubblicazione: (2025)

The Needle is a Thread: Finding Planted Paths in Noisy Process Trees
di: Le, Maya, et al.
Pubblicazione: (2026)

Differential Privacy on Trust Graphs
di: Ghazi, Badih, et al.
Pubblicazione: (2024)

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

Necessity of Block Designs for Optimal Locally Private Distribution Estimation
di: Gentle, Abigail
Pubblicazione: (2025)

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

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
di: Lebeda, Christian Janos, et al.
Pubblicazione: (2023)

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

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
di: Harrison, Charlie, 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)

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

Sublinear Space Graph Algorithms in the Continual Release Model
di: Epasto, Alessandro, et al.
Pubblicazione: (2024)

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

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)

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

Private Mean Estimation with Person-Level Differential Privacy
di: Agarwal, Sushant, et al.
Pubblicazione: (2024)

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)

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

Optimal Rates for Differentially Private Hypothesis Testing with E-values
di: Jacobsen, Ben, et al.
Pubblicazione: (2026)

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

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

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

Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions
di: Tasnim, Naima, et al.
Pubblicazione: (2025)

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
di: Haney, Samuel, et al.
Pubblicazione: (2023)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
di: Jiang, Bo, et al.
Pubblicazione: (2024)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
di: Asi, Hilal, et al.
Pubblicazione: (2024)

Private Geometric Median in Nearly-Linear Time
di: Kumar, Syamantak, et al.
Pubblicazione: (2025)