{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:48:46Z","timestamp":1725738526074},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_32","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"349-360","source":"Crossref","is-referenced-by-count":5,"title":["Evolving Graph-Structures and Their Implicit Computational Complexity"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the poly-time functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic\u00a01(1), 77\u2013111 (2000)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1","key":"32_CR3","first-page":"73","volume":"21","author":"L. Hartmann","year":"2011","unstructured":"Hartmann, L., Jones, N.D., Simonsen, J.G., Vrist, S.B.: Programming in biomolecular computation: Programs, self-interpretation and visualisation. Sci. Ann. Comp. Sci.\u00a021(1), 73\u2013106 (2011)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Sch\u00f6pp, U.: Pure pointer programs with iteration. ACM Trans. Comput. Log.\u00a011(4) (2010)","DOI":"10.1145\/1805950.1805956"},{"issue":"1-2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N.D. Jones","year":"1999","unstructured":"Jones, N.D.: Logspace and ptime characterized by programming languages. Theor. Comput. Sci.\u00a0228(1-2), 151\u2013174 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR6","unstructured":"Kolmogorov, A.N., Uspensky, V.: On the definition of an algorithm. Uspekhi Mat. Naut.\u00a013(4) (1958)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Predicative recurrence and computational complexity I: Word recurrence and poly-time. In: Feasible Mathematics II. Birkhauser-Boston (1994)","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Marion, J.-Y.: A type system for complexity flow analysis. In: LICS (2011)","DOI":"10.1109\/LICS.2011.41"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"517","DOI":"10.3233\/JCS-2009-0352","volume":"17","author":"A. Sabelfeld","year":"2009","unstructured":"Sabelfeld, A., Sands, D.: Declassification: dimensions and principles. J. Comput. Secur.\u00a017, 517\u2013548 (2009)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comp.\u00a09(3), 490\u2013508 (1980)","journal-title":"SIAM J. Comp."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Reference machines require non-linear time to maintain disjoint sets. In: STOC 1977, pp. 18\u201329. ACM (1977)","DOI":"10.1145\/800105.803392"},{"issue":"2\/3","key":"32_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D. Volpano","year":"1996","unstructured":"Volpano, D., Irvine, C., Smith, G.: A sound type system for secure flow analysis. Journal of Computer Security\u00a04(2\/3), 167\u2013188 (1996)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:14:06Z","timestamp":1557897246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}