{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:40Z","timestamp":1761597040191,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427520"},{"type":"electronic","value":"9783540455042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45504-3_1","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T22:56:02Z","timestamp":1187045762000},"page":"1-21","source":"Crossref","is-referenced-by-count":4,"title":["Linear Ramified Higher Type Recursion and Parallel Complexity"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Aehlig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Johannsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Schwichtenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90057-S","volume":"53","author":"B. Allen","year":"1991","unstructured":"B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53(1):1\u201350, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"S. Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, Universityof Toronto, 1992.","key":"1_CR2"},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-60178-3_88","volume-title":"Logic and Computational Complexity","author":"S. Bellantoni","year":"1995","unstructured":"S. Bellantoni. Characterizing parallel time by type 2 recursions with polynomial output length. In D. Leivant, editor, Logic and Computational Complexity, pages 253\u2013268. Springer LNCS 960, 1995."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97\u2013110, 1992.","journal-title":"Computational Complexity"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0168-0072(00)00006-3","volume":"104","author":"S. Bellantoni","year":"2000","unstructured":"S. Bellantoni, K.-H. Niggl, and H. Schwichtenberg. Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic, 104:17\u201330, 2000.","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"S. Bellantoni and I. Oitavem. Separating NC along the \u03b4 axis. Submitted, 2001.","key":"1_CR6"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01202288","volume":"4","author":"S. Bloch","year":"1994","unstructured":"S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4:175\u2013205, 1994.","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"P. Clote. Sequential, machine independent characterizations of the parallel complexity classes ALogTIME, AC k , NC k and NC. In S. Buss and P. Scott, editors, Feasible Mathematics, pages 49\u201369. Birkh\u00e4user, 1990.","key":"1_CR8","DOI":"10.1007\/978-1-4612-3466-1_4"},{"unstructured":"A. Cobham. The intrinsic computational difficultyof functions. In Proceedings of the second International Congress on Logic, Methodology and Philosophy of Science, pages 24\u201330, 1965.","key":"1_CR9"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","volume":"12","author":"K. G\u00f6del","year":"1958","unstructured":"K. G\u00f6del. \u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes. Dialectica, 12:280\u2013287, 1958.","journal-title":"Dialectica"},{"doi-asserted-by":"crossref","unstructured":"M. Hofmann. Programming languages capturing complexityclasses. ACM SIGACT News, 31(2), 2000. Logic Column 9.","key":"1_CR11","DOI":"10.1145\/346048.568491"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0168-0072(00)00010-5","volume":"104","author":"M. Hofmann","year":"2000","unstructured":"M. Hofmann. Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic, 104:113\u2013166, 2000.","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1998.","key":"1_CR13"},{"doi-asserted-by":"crossref","unstructured":"D. Leivant. Stratified functional programs and computational complexity. In Proc. of the 20th Symposium on Principles of Programming Languages, pages 325\u2013333, 1993.","key":"1_CR14","DOI":"10.1145\/158511.158659"},{"doi-asserted-by":"crossref","unstructured":"D. Leivant. A characterization of NC bytree recurrence. In Proc. 39th Symposium on Foundations of Computer Science, pages 716\u2013724, 1998.","key":"1_CR15","DOI":"10.1109\/SFCS.1998.743522"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(99)00209-1","volume":"236","author":"D. Leivant","year":"2000","unstructured":"D. Leivant and J.-Y. Marion. A characterization of alternating log time by ramified recurrence. Theoretical Computer Science, 236:193\u2013208, 2000.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Proof Theory in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45504-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:28:43Z","timestamp":1737365323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45504-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427520","9783540455042"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45504-3_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}