{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:16:40Z","timestamp":1725754600359},"reference-count":25,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214411","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"73-83","source":"Crossref","is-referenced-by-count":12,"title":["Lower bounds for predecessor searching in the cell probe model"],"prefix":"10.1109","author":[{"given":"P.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1016\/0020-0190(91)90157-D"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1145\/195058.195415"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1006\/jcss.1998.1577"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1145\/276698.276877"},{"year":"2001","author":"maneva","journal-title":"Interactive Communication on Noisy Channels","key":"16"},{"year":"1997","author":"kushilevitz","journal-title":"Communication Complexity","key":"13"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1145\/380752.380786"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1145\/237814.237866"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/276698.276876"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1007\/3-540-48224-5_30"},{"year":"1988","author":"smirnov","journal-title":"Shannon's Information Methods for Lower Bounds for Probabilistic Communication Complexity","key":"20"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1016\/0020-0190(83)90075-3"},{"year":"1992","author":"xiao","journal-title":"New Bounds in the Cell Probe Model","key":"23"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1109\/SFCS.1977.24"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1145\/322261.322274"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1006\/jcss.2002.1822"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/SFCS.1996.548472"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/0022-0000(93)90040-4"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/BF02126797"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1145\/301250.301325"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1016\/0020-0190(77)90031-X"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/335305.335357"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/BF01683268"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1145\/828.1884"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1002\/0471200611"}],"event":{"acronym":"CCC-03","name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214411.pdf?arnumber=1214411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T14:42:17Z","timestamp":1489416137000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214411","relation":{},"subject":[]}}