{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:32Z","timestamp":1750220972882,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1703925"],"award-info":[{"award-number":["CCF-1703925"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316351","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"547-558","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Testing unateness nearly optimally"],"prefix":"10.1145","author":[{"given":"Xi","family":"Chen","sequence":"first","affiliation":[{"name":"Columbia University, USA"}]},{"given":"Erik","family":"Waingarten","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Roksana Baleshzar Deeparnab Chakrabarty Ramesh Krishnan S. Pallavoor Sofya Raskhodnikova and C. Seshadhri. 2017. A lower bound for nonadaptive onesided error testing of unateness of Boolean functions over the hypercube. arXiv preprint arXiv:1706.00053 (2017).  Roksana Baleshzar Deeparnab Chakrabarty Ramesh Krishnan S. Pallavoor Sofya Raskhodnikova and C. Seshadhri. 2017. A lower bound for nonadaptive onesided error testing of unateness of Boolean functions over the hypercube. arXiv preprint arXiv:1706.00053 (2017)."},{"key":"e_1_3_2_1_2_1","unstructured":"Roksana Baleshzar Deeparnab Chakrabarty Ramesh Krishnan S. Pallavoor Sofya Raskhodnikova and C. Seshadhri. 2017.  Roksana Baleshzar Deeparnab Chakrabarty Ramesh Krishnan S. Pallavoor Sofya Raskhodnikova and C. Seshadhri. 2017."},{"volume-title":"Unateness Testers for Real-Values Functions: Adaptivity Helps. In Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP \u20192017)","author":"Optimal","key":"e_1_3_2_1_3_1","unstructured":"Optimal Unateness Testers for Real-Values Functions: Adaptivity Helps. In Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP \u20192017) . Optimal Unateness Testers for Real-Values Functions: Adaptivity Helps. In Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP \u20192017)."},{"key":"e_1_3_2_1_4_1","volume-title":"Testing unateness of real-valued functions. arXiv preprint arXiv:1608.07652","author":"Baleshzar Roksana","year":"2016","unstructured":"Roksana Baleshzar , Meiram Murzabulatov , Ramesh Krishnan S. Pallavoor , and Sofya Raskhodnikova . 2016. Testing unateness of real-valued functions. arXiv preprint arXiv:1608.07652 ( 2016 ). Roksana Baleshzar, Meiram Murzabulatov, Ramesh Krishnan S. Pallavoor, and Sofya Raskhodnikova. 2016. Testing unateness of real-valued functions. arXiv preprint arXiv:1608.07652 (2016)."},{"key":"e_1_3_2_1_5_1","unstructured":"Aleksandrs Belovs and Eric Blais. 2016.  Aleksandrs Belovs and Eric Blais. 2016."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897567"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536437"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/13092770X"},{"key":"e_1_3_2_1_9_1","unstructured":"Deeparnab Chakrabarty and C. Seshadhri. 2018. Adaptive Boolean monotonicity testing in total influence time. (2018).  Deeparnab Chakrabarty and C. Seshadhri. 2018. Adaptive Boolean monotonicity testing in total influence time. (2018)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746570"},{"key":"e_1_3_2_1_11_1","unstructured":"Xi Chen Zhengyang Liu Rocco A. Servedio Ying Sheng and Jinyu Xie. 2018.  Xi Chen Zhengyang Liu Rocco A. Servedio Ying Sheng and Jinyu Xie. 2018."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188842"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.38"},{"key":"e_1_3_2_1_14_1","unstructured":"Xi Chen Erik Waingarten and Jinyu Xie. 2017.  Xi Chen Erik Waingarten and Jinyu Xie. 2017."},{"volume-title":"Proceedings of the 50th ACM Symposium on the Theory of Computing (STOC \u20192018)","author":"Beyond Talagrand","key":"e_1_3_2_1_15_1","unstructured":"Beyond Talagrand functions : new lower bounds for testing monotonicity and unateness . In Proceedings of the 50th ACM Symposium on the Theory of Computing (STOC \u20192018) . Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. In Proceedings of the 50th ACM Symposium on the Theory of Computing (STOC \u20192018)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.85"},{"key":"e_1_3_2_1_17_1","unstructured":"X. Chen and J. Xie. 2016.  X. Chen and J. Xie. 2016."},{"volume-title":"Bounds for the Distribution-Free Testing of Monotone Conjunctions. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Tight","key":"e_1_3_2_1_18_1","unstructured":"Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_19_1","unstructured":"E. Dolev and D. Ron. 2011.  E. Dolev and D. Ron. 2011."},{"key":"e_1_3_2_1_20_1","volume-title":"Theory of Computing 7, 1","author":"Sublinear Distribution-Free","year":"2011","unstructured":"Distribution-Free Testing for Monomials with a Sublinear Number of Queries . Theory of Computing 7, 1 ( 2011 ), 155\u2013176. Distribution-Free Testing for Monomials with a Sublinear Number of Queries. Theory of Computing 7, 1 (2011), 155\u2013176."},{"key":"e_1_3_2_1_21_1","unstructured":"Eldar Fischer Eric Lehman Ilan Newman Sofya Raskhodnikova Ronitt Rubinfeld and Alex Samorodnitsky. 2002.  Eldar Fischer Eric Lehman Ilan Newman Sofya Raskhodnikova Ronitt Rubinfeld and Alex Samorodnitsky. 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.13"},{"key":"e_1_3_2_1_25_1","unstructured":"Subhash Khot and Igor Shinkar. 2016.  Subhash Khot and Igor Shinkar. 2016."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316351","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316351","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":25,"alternative-id":["10.1145\/3313276.3316351","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316351","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}