{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:41Z","timestamp":1725455441003},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016241","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:39:17Z","timestamp":1131842357000},"page":"168-176","source":"Crossref","is-referenced-by-count":2,"title":["Developing implicit data structures"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Adel'son-Vel'skii, G.M., and Landis, Y.M., An Algorithm for the Organization of Information, Dokl. Akad. Nauk. SSR 146, 263\u2013266."},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","volume":"19","author":"H. Alt","year":"1984","unstructured":"Alt, H., Mehlhorn, K. and Munro, J.I., Partial Match Retrieval in Implicit Data Structures, IPL (19,2) 61\u201365 (1984).","journal-title":"IPL"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L., Multidimensional Binary Search Trees Used for Associative Searching, CACM 18, 506\u2013516 (1975).","journal-title":"CACM"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, A.B., Fich, F.E., Meyer auf der Heide, F., Upfal, E. and Wigderson, A., A Tradeoff Between Search and Update Times for the Implicit Dictionary Problem, Proc. ICALP '86.","DOI":"10.1007\/3-540-16761-7_54"},{"key":"12_CR5","unstructured":"Durian, B., Quicksort Without a Stack, this volume."},{"key":"12_CR6","first-page":"701","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W., Algorithm 245: Tressort 3, JACM 7, 701 (1964).","journal-title":"JACM"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0213020","volume":"13","author":"G.N. Frederickson","year":"1984","unstructured":"Frederickson, G.N., Self Organizing Heuristics for Implicit Data Structures, SIAM J. on Comp. 13, 277\u2013291 (1984).","journal-title":"SIAM J. on Comp."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(84)90013-6","volume":"29","author":"G.N. Frederickson","year":"1985","unstructured":"Frederickson, G.N., Recursively Rotated Orders and Implicit Data Structures: A Lower Bound, Theor. Comp. Sci. 29, 75\u201385 (1985).","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"12_CR9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1983","unstructured":"Frederickson, G.N., Implicit Data Structures for the Dictionary Problem, JACM 30, 1, 80\u201394 (1983).","journal-title":"JACM"},{"key":"12_CR10","unstructured":"Munro, J.I., An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time, Proc. 25th Annual IEEE Symp. on FOCS, 369\u2013374, Oct. 1984. Expanded version available as Research Report CS-84-20, Department of Computer Science, University of Waterloo, Aug. 1984."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., and Suwanda, H., Implicit Data Structures for Fast Search and Update, J. Computer Syst. Sci 21, 236\u2013250 (1980).","journal-title":"J. Computer Syst. Sci"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Munro, J.I., and Poblete, P.V., Searchability in Merging and Implicit Data Structures, Proc. 10th ICALP, 527\u2013535, Jul. 1983, appears as Lecture Notes in Computer Science 154, Springer-Verlag.","DOI":"10.1007\/BFb0036934"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J., Algorithm 232: Heapsort, CACM 7, 347\u2013348 (1964).","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016241.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T12:07:31Z","timestamp":1626696451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0016241","relation":{},"subject":[]}}