{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:01Z","timestamp":1759626601575,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00155-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:42:39Z","timestamp":1027629759000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["On the power of Las Vegas II: Two-way finite automata"],"prefix":"10.1016","volume":"262","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00155-9_BIB1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, J.E. Hopcroft, M. Yannakakis, On notions of information transfer in VLSI circuits, Proc. 15th Ann. ACM STOC, ACM, 1983, pp. 133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB2","unstructured":"L. Babai, Monte Carlo algorithms in graph isomorphism techniques, Research Report No. 79-10, D\u00e9partement de math\u00e9matiques et statistique, Universit\u00e9 de Montr\u00e9al, 1979."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB3","first-page":"91","article-title":"A note on sweeping automata","volume":"vol. 85","author":"Berman","year":"1980"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0022-0000(05)80003-0","article-title":"Exact lower bounds for computing Boolean functions on CREW PRAMs","volume":"48","author":"Dietzelfelbinger","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. \u010euris\u0306, J. Hromkovi\u010d, J.D.P. Rolim, G. Schnitger, Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations, in: Proc. STACS \u201997, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997, pp. 117\u2013128.","DOI":"10.1007\/BFb0023453"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages and Computations","author":"Hopcroft","key":"10.1016\/S0304-3975(00)00155-9_BIB7"},{"year":"1997","series-title":"Communication Complexity and Parallel Computing","author":"Hromkovi\u010d","key":"10.1016\/S0304-3975(00)00155-9_BIB8"},{"year":"1997","series-title":"Communication Complexity","author":"Kushilevitz","key":"10.1016\/S0304-3975(00)00155-9_BIB9"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB10","unstructured":"I.I. Macarie, J.I. Seiferas, Strong equivalence of nondeterministic and randomized space-bounded computations, manuscript, 1997."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB11","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, E. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, Proc. 14th ACM STOC\u201982, ACM, 1982, pp. 330\u2013337.","DOI":"10.1145\/800070.802208"},{"issue":"2","key":"10.1016\/S0304-3975(00)00155-9_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(81)90012-0","article-title":"Two-way deterministic finite automata are exponentially more succinct than sweeping automata","volume":"12","author":"Micali","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB13","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","article-title":"Communication complexity","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB14","unstructured":"M. Sauerhoff, On nondeterminism versus randomness for read-once branching programs. Electron. Coll. on Computational Complexity, TR 97-030."},{"key":"10.1016\/S0304-3975(00)00155-9_BIB15","doi-asserted-by":"crossref","unstructured":"M. Sauerhoff, On the size of randomized OBDDs and read-once branching programs for k-stable functions, in: Proc. STACS \u201999, Lecture Notes in Computer Science, 1563, Springer 1999, pp. 488\u2013499.","DOI":"10.1007\/3-540-49116-3_46"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB16","doi-asserted-by":"crossref","unstructured":"W.J. Sakoda, M. Sipser, Nondeterminism and the size of two way finite automata, Proc. 10th ACM STOC, ACM, 1978, pp. 275\u2013286.","DOI":"10.1145\/800133.804357"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB17","doi-asserted-by":"crossref","unstructured":"M. Sipser, Lower bounds on the size of sweeping automata, Proc. 11th ACM STOC, 1979, pp. 360\u2013364.","DOI":"10.1145\/800135.804429"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","article-title":"Lower bounds on the size of sweeping automata","volume":"21","author":"Sipser","year":"1980","journal-title":"J. Computer System Sci."},{"year":"1987","series-title":"The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science,","author":"Wegener","key":"10.1016\/S0304-3975(00)00155-9_BIB19"},{"key":"10.1016\/S0304-3975(00)00155-9_BIB20","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Some complexity questions related to distributed computing, Proc. 11th ACM STOC, ACM, 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:51Z","timestamp":1759625571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500001559"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00155-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the power of Las Vegas II: Two-way finite automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00155-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}