{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:07Z","timestamp":1742617087887,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_46","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:04:09Z","timestamp":1330193049000},"page":"490-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational complexity of an optical disk interface"],"prefix":"10.1007","author":[{"given":"Jeffrey Scott","family":"Vitter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"5","key":"46_CR1","first-page":"1259","volume":"3","author":"G. M. Adel'son-Vel'skii","year":"1962","unstructured":"G. M. Adel'son-Vel'skii and E. M. Landis. An Algorithm for the Organization of Information. An English translation appears in Soviet Mathematics, 3, 5 (July 1962), 1259\u20131263.","journal-title":"Soviet Mathematics"},{"key":"46_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974)."},{"key":"46_CR3","unstructured":"R. F. Arnold, G. R. Hogsett, R. W. Holliday, and P. J. Friedl. STAR, A Data Base System Architecture\u2014Concepts and Facilities. Technical Report ZZ20-6452, IBM Palo Alto Scientific Center (February 1981)."},{"issue":"7","key":"46_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/MC.1982.1654079","volume":"15","author":"G. Copeland","year":"1982","unstructured":"G. Copeland. What if Mass Storage Were Free? Computer, 15, 7 (July 1982), 27\u201335.","journal-title":"Computer"},{"key":"46_CR5","unstructured":"M. J. Fischer and R. E. Ladner. Data Structures for Efficient Implementation of Sticky Pointers in Text Editors, Technical Report 79-06-08, University of Washington (June 1979)."},{"issue":"4534","key":"46_CR6","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1126\/science.7058338","volume":"215","author":"C. M. Goldstein","year":"1982","unstructured":"C. M. Goldstein. Optical Disk Technology and Information. Science, 215, 4534 (Feb. 1982), 862\u2013868.","journal-title":"Science"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and R. Sedgewick. A Dichromatic Framework for Balanced Trees. Proc. 19th Annual IEEE Symposium on Foundations of Computer Science, Ann Arbor, MI (October 1978), 8\u201320.","DOI":"10.1109\/SFCS.1978.3"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"D. Maier. Using Write-Once Memory for Database Storage. Proc. 1st Annual ACM Symposium on Principles of Database Systems, Los Angeles, CA (March 1982), 239\u2013246.","DOI":"10.1145\/588111.588151"},{"issue":"7","key":"46_CR9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/MC.1982.1654080","volume":"15","author":"B. T. O'Lear","year":"1982","unstructured":"B. T. O'Lear and J. H. Choy. Software Considerations in Mass Storage Systems. Computer, 15, 7 (July 1982), 36\u201344.","journal-title":"Computer"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"P. Rathmann. Dynamic Data Structures on Optical Disks. Proc. IEEE Computer Data Engineering Conference, Los Angeles, CA (April 1984).","DOI":"10.1109\/ICDE.1984.7271270"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"R. L. Rivest and A. Shamir. How to Reuse a \u201cWrite-Once\u201d Memory. Proc. 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (May 1982), 105\u2013113.","DOI":"10.1145\/800070.802182"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"D. D. Sleator and R. E. Tarjan. Self-Adjusting Binary Search Trees. A summary appears in Proc. 15th Annual ACM Symposium on Theory of Computing, Boston, MA (April 1983), 235\u2013245.","DOI":"10.1145\/800061.808752"},{"key":"46_CR13","unstructured":"J. S. Vitter. Search Mechanisms for Optical Disks. Internal Memo, IBM Palo Alto Scientific Center (March 1983)."},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"J. S. Vitter. US&R: A New Framework for Redoing. Proc. ACM Symposium on Practical Software Development Environments, Pittsburgh, PA (April 1984).","DOI":"10.1145\/800020.808262"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:19:49Z","timestamp":1742588389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_46"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}