{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:59Z","timestamp":1725663779731},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_273","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:34Z","timestamp":1330257994000},"page":"483-493","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for finding predecessors in integer sets"],"prefix":"10.1007","author":[{"given":"Bruce","family":"Maggs","sequence":"first","affiliation":[]},{"given":"Monika","family":"Rauch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"3","key":"45_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02126797","volume":"8","author":"M. Ajtai","year":"1988","unstructured":"M. Ajtai. A lower bound for finding predecessors in Yao's cell probe model. Combinatorica, 8(3):235\u2013247, 1988.","journal-title":"Combinatorica"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","volume":"63","author":"M. Ajtai","year":"1984","unstructured":"M. Ajtai, M. Fredman, and J. Koml\u00f3s. Hash Functions for Priority Queues. Information and Control, 63:217\u2013225, 1984.","journal-title":"Information and Control"},{"key":"45_CR3","unstructured":"B. Chazelle. CS-593C Lecture Notes. Department of Computer Science, Princeton University. Spring 1989."},{"issue":"4","key":"45_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","volume":"35","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and St. N\u00e4her. Bounded Ordered Dictionaries in O(log log N) time and O(n) Space. Info. Proc. Lett., 35(4):183\u2013189, 1990.","journal-title":"Info. Proc. Lett."},{"issue":"3","key":"45_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Info. Proc. Lett., 6(3):80\u201382, 1977.","journal-title":"Info. Proc. Lett."},{"issue":"3","key":"45_CR6","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A. Yao","year":"1981","unstructured":"A. Yao. Should tables be sorted. J. Assoc. Comput. Mach., 28(3):615\u2013628, 1981.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_273.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:43Z","timestamp":1619571523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_273","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}