{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:16Z","timestamp":1725663076408},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:53:17Z","timestamp":1330195997000},"page":"50-59","source":"Crossref","is-referenced-by-count":5,"title":["A tradeoff between search and update time for the implicit dictionary problem"],"prefix":"10.1007","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[]},{"given":"Faith E.","family":"Fich","sequence":"additional","affiliation":[]},{"given":"Friedhelm Meyer","family":"Heide","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0214059","volume":"14","author":"H. Alt","year":"1985","unstructured":"H. Alt and K. Mehlhorn, Searching Semisorted Tables, SICOMP, vol. 14 no. 4, 1985, pages 840\u2013848.","journal-title":"SICOMP"},{"issue":"2","key":"6_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","volume":"19","author":"H. Alt","year":"1984","unstructured":"H. Alt, K. Mehlhorn, and J.I. Munro, Partial Match Retrieval in Implicit Data Structures, Information Processing Letters, vol. 19 no. 2, 1984, pages 61\u201365.","journal-title":"Information Processing Letters"},{"issue":"2","key":"6_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(81)90005-3","volume":"12","author":"A. Borodin","year":"1981","unstructured":"A. Borodin, L. Guibas, N. Lynch, and A. Yao, Efficient Searching Using Partial Ordering, Information Processing Letters, vol. 12 no. 2, 1981, pages 71\u201375.","journal-title":"Information Processing Letters"},{"key":"6_CR4","unstructured":"S. Cook, personal communication."},{"key":"6_CR5","unstructured":"P. Feldman, personal communication."},{"issue":"1","key":"6_CR6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1983","unstructured":"G.N. Frederickson, Implicit Data Structures for the Dictionary Problem, J. ACM, vol. 30 no. 1, 1983, pages 80\u201394.","journal-title":"J. ACM"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"N. Linial and M. Saks, Information Bounds are Good for Search Problems on Ordered Data Structures, 24th Annual Symposium on Foundations of Computer Science, 1983, pages 473\u2013475.","DOI":"10.1109\/SFCS.1983.27"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"H. Mairson, Average Case Lower Bounds on the Construction and Searching of Partial Orders, 26th Annual Symposium on Foundations of Computer Science, 1985, pages 303\u2013311.","DOI":"10.1109\/SFCS.1985.13"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Munro, J.I., An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time, 25th Annual Symposium on Foundations of Computer Science, 1984, pages 369\u2013374.","DOI":"10.1109\/SFCS.1984.715937"},{"key":"6_CR10","unstructured":"Munro, J.I., An Implicit Data Structure Supporting Insertion, Deletion and Search in O (log2\nn) Time, manuscript, University of Waterloo, 1985."},{"key":"6_CR11","first-page":"236","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"J.I. Munro and H. Suwanda, Implicit Data Structures, JCSS, vol. 21, 1980, pages 236\u2013250.","journal-title":"JCSS"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","volume":"3","author":"A.C. Yao","year":"1981","unstructured":"A.C. Yao, Should Tables be Sorted?, J.ACM vol. 3, 1981, pages 615\u2013628.","journal-title":"J.ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:06Z","timestamp":1619557506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}