{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:10Z","timestamp":1775282290767,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/bf01941686","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:32:20Z","timestamp":1122805940000},"page":"154-171","source":"Crossref","is-referenced-by-count":14,"title":["Optimal cooperative search in fractional cascaded data structures"],"prefix":"10.1007","volume":"15","author":[{"given":"R.","family":"Tamassia","sequence":"first","affiliation":[]},{"given":"J. S.","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01941686_CR1","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: a technique for designing parallel algorithms.SIAM J. Comput., 18:499\u2013532, 1989.","journal-title":"SIAM J. Comput."},{"key":"BF01941686_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0019-9958(85)80045-0","volume":"64","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle. How to search in history.Inform. Control, 64:77\u201399, 1985.","journal-title":"Inform. Control"},{"key":"BF01941686_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique.Algorithmica, 1:133\u2013162, 1986.","journal-title":"Algorithmica"},{"key":"BF01941686_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01840441","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications.Algorithmica, 1:163\u2013191, 1986.","journal-title":"Algorithmica"},{"issue":"3","key":"BF01941686_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1142\/S0218195992000287","volume":"2","author":"K. L. Clarkson","year":"1992","unstructured":"K. L. Clarkson, R. Cole, and R. E. Tarjan. Erratum: Randomized parallel algorithms for trapezoidal diagrams.Internat. J. Comput. Geom. Appl., 2(3):341\u2013343, 1992.","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"2","key":"BF01941686_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1142\/S0218195992000081","volume":"2","author":"K. L. Clarkson","year":"1992","unstructured":"K. L. Clarkson, R. Cole, and R. E. Tarjan. Randomized parallel algorithms for trapezoidal diagrams.Internat. J. Comput. Geom. Appl., 2(2):117\u2013133, 1992.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"BF01941686_CR7","unstructured":"N. Dadoun and D. G. Kirkpatrick. Cooperative subdivision search algorithms with applications.Proc. 27th Allerton Conf. on Communication, Control, and Computing, pp. 538\u2013547, 1989."},{"key":"BF01941686_CR8","doi-asserted-by":"crossref","unstructured":"M. Edahiro, I. Kokubo, and Ta. Asano. A new point-location algorithm and its practical efficiency: comparison with existing algorithms.ACM Trans. Graph., 3:86\u2013109, 1984.","DOI":"10.1145\/357337.357338"},{"key":"BF01941686_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision.SIAM J. Comput., 15:317\u2013340, 1986.","journal-title":"SIAM J. Comput."},{"key":"BF01941686_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0196-6774(89)90032-1","volume":"10","author":"M. T. Goodrich","year":"1989","unstructured":"M. T. Goodrich. Triangulating a polygon in parallel.J. Algorithms, 10:327\u2013351, 1989.","journal-title":"J. Algorithms"},{"key":"BF01941686_CR11","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich. Planar separators and parallel polygon triangulation.Proc. 24th ACM Symp. on Theory of Computing, pp. 507\u2013516, 1992.","DOI":"10.1145\/129712.129762"},{"key":"BF01941686_CR12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick. Optimal search in planar subdivisions.SIAM J. Comput., 12:28\u201335, 1983.","journal-title":"SIAM J. Comput."},{"key":"BF01941686_CR13","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","volume":"6","author":"D. T. Lee","year":"1977","unstructured":"D. T. Lee and F. P. Preparata. Location of a point in a planar subdivision and its applications.SIAM J. Comput., 6:594\u2013606, 1977.","journal-title":"SIAM J. Comput."},{"key":"BF01941686_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and S. N\u00e4her. Dynamic fractional cascading.Algorithmica, 5:215\u2013241, 1990.","journal-title":"Algorithmica"},{"key":"BF01941686_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos.Computational Geometry: an Introduction. Springer-Verlag, New York, 1985."},{"issue":"3","key":"BF01941686_CR16","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","volume":"14","author":"M. Snir","year":"1989","unstructured":"M. Snir. On parallel searching.SIAM J. Comput., 14(3):688\u2013708, 1989.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"BF01941686_CR17","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1137\/0220045","volume":"20","author":"R. Tamassia","year":"1991","unstructured":"R. Tamassia and J. S. Vitter. Parallel transitive closure and point location in planar structures.SIAM J. Comput., 20(4):708\u2013725, 1991.","journal-title":"SIAM J. Comput."},{"key":"BF01941686_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01762118","volume":"3","author":"C. K. Yap","year":"1988","unstructured":"C. K. Yap. Parallel triangulation of a polygon in two calls to the trapezoidal map.Algorithmica, 3:279\u2013288, 1988.","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941686.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01941686\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T13:27:57Z","timestamp":1586352477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01941686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF01941686"],"URL":"https:\/\/doi.org\/10.1007\/bf01941686","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}