{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:36:35Z","timestamp":1758274595058},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"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":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90211-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"75-91","source":"Crossref","is-referenced-by-count":3,"title":["On the power of several queues"],"prefix":"10.1016","volume":"113","author":[{"given":"Martin","family":"H\u00fchne","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90211-B_BIB1","first-page":"75","article-title":"On k-tape versus (k\u22121)-tape real time computation","volume":"Vol. 7","author":"Aanderaa","year":"1974"},{"key":"10.1016\/0304-3975(93)90211-B_BIB2","first-page":"162","article-title":"Breadth-first phrase structure grammars and queue automata","author":"Allevi","year":"1988","journal-title":"Proc. 13th Symp. on Mathematical Foundations of Computer Science (MFCS)"},{"key":"10.1016\/0304-3975(93)90211-B_BIB3","volume":"Vols. 11 and 22","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(93)90211-B_BIB4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0022-0000(80)90026-4","article-title":"Multiple equality sets and Post machines","volume":"21","author":"Brandenburg","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90211-B_BIB5","series-title":"Proc. 13th Intern. Conf. on Automata, Languages, and Programming (ICALP)","first-page":"60","article-title":"Intersections of some families of languages","author":"Brandenburg","year":"1986"},{"key":"10.1016\/0304-3975(93)90211-B_BIB6","article-title":"Theories of Computational Complexity","volume":"Vol. 35","author":"Calude","year":"1988"},{"key":"10.1016\/0304-3975(93)90211-B_BIB7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0020-0190(89)90160-9","article-title":"The speed of copying on one-tape off-line Turing machines","volume":"33","author":"Dietzfelbinger","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90211-B_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(84)80019-4","article-title":"Two nonlinear lower bounds for on-line computations","volume":"60","author":"\u010euri\u0161","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90211-B_BIB9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90211-B_BIB10","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90211-B_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/PGEC.1966.264374","article-title":"On-line Turing machine computations","volume":"15","author":"Hennie","year":"1966","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0304-3975(93)90211-B_BIB12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-tape simulation of multitape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90211-B_BIB13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(88)90047-5","article-title":"Simulating two pushdown stores by one tape in O(n1.5logn) time","volume":"37","author":"Li","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90211-B_BIB14","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/0221042","article-title":"The power of the queue","volume":"21","author":"Li","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90211-B_BIB15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0890-5401(88)90003-X","article-title":"Tape versus queue and stacks: the lower bounds","volume":"78","author":"Li","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90211-B_BIB16","series-title":"Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity","first-page":"187","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"key":"10.1016\/0304-3975(93)90211-B_BIB17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1090\/S0002-9947-1985-0808746-4","article-title":"Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines","volume":"292","author":"Maass","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90211-B_BIB18","series-title":"Proc. 19th Symp. on the Theory of Computing (STOC)","first-page":"94","article-title":"Two tapes are better than one for off-line Turing machines","author":"Maass","year":"1987"},{"key":"10.1016\/0304-3975(93)90211-B_BIB19","first-page":"88","article-title":"Milking the Aanderaa argument","volume":"88","author":"Paturi","year":"1990","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90211-B_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)91055-5","article-title":"On-line simulation of k + 1 tapes by k tapes requires nonlinear time","volume":"53","author":"Paul","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90211-B_BIB21","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0022-0000(81)90009-X","article-title":"An information-theoretic approach to time bounds for on-line computation","volume":"23","author":"Paul","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90211-B_BIB22","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"26","author":"Pippenger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90211-B_BIB23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","article-title":"Real time computation","volume":"1","author":"Rabin","year":"1963","journal-title":"Israel J. Math."},{"key":"10.1016\/0304-3975(93)90211-B_BIB24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90211-B_BIB25","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02234250","article-title":"\u00dcber einen Automaten mit Pufferspeicherung","volume":"5","author":"Vollmar","year":"1970","journal-title":"Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390211B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390211B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:22:48Z","timestamp":1555129368000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390211B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390211B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90211-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}