{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:08:22Z","timestamp":1648886902096},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)00334-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:59:25Z","timestamp":1027605565000},"page":"377-401","source":"Crossref","is-referenced-by-count":1,"title":["Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences"],"prefix":"10.1016","volume":"242","author":[{"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00334-X_BIB1","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1137\/S0895480192232862","article-title":"Multidimensional divide-and-conquer maximin recurrences","volume":"8","author":"Alonso","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0603038","article-title":"Some maximal solutions of the generalized subadditive inequality","volume":"3","author":"Batty","year":"1982","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segments in the plane","volume":"39","author":"Chazelle","year":"1992","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB4","doi-asserted-by":"crossref","unstructured":"M.L. Fredman, Two applications of a probabilistic search technique: sorting X+Y and building balanced search trees, Proceedings of Seventh Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1975, pp. 240\u2013244.","DOI":"10.1145\/800116.803774"},{"key":"10.1016\/S0304-3975(98)00334-X_BIB5","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","article-title":"An output sensitive algorithm for computing visibility graphs","volume":"20","author":"Ghosh","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB6","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0304-3975(98)00334-X_BIB7","series-title":"Mathematics for the Analysis of Algorithms","author":"Greene","year":"1990"},{"key":"10.1016\/S0304-3975(98)00334-X_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00334-X_BIB9","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(98)00334-X_BIB10","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1137\/0218079","article-title":"Solution of a divide-and-conquer maximin recurrence","volume":"18","author":"Li","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB11","series-title":"Data Structures and Algorithms 1","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/S0304-3975(98)00334-X_BIB12","unstructured":"E.M. Reingold, W.J. Hansen, Data Structures in Pascal, Little, Brown, Boston, 1986."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","article-title":"An O(nloglog n)-time algorithm for triangulating a simple polygon","volume":"17","author":"Tarjan","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","article-title":"An O(nlog n) algorithm for the all-nearest-neighbors problem","volume":"4","author":"Vaidya","year":"1989","journal-title":"Discrete. Comput. Geom."},{"key":"10.1016\/S0304-3975(98)00334-X_BIB15","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jagm.1996.0839","article-title":"Tighter bounds on the solution of a divide-and-conquer maximin recurrence","volume":"23","author":"Wang","year":"1997","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800334X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800334X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:56:35Z","timestamp":1556484995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800334X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S030439759800334X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00334-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}