{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:45:06Z","timestamp":1649036706528},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,4]]},"DOI":"10.1007\/bf00290147","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T01:53:34Z","timestamp":1096941214000},"page":"85-100","source":"Crossref","is-referenced-by-count":4,"title":["Purely top-down updating algorithms for stratified search trees"],"prefix":"10.1007","volume":"22","author":[{"given":"Thomas","family":"Ottmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schrapp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974"},{"key":"CR2","volume-title":"Data Structure and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: Data Structure and Algorithms. Reading, MA: Addison-Wesley 1983"},{"key":"CR3","first-page":"263","volume":"146","author":"G.M. Adel'son-Vel'skii","year":"1962","unstructured":"Adel'son-Vel'skii, G.M., Landis, E.M.: An Information Organization Algorithm. Doklady Akad. Nauk SSR 146, 263?266 (1962), transl. Soviet Math. Dokl. 3, 1259?1262 (1962)","journal-title":"Doklady Akad. Nauk SSR"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organisation and Maintenance of Large Ordered Indexes. Acta Inf. 1, 173?189 (1972)","journal-title":"Acta Inf."},{"key":"CR5","unstructured":"Bentley, J.L., Kung, H.T.: Two Papers on a Tree-Structured Parallel Computer. Carnegie-Mellon University, Computer Science Technical Report CMU-CS-79-142, 1979"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A Dichromatic Framework for Balanced Trees. Proc. 19th Ann. IEEE Symp. Found. Comput Sci., pp. 8?21. Ann Arbor, 1978","DOI":"10.1109\/SFCS.1978.3"},{"key":"CR7","volume-title":"The Art of Computer Programming, Vol. 3. Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 3. Sorting and Searching. Reading, MA: Addison-Wesley 1973"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Kwong, Y.S., Wood, D.: On B-Trees: Routing Schemes and Concurrency. Proc. 1980 ACM\/SIGMOD Internat. Conf. Management of Data, pp. 207?213, 1980","DOI":"10.1145\/582250.582282"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.M.: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2, 33?43 (1973)","journal-title":"SIAM J. Comput."},{"key":"CR10","first-page":"892","volume":"EC-31","author":"T. Ottmann","year":"1983","unstructured":"Ottmann, T., Rosenberg, A.L., Snyder, L.J.: A Dictionary Machine (for VLSI), IEEE Trans. Comput. EC-31, 892?897 (1983)","journal-title":"IEEE Trans. Comput."},{"key":"CR11","unstructured":"Ottmann, T., Schrapp, M.: A Purely Top-Down Insertion Algorithm for 1?2 Brother Trees, University of Karlsruhe, Technical Report No. 92 (1980)"},{"key":"CR12","first-page":"279","volume-title":"1-Pass Top-Down Update Schemes for Balanced Search Trees","author":"T. Ottmann","year":"1982","unstructured":"Ottmann, T., Schrapp, M.: 1-Pass Top-Down Update Schemes for Balanced Search Trees. Proc. 7th Conf. Graphtheoretic Concepts in Comput. Sci. WG81. J. M\u00fchlbacher (ed.), pp. 279?292. Vienna: Hanser 1982"},{"key":"CR13","unstructured":"Ottmann, T., Schrapp, M., Wood, D.: On 1-Pass Top-Down Update Algorithms for Stratified Search Trees. University of Waterloo, Computer Science Technical Report CS-82-11 (1982)"},{"key":"CR14","unstructured":"Ottmann, T., Schrapp, M., Wood, D.: Weight Balanced Trees are not Stratified. (Unpublished manuscript, 1984"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","volume":"23","author":"T Ottmann","year":"1980","unstructured":"Ottmann, T, Wood, D.: 1?2 Brother Trees or AVL Trees Revisited, Comput J. 23, 248?255 (1980)","journal-title":"Comput J."},{"key":"CR16","unstructured":"Schrapp, M.: 1-Pass Top-Down Update Schemes for Search Trees: Design, Analysis, and Application. Doctoral Dissertation, University Karlsruhe, 1984"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00289574","volume":"18","author":"J. Leeuwen van","year":"1982","unstructured":"van Leeuwen, J., Overmars, M.H.: Stratified Balanced Search Trees, Acta Inf. 18, 345?359 (1982)","journal-title":"Acta Inf."},{"key":"CR18","unstructured":"Zaki, A.S.: Top-Down Deletion Algorithm for Minimum-Order B-Trees. University of Washington, Technical Report (ca. 1978)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290147.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290147\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:15:19Z","timestamp":1554743719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["BF00290147"],"URL":"https:\/\/doi.org\/10.1007\/bf00290147","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}