{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:51Z","timestamp":1770994011385,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840440","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T21:29:13Z","timestamp":1121290153000},"page":"133-162","source":"Crossref","is-referenced-by-count":280,"title":["Fractional cascading: I. A data structuring technique"],"prefix":"10.1007","volume":"1","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas J.","family":"Guibas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840440_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe.Decomposable searching problems I: static to dynamic transformations. J. Algorithms, 1 (1980), 301\u2013358.","journal-title":"J. Algorithms"},{"key":"BF01840440_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, B. Kaas and E. Zijlstra.Design and implementation of an efficient priority queue. Math. Syst. Theory,10 (1977), 99\u2013127.","journal-title":"Math. Syst. Theory"},{"key":"BF01840440_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle.Filtering search: A new approach to query-answering. Proc. 24th Ann. Symp. Found. Comp. Sci. (1983), pp. 122\u2013132. To appear in SIAM J. Comput. (1986).","DOI":"10.1137\/0215051"},{"key":"BF01840440_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle and L. J. Guibas.Fractional cascading II: applications. To appear in Algorithmica (1986).","DOI":"10.1007\/BF01840441"},{"key":"BF01840440_CR5","series-title":"Tech. Report No.","volume-title":"Searching and storing similar lists","author":"R. Cole","year":"1983","unstructured":"R. Cole.Searching and storing similar lists. Tech. Report No. 88, Courant Inst., New York University, New York, Oct. 1983. To apper in J. Algorithms."},{"key":"BF01840440_CR6","doi-asserted-by":"crossref","unstructured":"O. Fries, K. Mehlhorn, and St. N\u00e4her.Dynamization of geometric data structures. Proc. 1st ACM Computational Geometry Symposium, 1985, pp. 168\u2013176.","DOI":"10.1145\/323233.323256"},{"key":"BF01840440_CR7","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi.Optimal point location in a monotone subdivision. To appear in SIAM J. Comput. Also DEC\/SRC Research Report No. 2, 1984."},{"key":"BF01840440_CR8","doi-asserted-by":"crossref","unstructured":"H. Imai and T. Asano.Dynamic segment intersection search with applications, Proc. of 25th FOCS Sumposium, 1984, pp. 393\u2013402.","DOI":"10.1109\/SFCS.1984.715940"},{"key":"BF01840440_CR9","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and R. E. Tarjan.A linear-time algorithm for a special case of disjoint set union. Proc. of 24th FOCS Symposium, 1983, pp. 246\u2013251.","DOI":"10.1145\/800061.808753"},{"key":"BF01840440_CR10","volume-title":"PhD Thesis","author":"M. H. Overmars","year":"1983","unstructured":"M. H. Overmars.The design of dynamic data structures. PhD Thesis, University of Utrecht, The Netherlands, 1983."},{"issue":"2","key":"BF01840440_CR11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan.Amortized computational complexity. SIAM J. Alg. Disc. Meth.,6 (2) (April 1985), 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"BF01840440_CR12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","volume":"3","author":"V. K. Vaishani","year":"1982","unstructured":"V. K. Vaishani and D. Wood.Rectilinear line segment intersection, layered segment trees, and dynamization. J. Algorithms,3 (1982), 160\u2013176.","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840440\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T06:58:51Z","timestamp":1586329131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840440"],"URL":"https:\/\/doi.org\/10.1007\/bf01840440","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}