{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T02:42:10Z","timestamp":1791513730616,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688095","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:42:45Z","timestamp":1421095365000},"page":"347-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["<i>\n              L\n              <sub>p<\/sub>\n            <\/i>\n            Testing and Learning of Discrete Distributions"],"prefix":"10.1145","author":[{"given":"Bo","family":"Waggoner","sequence":"first","affiliation":[{"name":"Harvard, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432626"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings, ACM Symp. on Theory of Computing (STOC)","volume":"6","author":"Berman P.","year":"2014","unstructured":"P. Berman , S. Raskhodnikova , and G. Yaroslavtsev . Testing with respect to'p distances . In Proceedings, ACM Symp. on Theory of Computing (STOC) , volume 6 , 2014 . P. Berman, S. Raskhodnikova, and G. Yaroslavtsev. Testing with respect to'p distances. In Proceedings, ACM Symp. on Theory of Computing (STOC), volume 6, 2014."},{"key":"e_1_3_2_1_3_1","volume-title":"Private communication","author":"Canonne C.","year":"2014","unstructured":"C. Canonne . Private communication , 2014 . In collaboration with the author. C. Canonne. Private communication, 2014. In collaboration with the author."},{"key":"e_1_3_2_1_4_1","first-page":"1203","volume-title":"SODA","author":"Chan S.-O.","unstructured":"S.-O. Chan , I. Diakonikolas , P. Valiant , and G. Valiant . Optimal algorithms for testing closeness of discrete distributions . In SODA , pages 1193{ 1203 . SIAM, 2014. S.-O. Chan, I. Diakonikolas, P. Valiant, and G. Valiant. Optimal algorithms for testing closeness of discrete distributions. In SODA, pages 1193{1203. SIAM, 2014."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198388"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.31"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9265-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"e_1_3_2_1_9_1","volume-title":"Electronic Colloquium on Computational Complexity.","author":"Goldreich O.","year":"2000","unstructured":"O. Goldreich and D. Ron . On testing expansion in bounded-degree graphs . In Electronic Colloquium on Computational Complexity. 2000 . O. Goldreich and D. Ron. On testing expansion in bounded-degree graphs. In Electronic Colloquium on Computational Complexity. 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021033"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-004-0473-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928987"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331042.2331052"}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","location":"Rehovot Israel","acronym":"ITCS'15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:03Z","timestamp":1750227183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":14,"alternative-id":["10.1145\/2688073.2688095","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688095","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}