{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:33Z","timestamp":1771024233533,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540100034","type":"print"},{"value":"9783540393467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_89","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:00:13Z","timestamp":1330189213000},"page":"422-435","source":"Crossref","is-referenced-by-count":74,"title":["Pebbling mountain ranges and its application to DCFL-recognition"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"S.A. Cook: Deterministic CFL's are accepted simultaneously in polynomial time and log squared tape, 11th ACM Symposium on Theory of Computing, 1971, 338\u2013345","DOI":"10.1145\/800135.804426"},{"issue":"5","key":"36_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0190(79)90121-2","volume":"8","author":"E. M. Gurari","year":"1979","unstructured":"E.M. Gurari, O.H. Ibarra: On the space complexity of recursive algorithm, Inf. Proc. Letters, Vol. 8, No. 5, 1979, 267\u2013272","journal-title":"Inf. Proc. Letters"},{"key":"36_CR3","unstructured":"B. Schmidt: Ph.D. Thesis, Universit\u00e4t des Saarlandes, Fachbereich 10, 6600 Saarbr\u00fccken, in preparation"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"S. Swami, J. Savage: Space-Time Tradeoffs for linear Recursion, 6th ACM Symposium on Principles of Programming Languages, 1979, 135\u2013142","DOI":"10.1145\/567752.567765"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:08:54Z","timestamp":1742587734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980]]}}}