{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:52Z","timestamp":1725663412555},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_81","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:19:54Z","timestamp":1330211994000},"page":"375-384","source":"Crossref","is-referenced-by-count":0,"title":["Parallel algorithms for some dominance problems based on a CREW PRAM"],"prefix":"10.1007","author":[{"given":"Ip-Wang","family":"Chan","sequence":"first","affiliation":[]},{"given":"Donald K.","family":"Friesen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"40_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.\n18 (1989) 499\u2013532.","journal-title":"SIAM J. Comput."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and M. T. Goodrich, Efficient plane sweeping in parallel, in: Proc. of the Second ACM Symposium on Computational Geometry (1986) 216\u2013225.","DOI":"10.1145\/10515.10539"},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"22","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, Multidimensional divide-and-conquer, Commun. ACM\n22 (1980) 214\u2013229.","journal-title":"ACM"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770\u2013785.","journal-title":"SIAM J. Comput."},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0020-0190(82)90068-0","volume":"14","author":"H. Edelsbrunner","year":"1982","unstructured":"H. Edelsbrunner and M. H. Overmars, On the equivalence of some rectangle problems, Inform. Process. Lett.\n14 (1982) 124\u2013127.","journal-title":"Inform. Process. Lett."},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"R. H. G\u00fcting, O. Nurmi, and T. Ottmann, The direct dominance problem, in: Proc. of the First ACM Symposium on Computational Geometry (1985) 81\u201388.","DOI":"10.1145\/323233.323245"},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, Parallel prefix computation, JACM 27 (1980) 831\u2013838.","journal-title":"JACM"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"C-33","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata, Computational geometry \u2014 A survey, IEEE Trans. Comput. C-33 (1984) 1072\u20131101.","journal-title":"IEEE Trans. Comput."},{"key":"40_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. (Springer Verlag, New York, 1984)."},{"key":"40_CR10","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)."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:44Z","timestamp":1619573204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}