Comparison graphs: a unified method for uniformity testing

DOI10.4230/LIPICS.ITCS.2021.17MaRDI QIDQ7229302zbMATH OpenFDO

Authors Uri Meir

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.17

zbMATH Keywords

comparison graphsdistributed algorithmsdistribution testingstreaming algorithmsuniformity testing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
• An automatic inequality prover and instance optimal identity testing
• Can Distributed Uniformity Testing Be Local?
• Collision-based Testers are Optimal for Uniformity and Closeness
• Distributed uniformity testing
• scientific article; zbMATH DE number 7758323 (Why is no real title available?)
• Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction
• Inference Under Information Constraints II: Communication Constraints and Shared Randomness
• Introduction to Property Testing
• Property testing and its connection to learning and approximation
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution
• Two Party Distribution Testing: Communication and Security

This page was built for publication: Comparison graphs: a unified method for uniformity testing

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