{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:16Z","timestamp":1726452076401},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90042-8","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"203-216","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra"],"prefix":"10.1016","volume":"36","author":[{"given":"J.","family":"Demel","sequence":"first","affiliation":[]},{"given":"M.","family":"Demlov\u00e1","sequence":"additional","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0304-3975(85)90042-8_BIB1"},{"key":"10.1016\/0304-3975(85)90042-8_BIB2","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1090\/S0002-9904-1944-08235-9","article-title":"Subdirect unions in universal algebra","volume":"50","author":"Birkhoff","year":"1944","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(85)90042-8_BIB3","first-page":"121","article-title":"Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras","volume":"18","author":"Demel","year":"1982","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(85)90042-8_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/1981150100231","article-title":"On subdirectly irreducible automata","volume":"15","author":"Demlov\u00e1","year":"1981","journal-title":"R.A.I.R.O. Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(85)90042-8_BIB5","first-page":"99","article-title":"Several algorithms for finite algebras","author":"Demlov\u00e1","year":"1979"},{"key":"10.1016\/0304-3975(85)90042-8_BIB6","first-page":"325","article-title":"Simplicity of algebras requires to investigate almost all operations","volume":"23","author":"Demlov\u00e1","year":"1982","journal-title":"Comment. Math. Univ. Carolinae"},{"year":"1968","series-title":"Universal Algebra","author":"Gr\u00e4tzer","key":"10.1016\/0304-3975(85)90042-8_BIB7"},{"key":"10.1016\/0304-3975(85)90042-8_BIB8","article-title":"Group-theoretic algorithms and graph isomorphism","volume":"136","author":"Hoffmann","year":"1982"},{"key":"10.1016\/0304-3975(85)90042-8_BIB9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first-search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:52:59Z","timestamp":1553187179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":9,"alternative-id":["0304397585900428"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90042-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1985]]}}}