{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:00:37Z","timestamp":1648706437821},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1007\/bf01300373","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:45:54Z","timestamp":1111743954000},"page":"52-69","source":"Crossref","is-referenced-by-count":0,"title":["O(log logn)-time integer geometry on the CRCW PRAM"],"prefix":"10.1007","volume":"14","author":[{"given":"B. S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"K.","family":"Diks","sequence":"additional","affiliation":[]},{"given":"M.","family":"Kowaluk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. K. Yap, Parallel computational geometry,Algorithmica,3 (1988), 293?326.","journal-title":"Algorithmica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and M. Goodrich, Efficient parallel solutions to some geometric problems,J. Parallel Distributed Comput.,3 (1986), 492?507.","journal-title":"J. Parallel Distributed Comput."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"P. Beame and J. Hastad, Optimal bounds for decision problems on the CRCW PRAM,Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 83?93.","DOI":"10.1145\/28395.28405"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin, Highly-parallelizable problems,Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 309?319.","DOI":"10.1145\/73007.73036"},{"key":"CR5","unstructured":"O. Berkman, J. J\u00e1J\u00e1, S. Krishnamurthy, R. Thurimella, and U. Vishkin, Some triply-logarithmic parallel algorithms,Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1980, pp. 871?881."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","volume":"94","author":"P. C. P. Bhatt","year":"1991","unstructured":"P. C. P. Bhatt, K. Diks, T, Hagerup, V. C. Prasad, T. Radzik, and S. Saxena, Improved deterministic parallel integer sorting,Inform. and Comput.,94 (1991), 29?47.","journal-title":"Inform. and Comput."},{"key":"CR7","first-page":"231","volume-title":"Lecture Notes in Computer Science, Vol. 324","author":"B. S. Chlebus","year":"1988","unstructured":"B. S. Chlebus, K. Diks, T. Hagerup, and T. Radzik, Efficient simulations between concurrent-read concurrent-write PRAM models,Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science, 1988, Lecture Notes in Computer Science, Vol. 324, Springer-Verlag, Berlin, pp. 231?239."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Cole and M. T. Goodrich, Optimal parallel algorithms for polygon and pointset problems,Proceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 205?214.","DOI":"10.1145\/73393.73414"},{"key":"CR9","first-page":"259","volume-title":"Lecture Notes in Computer Science, Vol. 577","author":"T. Hagerup","year":"1992","unstructured":"T. Hagerup, The log-star revolution,Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, 1992, Lecture Notes in Computer Science, Vol. 577, Springer-Verlag, Berlin, pp. 259?278."},{"key":"CR10","unstructured":"P. D. MacKenzie and Q. F. Stout, Ultra-fast expected time parallel algorithms,Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 414?423."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the maximum, merging, and sorting in a parallel computation model,J. Algorithms,3 (1981), 57?67.","journal-title":"J. Algorithms"},{"key":"CR12","unstructured":"Q. F. Stout, Constant-time geometry on PRAMs,Proceedings of the International Conference on Parallel Processing, 1988, pp. 104?107."},{"key":"CR13","first-page":"1","volume-title":"Lectures on Parallel Computation","author":"U. Vishkin","year":"1993","unstructured":"U. Vishkin, Structural parallel algorithmics, inLectures on Parallel Computation, edited by A. Gibbons and P. Spirakis, Cambridge University Press, Cambridge, 1993, pp. 1?18."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"H. Wagener, Optimal parallel hull construction for simple polygons in O(log logn) time,Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 593?599.","DOI":"10.1109\/SFCS.1992.267792"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"D. E. Willard and Y. C. Wee, Quasi-valid range querying and its implications for nearest neighbor problems,Proceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 34?43.","DOI":"10.1145\/73393.73398"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300373.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300373\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:58:19Z","timestamp":1586181499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01300373"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01300373","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":["Applied Mathematics","Computer Science Applications","General Computer Science"],"published":{"date-parts":[[1995,7]]}}}