{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:24:34Z","timestamp":1649197474282},"reference-count":20,"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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7747,"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":[[1992,5]]},"DOI":"10.1016\/0304-3975(92)90004-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"263-287","source":"Crossref","is-referenced-by-count":3,"title":["A multiparameter analysis of domino tiling with an application to concurrent systems"],"prefix":"10.1016","volume":"98","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(92)90004-Y_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/62.322433","article-title":"Some combinatorial game problems require \u03a9(nk) time","volume":"31","author":"Adachi","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB2","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Mem. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/0304-3975(92)90004-Y_BIB3","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","article-title":"Domino-tiling games","volume":"32","author":"Chlebus","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB4","first-page":"479","article-title":"Proving NP-completeness using bounded tiling","volume":"8","author":"Chlebus","year":"1987","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB5","first-page":"98","article-title":"Domino games with an application to the complexity of Boolean algebras with bounded quantifier alternations","author":"Gradel","year":"1988","journal-title":"Proc. Symp. Theoretical Aspects of Computer Science"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB6","first-page":"51","article-title":"Recurring dominoes: making the highly undecidable highly understandable","volume":"24","author":"Harel","year":"1985","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/0304-3975(92)90004-Y_BIB7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","article-title":"Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness","volume":"33","author":"Harel","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(92)90004-Y_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01699467","article-title":"Gradually intractable problems and nondeterministic log-space lower bounds","volume":"18","author":"Kasai","year":"1985","journal-title":"Math. Systems Theory"},{"issue":"4","key":"10.1016\/0304-3975(92)90004-Y_BIB10","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/0208046","article-title":"Classes of pebble games and complete problems","volume":"8","author":"Kasai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(80)90033-1","article-title":"The complexity of problems in systems of communicating sequential processes","volume":"21","author":"Ladner","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB12","first-page":"35","article-title":"Complexity of solvable cases of the decision problem for the predicate calculus","author":"Lewis","year":"1978","journal-title":"IEEE FOCS"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB13","series-title":"Elements of the theory of computation","author":"Lewis","year":"1981"},{"issue":"1","key":"10.1016\/0304-3975(92)90004-Y_BIB14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","article-title":"A multiparameter analysis of the boundedness problem for vector addition systems","volume":"32","author":"Rosier","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(88)90031-X","article-title":"On the complexity of deciding fair termination of probabilistic concurrent finite-state programs","volume":"58","author":"Rosier","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB16","article-title":"Bounded tiling, an alternative to satisfiability?","author":"Savlsberg","year":"1984","journal-title":"Proc. 2nd Frege Conference"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB18","first-page":"76","article-title":"Dominoes are forever","author":"van Emde Boas","year":"1983","journal-title":"Proc. 1st GTI Workshop"},{"key":"10.1016\/0304-3975(92)90004-Y_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","article-title":"Proving theorems by pattern recognition ii","volume":"40","author":"Wang","year":"1961","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(92)90004-Y_BIB20","unstructured":"H. Yen, Communicating processes, scheduling and the complexity of nontermination, to appear in Math. Systems Theory."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290004Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290004Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:27Z","timestamp":1555077447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290004Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["030439759290004Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90004-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}