var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-journal.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-journal.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-journal.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Optimal Rates for Nonparametric Density Estimation Under Communication Constraints.\n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Singh, A. V.; and Tyagi, H.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 70(3): 1939–1961. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{AcharyaCST:24,\n  author       = {Jayadev Acharya and\n                  Cl{\\'{e}}ment L. Canonne and\n                  Aditya Vikram Singh and\n                  Himanshu Tyagi},\n  title        = {Optimal Rates for Nonparametric Density Estimation Under Communication\n                  Constraints},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {70},\n  number       = {3},\n  pages        = {1939--1961},\n  year         = {2024}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Interactive Inference Under Information Constraints.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Liu, Y.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n IEEE Transactions on Information Theory, 68(1): 502–516. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"InteractivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 63 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ACLST:22,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Yuhan Liu and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Interactive Inference Under Information Constraints},\n  journal   = {{IEEE} Transactions on Information Theory},\n  volume    = {68},\n  number    = {1},\n  pages     = {502--516},\n  year      = {2022},\n  url       = {https://arxiv.org/abs/2007.10976},\n  doi       = {10.1109/TIT.2021.3123905},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Discrete Gaussian for Differential Privacy.\n \n \n \n \n\n\n \n Canonne, C. L.; and Steinke, G. K. T.\n\n\n \n\n\n\n Journal of Privacy and Confidentiality (JPC), 12(1). July 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CKS:22,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Gautam Kamath\n               Thomas Steinke},\n  title     = {The Discrete Gaussian for Differential Privacy},\n  volume    = {12}, \n  url       = {https://journalprivacyconfidentiality.org/index.php/jpc/article/view/784}, \n  DOI       = {10.29012/jpc.784}, \n  number    = {1}, \n  journal   = {Journal of Privacy and Confidentiality (JPC)},\n  year      = {2022}, \n  month     = jul\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Inference Under Information Constraints III: Local Privacy Constraints.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Freitag, C.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n IEEE Journal on Selected Areas in Information Theory, 2(1): 253-267. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InferencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 53 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ACT:IT3,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Cody Freitag and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Inference Under Information Constraints {III:} Local Privacy Constraints},\n  journal   = {{IEEE} Journal on Selected Areas in Information Theory},\n  year      = {2021},\n  volume    = {2},\n  number    = {1},\n  pages     = {253-267},\n  doi       = {10.1109/JSAIT.2021.3053569},\n  url       = {https://arxiv.org/abs/2101.07981}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Tyagi, H.\n\n\n \n\n\n\n IEEE Transactions on Information Theory, 66(12): 7835–7855. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"InferencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 70 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ACT:IT1,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Himanshu Tyagi},\n  title     = {Inference Under Information Constraints {I:} Lower Bounds From Chi-Square Contraction},\n  journal   = {{IEEE} Transactions on Information Theory},\n  volume    = {66},\n  number    = {12},\n  pages     = {7835--7855},\n  year      = {2020},\n  doi       = {10.1109/TIT.2020.3028440},\n  url       = {https://arxiv.org/abs/1812.11476}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Inference Under Information Constraints II: Communication Constraints and Shared Randomness.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Tyagi, H.\n\n\n \n\n\n\n IEEE Transactions on Information Theory, 66(12): 7856–7877. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"InferencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 44 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ACT:IT2,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Himanshu Tyagi},\n  title     = {Inference Under Information Constraints {II:} Communication Constraints and Shared Randomness},\n  journal   = {{IEEE} Transactions on Information Theory},\n  volume    = {66},\n  number    = {12},\n  pages     = {7856--7877},\n  year      = {2020},\n  doi       = {10.1109/TIT.2020.3028439},\n  url       = {https://arxiv.org/abs/1905.08302}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Bayesian Networks.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Kane, D. M.; and Stewart, A.\n\n\n \n\n\n\n IEEE Transactions on Information Theory, 66(5): 3132–3170. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 52 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CDKS:20,\n  author = {Canonne, Cl{\\'{e}}ment L. and\n            Diakonikolas, Ilias and\n            Kane, Daniel M. and\n            Stewart, Alistair},\n  title     = {Testing {B}ayesian Networks},\n  journal   = {{IEEE} Transactions on Information Theory},\n  volume    = {66},\n  number    = {5},\n  pages     = {3132--3170},\n  year      = {2020},\n  doi       = {10.1109/TIT.2020.2971625},\n  url       = {https://arxiv.org/abs/1612.03156}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Distribution Testing Lower Bounds via Reductions from Communication Complexity.\n \n \n \n\n\n \n Blais, E.; Canonne, C. L.; and Gur, T.\n\n\n \n\n\n\n ACM Transactions on Computation Theory, 11(2): 6:1–6:37. 2019.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 59 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{BCG:19,\n author = {Blais, Eric and Canonne, Cl{\\'e}ment L. and Gur, Tom},\n title = {Distribution Testing Lower Bounds via Reductions from Communication Complexity},\n journal = {ACM Transactions on Computation Theory},\n issue_date = {April 2019},\n volume = {11},\n number = {2},\n year = {2019},\n issn = {1942-3454},\n pages = {6:1--6:37},\n articleno = {6},\n numpages = {37},\n doi = {10.1145/3305270},\n publisher = {ACM}\n} \n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing $k$-Monotonicity: The Rise and Fall of Boolean Functions.\n \n \n \n \n\n\n \n Canonne, C. L.; Grigorescu, E.; Guo, S.; Kumar, A.; and Wimmer, K.\n\n\n \n\n\n\n Theory of Computing, 15(1): 1–55. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CGGKW:19,\n author = {Canonne, Cl{\\'{e}}ment L. and Grigorescu, Elena and Guo, Siyao and Kumar, Akash and Wimmer, Karl},\n title = {Testing $k$-Monotonicity: The Rise and Fall of {Boolean} Functions},\n year = {2019},\n pages = {1--55},\n doi = {10.4086/toc.2019.v015a001},\n publisher = {Theory of Computing},\n journal = {Theory of Computing},\n volume = {15},\n number = {1},\n url = {http://www.theoryofcomputing.org/articles/v015a001},\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism.\n \n \n \n \n\n\n \n Blais, E.; Canonne, C. L.; Eden, T.; Levi, A.; and Ron, D.\n\n\n \n\n\n\n ACM Transactions on Computation Theory, 11(4): 24:1–24:33. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"TolerantPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 63 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{BCELR:19,\n   author = {Blais, Eric and Canonne, Cl{\\'e}ment L. and Eden, Talya and Levi, Amit and Ron, Dana},\n   title = {Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism},\n   journal = {ACM Transactions on Computation Theory},\n   issue_date = {September 2019},\n   volume = {11},\n   number = {4},\n   year = {2019},\n   issn = {1942-3454},\n   pages = {24:1--24:33},\n   articleno = {24},\n   numpages = {33},\n   doi = {10.1145/3337789},\n   acmid = {3337789},\n   publisher = {ACM},\n   url       = {https://arxiv.org/abs/1607.03938}\n} \n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Chasm Between Identity and Equivalence Testing with Conditional Queries.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Kamath, G.\n\n\n \n\n\n\n Theory of Computing, 14(19): 1–46. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ACK:18,\n author = {Acharya, Jayadev and Canonne, Cl{\\'{e}}ment L. and Kamath, Gautam},\n title = {A Chasm Between Identity and Equivalence Testing with Conditional Queries},\n year = {2018},\n pages = {1--46},\n doi = {10.4086/toc.2018.v014a019},\n publisher = {Theory of Computing},\n journal = {Theory of Computing},\n volume = {14},\n number = {19},\n url = {http://www.theoryofcomputing.org/articles/v014a019},\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Adaptivity Hierarchy Theorem for Property Testing.\n \n \n \n \n\n\n \n Canonne, C. L.; and Gur, T.\n\n\n \n\n\n\n computational complexity, 27(4): 671–716. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 39 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CG:18,\n  author    = {Canonne, Cl{\\'{e}}ment L. and\n               Gur, Tom},\n  title     = {An Adaptivity Hierarchy Theorem for Property Testing},\n  journal   = {computational complexity},\n  year      = {2018},\n  volume    = 27,\n  number    = 4,\n  pages     = {671--716},\n  doi       = {10.1007/s00037-018-0168-4},\n  url       = {https://arxiv.org/abs/1702.05678}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sampling correctors.\n \n \n \n \n\n\n \n Canonne, C. L.; Gouleakis, T.; and Rubinfeld, R.\n\n\n \n\n\n\n SIAM Journal on Computing, 47(4): 1373–1423. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"SamplingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CGR:18,\n    author = {Canonne, Cl\\'{e}ment L. and Gouleakis, Themis and Rubinfeld,\n              Ronitt},\n     title = {Sampling correctors},\n   journal = {SIAM Journal on Computing},\n    volume = {47},\n      year = {2018},\n    number = {4},\n     pages = {1373--1423},\n      issn = {0097-5397},\n       doi = {10.1137/16M1076666},\n       url = {https://doi.org/10.1137/16M1076666},\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Shape Restrictions of Discrete Distributions.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Gouleakis, T.; and Rubinfeld, R.\n\n\n \n\n\n\n Theory of Computing Systems, 62(1): 4–62. 2018.\n Invited issue for STACS 2016.\n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 59 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CDGR:17:ToCS,\n  author    = {Canonne, Cl\\'ement L. and Diakonikolas, Ilias and Gouleakis, Themis and Rubinfeld, Ronitt},\n  title     = {Testing Shape Restrictions of Discrete Distributions},\n  journal   = {Theory of Computing Systems},\n  doi       = {10.1007/s00224-017-9785-6},\n  volume    = {62},\n  number    = {1},\n  pages     = {4--62},\n  year      = {2018},\n  note      = {Invited issue for STACS 2016.},\n  url       = {https://arxiv.org/abs/1507.03558}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Communication With Imperfectly Shared Randomness.\n \n \n \n \n\n\n \n Canonne, C. L.; Guruswami, V.; Meka, R.; and Sudan, M.\n\n\n \n\n\n\n IEEE Transactions on Information Theory, 63(10): 6799–6818. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"CommunicationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 34 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CGMS:17,\n  author    = {Canonne, Cl{\\'{e}}ment L. and\n               Guruswami, Venkatesan and\n               Meka, Raghu and\n               Sudan, Madhu},\n  title     = {Communication With Imperfectly Shared Randomness},\n  journal   = {{IEEE} Transactions on Information Theory},\n  volume    = {63},\n  number    = {10},\n  pages     = {6799--6818},\n  year      = {2017},\n  doi       = {10.1109/TIT.2017.2734103},\n  url       = {https://arxiv.org/abs/1411.3603}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Testing probability distributions using conditional samples.\n \n \n \n \n\n\n \n Canonne, C. L.; Ron, D.; and Servedio, R. A.\n\n\n \n\n\n\n SIAM Journal on Computing (SICOMP), 44(3): 540-616. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 46 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CRS:12:SICOMP,\n  author    = {Canonne, Cl{\\'e}ment L. and\n               Ron, Dana and\n               Servedio, Rocco A.},\n  title     = {Testing probability distributions using conditional samples},\n  journal   = {{SIAM} {J}ournal on {C}omputing ({SICOMP})},\n  volume    = {44},\n  number    = {3},\n  pages      = {540-616},\n  year      = {2015},\n  doi       = {10.1137/130945508},\n  url       = {https://arxiv.org/abs/1211.2664}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);