{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:38Z","timestamp":1759637678078},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0304-3975(97)00185-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"225-237","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of deadlock detection in families of planar nets"],"prefix":"10.1016","volume":"215","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-C\u00e9cile","family":"Fabret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00185-0_BIB1","series-title":"STACS'91","first-page":"334","article-title":"Detection of deadlocks in an infinite family of nets","volume":"vol. 480","author":"Beauquier","year":"1991"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB2","series-title":"STOC","first-page":"204","article-title":"On the theory of average case complexity","author":"Ben-David","year":"1989"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB3","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Memoirs Amer. Math. Soc."},{"issue":"5","key":"10.1016\/S0304-3975(97)00185-0_BIB4","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1137\/0222059","article-title":"Randomizing reductions of search problems","volume":"22","author":"Blass","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00185-0_BIB5","doi-asserted-by":"crossref","unstructured":"A. Blass, Y. Gurevich, Matrix transformation is complete for the average case, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539792232070"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB6","article-title":"Automates cellulaires: r\u00e9versibilit\u00e9 et complexit\u00e9","author":"Durand","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(97)00185-0_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(94)00293-R","article-title":"A random NP-complete problem for inversion of 2D cellular automata","volume":"148","author":"Durand","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00185-0_BIB8","article-title":"Etude de quelques propri\u00e9t\u00e9s de familles de r\u00e9seaux modulaires","author":"Fabret","year":"1996"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB9","series-title":"STACS'95","article-title":"On the undecidability of deadlock detection in families of nets","volume":"vol. 900","author":"Fabret","year":"1995"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB11","series-title":"FOCS","article-title":"Complete and incomplete randomized NP problems","author":"Gurevich","year":"1987"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","article-title":"Average case completeness","volume":"42","author":"Gurevich","year":"1991","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0304-3975(97)00185-0_BIB13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","article-title":"Average case complete problems","volume":"15","author":"Levin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00185-0_BIB14","first-page":"35","article-title":"Complexity of solvable cases of the decision problem for the predicate calculus","volume":"vol. 19","author":"Lewis","year":"1978"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(92)90150-E","article-title":"A linear speed-up theorem for cellular automata","volume":"101","author":"Mazoyer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00185-0_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and nonperiodicity for tilings of the plane","volume":"12","author":"Robinson","year":"1971","journal-title":"Invent. Math."},{"key":"10.1016\/S0304-3975(97)00185-0_BIB17","series-title":"LATIN'95","article-title":"Simulations between cellular automata on Cayley graphs","author":"R\u00f3ka","year":"1995"},{"key":"10.1016\/S0304-3975(97)00185-0_BIB18","article-title":"Dominoes are forever","author":"van Embde Boas","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001850?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001850?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:20:19Z","timestamp":1555420819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397597001850"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00185-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}