{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:17:00Z","timestamp":1648581420394},"reference-count":13,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1016\/s0020-0190(99)00129-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"113-118","source":"Crossref","is-referenced-by-count":8,"title":["Amplification of slight probabilistic advantage at absolutely no cost in space"],"prefix":"10.1016","volume":"72","author":[{"given":"Ioan I.","family":"Macarie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel I.","family":"Seiferas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(99)00129-5_ID005","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."},{"issue":"4","key":"10.1016\/S0020-0190(99)00129-5_ID006","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On non-determinancy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/S0020-0190(99)00129-5_ID007","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1969","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0020-0190(99)00129-5_ID008","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0890-5401(87)90057-5","article-title":"On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes","volume":"75","author":"Karpinski","year":"1987","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0020-0190(99)00129-5_ID009","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0129054196000233","article-title":"A note on multihead finite-state automata","volume":"7","author":"Macarie","year":"1996","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1","key":"10.1016\/S0020-0190(99)00129-5_ID010","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02679455","article-title":"Multihead two-way probabilistic finite automata","volume":"30","author":"Macarie","year":"1997","journal-title":"Theory Comput. Systems"},{"issue":"1","key":"10.1016\/S0020-0190(99)00129-5_ID011","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","article-title":"Two-way multihead automata over a one-letter alphabet","volume":"14","author":"Monien","year":"1980","journal-title":"RAIRO Informatique Th\u00e9orique\/Theoret. Inform."},{"issue":"2","key":"10.1016\/S0020-0190(99)00129-5_ID012","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","article-title":"Space-bounded hierarchies and probabilistic computations","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0020-0190(99)00129-5_ID013","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","article-title":"Relating refined space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00129-5_ID014","series-title":"IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann Arbor, MI","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"},{"issue":"2","key":"10.1016\/S0020-0190(99)00129-5_ID015","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0168-0072(94)00026-Y","article-title":"Characterization of realizable space complexities","volume":"73","author":"Seiferas","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"issue":"11","key":"10.1016\/S0020-0190(99)00129-5_ID016","first-page":"1593","article-title":"Sensing two-way three heads are better than two","volume":"E79-D","author":"Wang","year":"1996","journal-title":"IEICE Trans. Inform. Systems"},{"issue":"6","key":"10.1016\/S0020-0190(99)00129-5_ID017","first-page":"625","article-title":"Some hierarchy results on multihead automata over a one-letter alphabet","volume":"E76-D","author":"Wang","year":"1993","journal-title":"IEICE Trans. Inform. Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:50:29Z","timestamp":1556059829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0020019099001295"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00129-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}