{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:28Z","timestamp":1725662908008},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:55Z","timestamp":1330193035000},"page":"486-489","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The simple roots of real-time computation hierarchies"],"prefix":"10.1007","author":[{"given":"Paul M. B.","family":"Vit\u00e1nyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"45_CR1","first-page":"75","volume":"7","author":"S. O. Aanderaa","year":"1974","unstructured":"Aanderaa, S.O., On k-tape versus (k \u2212 1)-tape real-time computation. In: SIAM-AMS Proceedings, Vol. 7 (Complexity of Computation), 1974, 75\u201396.","journal-title":"SIAM-AMS Proceedings"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321724.321726","volume":"19","author":"P. C. Fischer","year":"1972","unstructured":"Fischer, P.C., A.R. Meyer and A.L. Rosenberg, Real-time simulation of multihead tape-units, J. Ass. Comp. Mach.\n19 (1972) 590\u2013607.","journal-title":"J. Ass. Comp. Mach."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., and A.L. Rosenberg, Limited random access Turing machines, Proceedings 9-th IEEE Conference on Switching and Automata Theory, 1968, 356\u2013367.","DOI":"10.1109\/SWAT.1968.15"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Real-time simulation of concatenable double-ended queues by double-ended queues. Proceedings 11-th ACM Symposium on Theory of Computing, 1979, 346\u2013351.","DOI":"10.1145\/800135.804427"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Leong, B., and J.I. Seiferas, New real-time simulations of multihead tape units, Proceedings 9-th ACM Symposium on Theory of Computing, 1977, 239\u2013248.","DOI":"10.1145\/800105.803414"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Paul, W.J., On-line simulation of k + 1 tapes by k tapes requires nonlinear time. Proceedings 22-nd IEEE Conference on Foundations of Computer Science, 1982, 53\u201356.","DOI":"10.1109\/SFCS.1982.31"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Paul, W.J., J.I. Seiferas and J. Simon, An information-theoretic approach to time bounds for on-line computation. Proceedings 12-th ACM Symposium on Theory of Computing, 1980, 357\u2013367.","DOI":"10.1145\/800141.804685"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N., and M.J. Fischer, Relations among complexity measures, Journal ACM\n26 (1979) 361\u2013384.","journal-title":"Journal ACM"},{"key":"45_CR9","first-page":"658","volume-title":"Proceedings of the 7-th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 85","author":"P. M. B. B. Vit\u00e1nyi","year":"1980","unstructured":"Vit\u00e1nyi, P.M.B., On the power of real-time Turing machines under varying specifications. Proceedings of the 7-th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science\n85, Springer Verlag, Berlin, 1980, 658\u2013671."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:49:42Z","timestamp":1578527382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_45"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}