{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:31Z","timestamp":1725662971295},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180999"},{"type":"electronic","value":"9783540477600"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18099-0_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:29:31Z","timestamp":1330180171000},"page":"70-76","source":"Crossref","is-referenced-by-count":3,"title":["An O(nlogn) cost parallel algorithm for the single function coarsest partition problem"],"prefix":"10.1007","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"C. S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"R.","family":"Paige","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"7_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R., Parallel merge sort, Proceedings of the 27-th IEEE Symp. on Foundations of Computer Science, Toronto, Canada, pp. 511\u2013516 (1986).","DOI":"10.1109\/SFCS.1986.41"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Fitch, F.E., R. L. Radge and A. Wigderson, Relation between concurrent-write models of parallel computation, typescript, Div of Comp. Science, Univ. of Califomia at Berkeley, 1983.","DOI":"10.1145\/800222.806745"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Galil, Z., Optimal parallel algorithms for string matching, Proc. 16-th ACM Symp. on Theory of Computing, pp. 240\u2013248, 1984.","DOI":"10.1145\/800057.808687"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E., An nlogn algorithm for minimizing states in a finite automaton, in: Kohavi and Paz, ed., Theory of Machines and Computations, Academic Press, NY, pp. 189\u2013196, 1971."},{"key":"7_CR6","unstructured":"Iliopoulos, C.S., A logarithmic time parallel algorithm for partitioning, Purdue University, CSD-TR-603, 1986."},{"key":"7_CR7","unstructured":"Iliopoulos, C.S., A log-time parallel algorithm for lexicographical ordering Purdue University, CSD-TR-602, 1986."},{"key":"7_CR8","unstructured":"Kosaraju, S.R., personal communication, 1987."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., R. Tarjan and R. Bonic, A linear time solution to the single function coarsest partition problem, Theoretical Computer Science 40, pp. 67\u201384, 1985.","journal-title":"Theoretical Computer Science"},{"key":"7_CR10","unstructured":"Paige, R. and R. Tarjan, Three efficient algorithms based on partition refinement, to appear in SIAM J. Computing."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Fast canonization of circular strings J. Algorithms 2, pp. 107\u2013121, 1981.","journal-title":"J. Algorithms"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. Tarjan","year":"1985","unstructured":"Tarjan, R. and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14, pp. 862\u2013874, 1985.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18099-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:14:05Z","timestamp":1619543645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18099-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180999","9783540477600"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-18099-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}