Can Distributed Uniformity Testing Be Local?

DOI10.1145/3293611.3331613MaRDI QIDQ5145212zbMATH OpenOpenAlexWikidataFDO

Authors Uri Meir, Dor Minzer, Rotem Oshman

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3293611.3331613

zbMATH Keywords

Boolean analysisdistributed computinguniformity testing

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Distributed uniformity testing
• Sample-optimal identity testing with high probability
• The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution
• Distribution testing lower bounds via reductions from communication complexity
• Two Party Distribution Testing: Communication and Security

Cited in

(5)

• Does adaptive testing violate local independence?
• What Can be Sampled Locally?
• Topics and Techniques in Distribution Testing: A Biased but Representative Sample
• Sampling and output estimation in distributed algorithms and LCAs
• Comparison graphs: a unified method for uniformity testing

This page was built for publication: Can Distributed Uniformity Testing Be Local?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145212)