{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:46Z","timestamp":1725663766767},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_255","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:47Z","timestamp":1330257947000},"page":"277-288","source":"Crossref","is-referenced-by-count":2,"title":["Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Devillers","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Fabri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"27_CR1","unstructured":"M.J. Atallah and F. Dehne and S.E. Hambrusch. A coarse-grained, architectureindependent approach for connected component labeling. TR-90-008. Purdue University, 1993."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"K.E. Batcher. Sorting networks and their applications. Proc. AFIPS Spring Joint Computer Conference, pages 307\u2013314, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"27_CR3","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs, NJ, 1989."},{"key":"27_CR4","volume-title":"Report UIUCDCS-R-90-1578","author":"B. Chazelle","year":"1989","unstructured":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Algorithms for bichromatic line segment problems and polyhedral terrains. Report UIUCDCS-R-90-1578, Dept. Comput. Sci., Univ. Illinois, Urbana, IL, 1989."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"R. Cypher and C.G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. ACM Symposium on Theory of Computing, 193\u2013203. ACM, 1990.","DOI":"10.1145\/100216.100240"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"F. Dehne and A. Fabri and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. ACM Symposium on Computational Geometry, 1993.","DOI":"10.1145\/160985.161154"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01758856","volume":"8","author":"M.T. Goodrich","year":"1992","unstructured":"M.T. Goodrich and S.B. Shauck and S. Guha. Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmic, 8, 461\u2013486, 1992.","journal-title":"Algorithmic"},{"key":"27_CR8","first-page":"345","volume":"5","author":"R.I. Greenberg","year":"1989","unstructured":"R.I. Greenberg and C. E. Leiserson. Randomized Routing on Fat-trees. Advances in Computing Research, 5:345\u2013374, 1989.","journal-title":"Advances in Computing Research"},{"key":"27_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"L.P. Palazzi and J. Snoeyink. Counting and Reporting Red\/Blue Segment Intersections. Workshop on Algorithms and Data Structures 1993. Springer LNCS.","DOI":"10.1007\/3-540-57155-8_277"},{"key":"27_CR11","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, NY, 1985."},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/7531.7532","volume":"34","author":"J.H. Reif","year":"1987","unstructured":"J.H. Reif and L.G. Valiant. A logarithmic time sort for linear size networks. J. ACM, Vol. 34, 1:60\u201376, 1987.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_255.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:39Z","timestamp":1619571519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_255","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}