{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:09:43Z","timestamp":1648580983288},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90095-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"89-94","source":"Crossref","is-referenced-by-count":7,"title":["The parallel complexity of coarsest set partition problems"],"prefix":"10.1016","volume":"42","author":[{"given":"Sang","family":"Cho","sequence":"first","affiliation":[]},{"given":"Dung T.","family":"Huynh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90095-D_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(92)90095-D_BIB2","article-title":"Parallel complexity in the design and analysis of concurrent systems","volume":"505","author":"Alvarez","year":"1991"},{"key":"10.1016\/0020-0190(92)90095-D_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(92)90002-W","article-title":"The parallel complexity of finite state automate problems","author":"Cho","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90095-D_BIB4","first-page":"2","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90095-D_BIB5","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0020-0190(92)90095-D_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(92)90095-D_BIB7","series-title":"The Theory of Machines and Computations","first-page":"189","article-title":"An n log n algorithm for minimizing the states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0020-0190(92)90095-D_BIB8","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90095-D_BIB9","article-title":"An efficient algorithm for a special case of the set partition problem","author":"Jackson","year":"1989","journal-title":"Proc. 27th Ann. Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(92)90095-D_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90095-D_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","article-title":"A linear time solution to the single function coarsest set partition problem","volume":"40","author":"Page","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90095-D_BIB12","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Page","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90095-D_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207169008803810","article-title":"A parallel algorithm for the minimization of finite state automata","volume":"32","author":"Srikant","year":"1990","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0020-0190(92)90095-D_BIB14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"29","author":"Szelepcsenyi","year":"1988","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290095D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290095D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:14Z","timestamp":1555144034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290095D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290095D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90095-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}