{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:44Z","timestamp":1725663164038},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:59:49Z","timestamp":1330189189000},"page":"273-281","source":"Crossref","is-referenced-by-count":2,"title":["Testing of properties of finite algebras"],"prefix":"10.1007","author":[{"given":"A.","family":"Goral\u010d\u00edkov\u00e1","sequence":"first","affiliation":[]},{"given":"P.","family":"Goral\u010d\u00edk","sequence":"additional","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"24_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"24_CR2","unstructured":"G. Birkhoff, Lattice Theory, Amer. Math. Soc. vol. XXV (1967)."},{"key":"24_CR3","unstructured":"A. H. Clifford, G. B. Preston, The Algebraic Theory of Semigroups Amer. Math. Soc. Math. Surveys 7 (1964)."},{"key":"24_CR4","first-page":"99","volume-title":"Several Algorithms for Finite Algebras","author":"M. Demlov\u00e1","year":"1979","unstructured":"M. Demlov\u00e1, J. Demel, V. Koubek, Several Algorithms for Finite Algebras, Proceedings of FCT'79, Akademie-Verlag, Berlin (1979), 99\u2013104."},{"key":"24_CR5","first-page":"301","volume-title":"A Reduct \u2014 and \u2014 Closure Algorithms for Graphs","author":"A. Goral\u010d\u00edkov\u00e1","year":"1979","unstructured":"A. Goral\u010d\u00edkov\u00e1, V. Koubek, A Reduct \u2014 and \u2014 Closure Algorithms for Graphs, Proceedings of MFCS '79, Springer-Verlag Berlin, Heidelberg, New York (1979), 301\u2013307"},{"key":"24_CR6","first-page":"165","volume":"9","author":"L. Ja. Kulikov","year":"1941","unstructured":"L. Ja. Kulikov, On Abelian Groups of an Arbitrary Cardinality, Mat. Sbornik 9(1941), 165\u2013182 (in Russian).","journal-title":"Mat. Sbornik"},{"key":"24_CR7","first-page":"999","volume":"144","author":"B. M. Schein","year":"1962","unstructured":"B. M. Schein, On Subdirectly Irreducible Semigroups, Doklady, 144(1962), 999\u20131002 (in Russian).","journal-title":"Doklady"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/0020-0190(72)90012-9","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Determining Whether a Groupoid Is a Group, Inf. Proc. Letters 1(1972), 120\u2013124.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:33:11Z","timestamp":1619555591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}