{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T05:48:00Z","timestamp":1716529680378},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90018-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"57-68","source":"Crossref","is-referenced-by-count":14,"title":["A tradeoff between search and update time for the implicit dictionary problem"],"prefix":"10.1016","volume":"58","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[]},{"given":"Faith E.","family":"Fich","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer Auf Der Heide","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90018-7_BIB1","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0214059","article-title":"Searching semisorted tables","volume":"14","author":"Alt","year":"1985","journal-title":"SICOMP"},{"key":"10.1016\/0304-3975(88)90018-7_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","article-title":"Partial match retrieval in implicit data structures","volume":"19","author":"Alt","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90018-7_BIB3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(81)90005-3","article-title":"Efficient searching using partial ordering","volume":"12","author":"Borodin","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90018-7_BIB4","author":"Cook","year":"1982","journal-title":"Personal communication"},{"key":"10.1016\/0304-3975(88)90018-7_BIB5","author":"Feldman","year":"1985","journal-title":"Personal communication"},{"key":"10.1016\/0304-3975(88)90018-7_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/322358.322364","article-title":"Implicit data structures for the dictionary problem","volume":"30","author":"Frederickson","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90018-7_BIB7","first-page":"473","article-title":"Information bounds are good for search problems on ordered data structures","author":"Linial","year":"1983","journal-title":"Proc. 24th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90018-7_BIB8","first-page":"303","article-title":"Average case lower bounds on the construction and searching of partial orders","author":"Mairson","year":"1985","journal-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90018-7_BIB9","first-page":"369","article-title":"An implicit data structure for the dictionary problem that runs in polylog time","author":"Munro","year":"1984","journal-title":"Proc. 25th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90018-7_BIB10","series-title":"An implicit data structure supporting insertion, deletion and search in O(log2n) time","author":"Munro","year":"1985"},{"key":"10.1016\/0304-3975(88)90018-7_BIB11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","article-title":"Implicit data structures","volume":"21","author":"Munro","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90018-7_BIB12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","article-title":"Should tables be sorted?","volume":"3","author":"Yao","year":"1981","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:00Z","timestamp":1555113240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0304397588900187"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90018-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}