| Title: |
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Ilias Diakonikolas |
-
University of Edinburgh, School of Informatics
|
| Daniel M. Kane |
-
University of California, San Diego, Department of CSE
-
University of California, San Diego, Department of Mathematics
|
| Vladimir Nikishkin |
-
University of Edinburgh, School of Informatics
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/focs/DiakonikolasKN15
|
| Author Comments: |
|