{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T08:25:12Z","timestamp":1745569512994,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/ita.2018.8503262","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T19:42:52Z","timestamp":1540496572000},"page":"1-40","source":"Crossref","is-referenced-by-count":1,"title":["Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds"],"prefix":"10.1109","author":[{"given":"Kasper","family":"Green Larsen","sequence":"first","affiliation":[]},{"given":"Omri","family":"Weinstein","sequence":"additional","affiliation":[]},{"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213987"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.21"},{"journal-title":"Models and Techniques for Proving Data Structure Lower Bounds","year":"2013","author":"green larsen","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80018-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250797"},{"key":"ref16","first-page":"434","article-title":"Unifying the landscape of cell-probe lower bounds","author":"patrascu","year":"2008","journal-title":"Proc 49th IEEE Symposium on Foundations of Computer Science"},{"key":"ref17","first-page":"20","article-title":"Tight bounds for the partial-sums problem","author":"patrascu","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2004"},{"key":"ref18","first-page":"932","volume":"35","author":"patrascu","year":"2006","journal-title":"Logarithmic lower bounds in the cell-probe model SIAM Journal on Computing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.82"},{"key":"ref4","article-title":"New unconditional hardness results for dynamic and online problems","author":"clifford","year":"2015","journal-title":"Proceedings of 56th IEEE Symposium on Foundations of Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.003"},{"journal-title":"Concrete Mathematics A Foundation for Computer Science","year":"1994","author":"graham","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73040"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.63"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814607"},{"key":"ref1","first-page":"809","author":"agarwal","year":"2004","journal-title":"Range searching"},{"key":"ref9","first-page":"558","article-title":"Space-efficient and fast algorithms for multidimensional dominance reporting and counting","author":"j\u00e1j\u00e1","year":"2004","journal-title":"Proc International Symposium on Algorithms and Computation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2447712.2447737"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.41"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1867719.1867720"},{"key":"ref23","first-page":"615","volume":"28","author":"chi-chih yao","year":"1981","journal-title":"Should tables be sorted? Journal of the ACM"}],"event":{"name":"2018 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2018,2,11]]},"location":"San Diego, CA","end":{"date-parts":[[2018,2,16]]}},"container-title":["2018 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8486613\/8502949\/08503262.pdf?arnumber=8503262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T15:16:13Z","timestamp":1643210173000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8503262\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ita.2018.8503262","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}