{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:36Z","timestamp":1750307736544,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536480","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"475-482","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Bit-probe lower bounds for succinct data structures"],"prefix":"10.1145","author":[{"given":"Emanuele","family":"Viola","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Baker. Transcendental number theory. Cambridge Mathematical Library. Cambridge University Press second edition 1990.  A. Baker. Transcendental number theory. Cambridge Mathematical Library. Cambridge University Press second edition 1990."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      Baker\n     and \n      \n      \n      G.\n       \n      W\u00fcstholz\n      \n  \n  . \n  Logarithmic forms and Diophantine geometry volume \n  9\n   of \n  New Mathematical Monographs\n  . \n  Cambridge University Press 2007\n  .  A. Baker and G. W\u00fcstholz. Logarithmic forms and Diophantine geometry volume 9 of New Mathematical Monographs. Cambridge University Press 2007.","DOI":"10.1017\/CBO9780511542862"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405292"},{"volume-title":"Wiley-Interscience","year":"2006","author":"Cover T. M.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-001-8195-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.09.014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496839"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250852"},{"volume-title":"19th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999. Advances in Data Structures Workshop","year":"1999","author":"Miltersen P. B.","key":"e_1_3_2_1_9_1"},{"volume-title":"MIT Press","year":"1969","author":"Minsky M.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384004"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380836"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.83"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.058"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"M. Patrascu and M. Thorup. Succincter-er 2009. Manuscript.  M. Patrascu and M. Thorup. Succincter-er 2009. Manuscript.","DOI":"10.1109\/FOCS.2008.83"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374461"},{"volume-title":"Harvard University","year":"2006","author":"Viola E.","key":"e_1_3_2_1_19_1"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536480","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":19,"alternative-id":["10.1145\/1536414.1536480","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536480","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}