{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:40:25Z","timestamp":1725489625123},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_36","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"383-392","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","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,4,12]]},"reference":[{"key":"36_CR1","unstructured":"A. Burns, Programming in Occam 2, Addison-Wesley Publishing Company, 1988."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jpdc.1995.1005","volume":"24","author":"H. El-Rewini","year":"1995","unstructured":"H. El-Rewini and H. H. Ali, Static Scheduling of Conditional Branches in Parallel Programs, J. Par. Distrib. Comput. 24, 1995, 41\u201354.","journal-title":"J. Par. Distrib. Comput."},{"key":"36_CR3","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":"36_CR4","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1109\/12.102826","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":"IEEE Trans. Computers"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"A. Jakoby, M. Li\u015bkiewicz, R. Reischuk, Scheduling Dynamic Graphs, Technischer Bericht, Institut f\u00fcr Theoretische Informatik, Med. Universit\u00e4t zu L\u00fcbeck, 1998.","DOI":"10.1007\/3-540-49116-3_36"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"A. Jakoby and R. Reischuk, The Complexity of Scheduling Problems with Communication Delay for Trees, Proc. 3. SWAT, 1992, 165\u2013177.","DOI":"10.1007\/3-540-55706-7_15"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"H. Jung, L. Kirousis, P. Spirakis, Lower Bounds and Efficient Algorithms for Multiprocessor scheduling of DAG s with Communication Delays, Proc. 1. SPAA, 1989, 254\u2013264.","DOI":"10.1145\/72935.72962"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"R. Kieckhafer, Fault-Tolerant Real-Time Task Scheduling in the MAFT Distributed System, Proc. 22. Hawaii Int. Conf. on System Science, 1989, 145\u2013151.","DOI":"10.1109\/HICSS.1989.47154"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"R. Kieckhafer, C. Walter, A. Finn, P. Thambidurai, The MAFT Architecture For Distributed Fault-Tolerance, IEEE Trans. Computers, April 1988, 398\u2013405.","DOI":"10.1109\/12.2183"},{"key":"36_CR10","first-page":"63","volume":"44","author":"T. L. K. Wagner","year":"1992","unstructured":"T. Lengauer, K. Wagner, The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems, J. CSS 44, 1992, 63\u201393.","journal-title":"J. CSS"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","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":"Information and Control"},{"key":"36_CR12","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\u2013328.","DOI":"10.1137\/0219021"},{"key":"36_CR13","volume-title":"Ph.D. Thesis","author":"B. Veltman","year":"1993","unstructured":"B. Veltman, Multiprocessor Scheduling with Communication Delays, Ph.D. Thesis, University of Technology Eindhoven, Department of Computer Science, Eindhoven, The Netherlands, 1993."}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:43:17Z","timestamp":1556772197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}