{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:52Z","timestamp":1750221232548,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"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":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1212372"],"award-info":[{"award-number":["1212372"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Villum Funden 13163","award":["13163"],"award-info":[{"award-number":["13163"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188790","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"978-989","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds"],"prefix":"10.1145","author":[{"given":"Kasper Green","family":"Larsen","sequence":"first","affiliation":[{"name":"Aarhus University, Denmark"}]},{"given":"Omri","family":"Weinstein","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}]},{"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Harvard University, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"837","volume-title":"Handbook of Discrete and Computational Geometry","author":"Agarwal Pankaj K.","unstructured":"{Aga04} Pankaj K. Agarwal . Range searching . In Handbook of Discrete and Computational Geometry , Second Edition., pages 809\u2013 837 . 2004. {Aga04} Pankaj K. Agarwal. Range searching. In Handbook of Discrete and Computational Geometry, Second Edition., pages 809\u2013837. 2004."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.003"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.71"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73040"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.047"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133099"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_49"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.13"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213987"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.21"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80032-5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250797"},{"key":"e_1_3_2_2_14_1","first-page":"443","volume-title":"Proc. 49th IEEE Symposium on Foundations of Computer Science","author":"June","year":"2018","unstructured":"STOC\u201918, June 25\u201329 , 2018 , Los Angeles, CA, USA Kasper Green Larsen, Omri Weinstein, and Huacheng Yu {P \u02c7 at08} Mihai P \u02c7 atra\u015fcu. Unifying the landscape of cell-probe lower bounds . In Proc. 49th IEEE Symposium on Foundations of Computer Science , pages 434\u2013 443 , 2008. STOC\u201918, June 25\u201329, 2018, Los Angeles, CA, USA Kasper Green Larsen, Omri Weinstein, and Huacheng Yu {P \u02c7 at08} Mihai P \u02c7 atra\u015fcu. Unifying the landscape of cell-probe lower bounds. In Proc. 49th IEEE Symposium on Foundations of Computer Science, pages 434\u2013443, 2008."},{"key":"e_1_3_2_2_15_1","first-page":"29","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"\u015fcu Mihai P","year":"2004","unstructured":"{PD04} Mihai P \u02c7 atra \u015fcu and Erik D. Demaine . Tight bounds for the partial-sums problem . In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 , pages 20\u2013 29 , 2004 . {PD04} Mihai P \u02c7 atra\u015fcu and Erik D. Demaine. Tight bounds for the partial-sums problem. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pages 20\u201329, 2004."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.82"},{"key":"e_1_3_2_2_18_1","first-page":"7","article-title":"Obituary and open problems","volume":"109","author":"Thorup Mikkel","year":"2013","unstructured":"{Tho13} Mikkel Thorup . Mihai P \u02c7 atra \u015fcu : Obituary and open problems . Bulletin of the EATCS , 109 : 7 \u2013 13 , 2013 . {Tho13} Mikkel Thorup. Mihai P \u02c7 atra\u015fcu: Obituary and open problems. Bulletin of the EATCS, 109:7\u201313, 2013.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.41"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1867719.1867720"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Los Angeles CA USA","acronym":"STOC '18"},"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.3188790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188790","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188790","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.3188790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":21,"alternative-id":["10.1145\/3188745.3188790","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188790","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"}}]}}