{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:36Z","timestamp":1725455856907},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540105763"},{"type":"electronic","value":"9783540385615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/bfb0017314","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"224-233","source":"Crossref","is-referenced-by-count":8,"title":["Dynamization of decomposable searching problems yielding good worst-case bounds"],"prefix":"10.1007","author":[{"given":"Mark H.","family":"Overmars","sequence":"first","affiliation":[]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"26_CR1","volume-title":"Algorithms for Klee's rectangle problems","author":"J.L. Bentley","year":"1977","unstructured":"Bentley, J.L., Algorithms for Klee's rectangle problems, unpubl. notes, Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, 1977."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Decomposable searching problems, Inform. Proc. Lett. 8 (1979) 244\u2013251.","journal-title":"Inform. Proc. Lett."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"509","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, Comm. ACM 18 (1975) 509\u2013517.","journal-title":"Comm. ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"C-29","author":"J.I. Bentley","year":"1980","unstructured":"Bentley, J.I. and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Trans. on Comp. C-29 (1980) 571\u2013577.","journal-title":"IEEE Trans. on Comp."},{"key":"26_CR5","volume-title":"Dynamic data structures for orthogonal intersection queries, Bericht 59","author":"H. Edelsbrunner","year":"1980","unstructured":"Edelsbrunner, H., Dynamic data structures for orthogonal intersection queries, Bericht 59, Inst. f. Informationsverarbeitung, TU Graz, 1980."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A. and J.L. Bentley, Quad trees: a data structure for retrieval on composite keys, Acta Informatica 4 (1974) 1\u20139.","journal-title":"Acta Informatica"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Efficient computation of continuous skeletons, Proc. of the 20-th Annual IEEE Symp. on Foundations of Computer Science, 1979, 18\u201327.","DOI":"10.1109\/SFCS.1979.15"},{"key":"26_CR8","series-title":"Techn. Rep.","volume-title":"A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems","author":"G.S. Lueker","year":"1978","unstructured":"Lueker, G.S., A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, Techn. Rep., Dept. of Computer Science, University of California, Irvine, 1978."},{"key":"26_CR9","volume-title":"Dynamic solutions of decomposable searching problems, Bericht 33","author":"H.A. Maurer","year":"1979","unstructured":"Maurer, H.A. and Th. Ottmann, Dynamic solutions of decomposable searching problems, Bericht 33, Inst. f. Informationsverarbeitung, TU Graz, 1979."},{"key":"26_CR10","series-title":"Techn. Rep., Fachbereich","volume-title":"Optimal dynamization of decomposable searching problems","author":"K. Mehlhorn","year":"1980","unstructured":"Mehlhorn, K. and M.H. Overmars, Optimal dynamization of decomposable searching problems, Techn. Rep., Fachbereich 10, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1980."},{"key":"26_CR11","unstructured":"Overmars, M.H., Dynamization of order decomposable set problems, Techn. Rep. RUU-CS-80-9, Dept. of Computer Science, University of Utrecht, 1980."},{"key":"26_CR12","unstructured":"Overmars, M.H. and J. van Leeuwen, Two general methods for dynamizing decomposable searching problems, Techn. Rep. RUU-CS-79-10, Dept. of Computer Science, University of Utrecht, 1979. (To appear in Computing.)"},{"key":"26_CR13","unstructured":"Overmars, M.H. and J. van Leeuwen, Dynamic multidimensional data structures based on quad-and k-d trees, Techn. Rep. RUU-CS-80-2, Dept. of Computer Science, University of Utrecht, 1980."},{"key":"26_CR14","unstructured":"Overmars, M.H. and J. van Leeuwen, Maintenance of configurations in the plane, Techn. Rep. RUU-CS-79-9, Dept. of Computer Science, University of Utrecht, 1979\/1980."},{"key":"26_CR15","unstructured":"Overmars, M.H. and J. van Leeuwen, Notes on maintenance of configurations in the plane, Techn. Rep. RUU-CS-80-5, Dept. of Computer Science, University of Utrecht, 1980."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Overmars, M.H. and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, Techn. Rep. RUU-CS-80-6, Dept. of Computer Science, University of Utrecht, 1980.","DOI":"10.1007\/BFb0017314"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Saxe, J.B. and J.L. Bentley, Transforming static data structures into dynamic structures, Proc. 20-th Annual IEEE Symp. on Foundations of Computer Science, 1979, 148\u2013168.","DOI":"10.1109\/SFCS.1979.47"},{"key":"26_CR18","unstructured":"Shamos, M.I., Computational geometry, to be published by Springer-Verlag."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Shamos, M.I. and D. Hoey, Closest-point problems, Proc. of the 16-th Annual IEEE Symp. on Foundations of Computer Science, 1976, 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"26_CR20","volume-title":"Dynamic systems of static data structures, Bericht 42","author":"J. Leeuwen van","year":"1980","unstructured":"van Leeuwen, J. and H.A. Maurer, Dynamic systems of static data structures, Bericht 42, Inst. f. Informationsverarbeitung, TU Graz, 1980."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(80)90073-3","volume":"10","author":"J. Leeuwen van","year":"1980","unstructured":"van Leeuwen, J. and D. Wood, Dynamization of decomposable searching problems, Inform. Proc. Lett. 10 (1980) 51\u201356.","journal-title":"Inform. Proc. Lett."},{"key":"26_CR22","unstructured":"Willard, D.E., The super B-tree algorithm, TR-03-79, Aiken Computation Lab., Harvard University, 1979."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:53:09Z","timestamp":1586573589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540105763","9783540385615"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0017314","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}