{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:59:27Z","timestamp":1775282367832,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Motwani Postdoctoral Fellowship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1749750,1412958"],"award-info":[{"award-number":["1749750,1412958"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188800","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"363-375","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved pseudorandomness for unordered branching programs through local monotonicity"],"prefix":"10.1145","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"Cornell University, USA \/ Institute for Advanced Study at Princeton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pooya","family":"Hatami","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishay","family":"Tal","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030308"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.19"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a007"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.57"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.11"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.10"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/120871626"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.23"},{"key":"e_1_3_2_2_9_1","first-page":"712","volume-title":"Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA)","author":"Engebretsen L.","year":"2002","unstructured":"{EIO02} L. Engebretsen , P. Indyk , and R. O\u2019Donnell . Derandomized dimensionality reduction with applications . In Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA) , pages 705\u2013 712 , 2002 . {EIO02} L. Engebretsen, P. Indyk, and R. O\u2019Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pages 705\u2013712, 2002."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.77"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/080721820"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447281"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.78"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195190"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993672"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1043"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305237"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2683783"},{"key":"e_1_3_2_2_22_1","first-page":"670","volume-title":"Algorithms and Techniques","author":"Reingold O.","unstructured":"{RSV13} O. Reingold , T. Steinke , and S. Vadhan . Pseudorandomness for regular branching programs via Fourier analysis. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques , pages 655\u2013 670 . Springer, 2013. {RSV13} O. Reingold, T. Steinke, and S. Vadhan. Pseudorandomness for regular branching programs via Fourier analysis. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 655\u2013 670. Springer, 2013."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509996"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.33"},{"key":"e_1_3_2_2_25_1","volume-title":"Pseudorandomness and fourier growth bounds for width-3 branching programs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 885","author":"Steinke T.","year":"2014","unstructured":"{SVW14} T. Steinke , S. Vadhan , and A. Wan . Pseudorandomness and fourier growth bounds for width-3 branching programs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 885 , 2014 . {SVW14} T. Steinke, S. Vadhan, and A. Wan. Pseudorandomness and fourier growth bounds for width-3 branching programs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 885, 2014."},{"key":"e_1_3_2_2_26_1","volume-title":"Personal Communication","author":"Saks M.","year":"1995","unstructured":"{SZ95} M. Saks and D. Zuckerman . Personal Communication , 1995 . {SZ95} M. Saks and D. Zuckerman. Personal Communication, 1995."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1616"},{"key":"e_1_3_2_2_28_1","volume-title":"Master\u2019s thesis","author":"Tzur Y.","year":"2009","unstructured":"{Tzu09} Y. Tzur . Notions of weak pseudorandomness and GF (2 n )-polynomials. Master\u2019s thesis , Master\u2019s thesis , Weizmann Institute of Science, Rehovot , Israel , 2009 . {Tzu09} Y. Tzur. Notions of weak pseudorandomness and GF (2 n )-polynomials. Master\u2019s thesis, Master\u2019s thesis, Weizmann Institute of Science, Rehovot, Israel, 2009."}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188800","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:09Z","timestamp":1750212429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":28,"alternative-id":["10.1145\/3188745.3188800","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188800","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}