Cover Image

Uniformity Testing under User-Level Local Privacy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Canonne, Clément L., Gentle, Abigail, Singhal, Vikrant
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Cryptography and Security Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Locally Private Histograms in All Privacy Regimes
by: Canonne, Clément L., et al.
Published: (2024)

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

The Discrete Gaussian for Differential Privacy
by: Canonne, Clément L., et al.
Published: (2020)

A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions
by: Singhal, Vikrant
Published: (2023)

Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

Testing Quasiperiodicity
by: Awofeso, Christine, et al.
Published: (2025)

Tight Localizations of Feedback Sets
by: Hecht, Michael, et al.
Published: (2020)

A Uniformly Random Solution to Algorithmic Redistricting
by: Cai, Jin-Yi, et al.
Published: (2024)

Nearly Tight Bounds on Testing of Metric Properties
by: Bao, Yiqiao, et al.
Published: (2024)

Not All Learnable Distribution Classes are Privately Learnable
by: Bun, Mark, et al.
Published: (2024)

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

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
by: Black, Hadley, et al.
Published: (2025)

Inverse matroid optimization under subset constraints
by: Bérczi, Kristóf, et al.
Published: (2025)

Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
by: Klimm, Max, et al.
Published: (2022)

Local Node Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2026)

A Bias-Accuracy-Privacy Trilemma for Statistical Estimation
by: Kamath, Gautam, et al.
Published: (2023)

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

On Computing Pairwise Statistics with Local Differential Privacy
by: Ghazi, Badih, et al.
Published: (2024)

Isomorphism Testing Parameterized by Genus and Beyond
by: Neuen, Daniel
Published: (2021)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
by: Antony, Dhanyamol, et al.
Published: (2023)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
by: Neuen, Daniel
Published: (2020)

A Tight Bound on Localization of Electrical Flows
by: Gurel-Gurevich, Ori, et al.
Published: (2026)

Privacy Amplification Persists under Unlimited Synthetic Data Release
by: Pierquin, Clément, et al.
Published: (2026)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
by: Bun, Mark, et al.
Published: (2026)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
by: Chakrabarty, Deeparnab, et al.
Published: (2024)

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

Prediction with Expert Advice under Local Differential Privacy
by: Jacobsen, Ben, et al.
Published: (2025)

String Matching with a Dynamic Pattern
by: Monteiro, Bruno, et al.
Published: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
by: Jordon, Addie, et al.
Published: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
by: Akmal, Shyan, et al.
Published: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
by: Mizutani, Ryuhei
Published: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
by: Bals, Ben, et al.
Published: (2025)

Approximating Submodular Matroid-Constrained Partitioning
by: Bérczi, Kristóf, et al.
Published: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
by: Veldt, Nate
Published: (2025)

(Approximate) Matrix Multiplication via Convolutions
by: Uffenheimer, Yahel, et al.
Published: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
by: Arhire, Andrei, et al.
Published: (2025)