{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:04Z","timestamp":1725488944130},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_22","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:42Z","timestamp":1186878342000},"page":"230-242","source":"Crossref","is-referenced-by-count":2,"title":["The Expressive Power and Complexity of Dynamic Process Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015akiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"H. Galperin, A. Wigderson, Succinct Representations of Graphs, Information and Control 56, 1983, 183\u2013198.","journal-title":"Succinct Representations of Graphs, Information and Control"},{"key":"22_CR2","first-page":"1225","volume":"40","author":"S. Ha","year":"1991","unstructured":"S. Ha, E. Lee, Compile-time Scheduling and Assignment of Data-flow Program Graphs with Data-dependent Iteration, IEEE Trans. Computers 40, 1991, 1225\u20131238.","journal-title":"Compile-time Scheduling and Assignment of Data-flow Program Graphs with Data-dependent Iteration"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","first-page":"383","volume-title":"Scheduling Dynamic Graphs","author":"A. Jakoby","year":"2000","unstructured":"A. Jakoby, M. Li\u015akiewicz, R. Reischuk, Scheduling Dynamic Graphs, in Proc. 16th STACS\u201999, LNCS 1563, Springer-Verlag, 1999, 383\u2013392; for a complete version see TR A-00-02, Universit\u00e4t L\u00fcbeck, 2000."},{"key":"22_CR4","first-page":"63","volume":"44","author":"T. Lengauer","year":"1992","unstructured":"T. Lengauer, K. Wagner, The Correlation between the Complexities of the Non-hierarchical and Hierarchical Versions of Graph Problems, J. CSS 44, 1992, 63\u201393.","journal-title":"The Correlation between the Complexities of the Non-hierarchical and Hierarchical Versions of Graph Problems"},{"key":"22_CR5","first-page":"181","volume":"71","author":"C. Papadimitriou","year":"1986","unstructured":"C. Papadimitriou and M. Yannakakis, A Note on Succinct Representations of Graphs, Information and Control 71, 1986, 181\u2013185.","journal-title":"A Note on Succinct Representations of Graphs"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou and M. Yannakakis, Towards an Architecture-Independent Analysis of Parallel Algorithms, Proc. 20. STOC, 1988, 510\u2013513, see also SIAM J. Comput. 19, 1990, 322-328.","DOI":"10.1137\/0219021"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:39:41Z","timestamp":1556739581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}