{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:06Z","timestamp":1725486306040},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_30","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"339-352","source":"Crossref","is-referenced-by-count":5,"title":["Space Efficient Algorithms for Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"L\u00edskiewicz","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":[[2001,3,16]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, C. Rackoff, Random Walks, Universal Sequences and the Complexity of Maze Problems, Proc. 20. FOCS,1979, 218\u2013223.","DOI":"10.1109\/SFCS.1979.34"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C. \u00c1lvarez","year":"1993","unstructured":"C. \u00c1lvarez, B. Jenner, A Very Hard Log-space Counting Classes, TCS 107, 1993, 3\u201330.","journal-title":"TCS"},{"key":"30_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-46541-3_7","volume-title":"Proc. 17. STACS","author":"E. Allender","year":"2000","unstructured":"E. Allender, M. Mahajan, The Complexity of Planarity Testing, Proc. 17. STACS, LNCS 1770, 2000, 87\u201398."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0221006","volume":"21","author":"M. Ben-Or","year":"1992","unstructured":"M. Ben-Or, R. Cleve Computing Algebraic Formulas Using a Constant Number of Registers, SIAM J. Comput. 21, 1992, 54\u201358.","journal-title":"SIAM J. Comput"},{"key":"30_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-61680-2_62","volume-title":"Proc. 4. ESA","author":"H. Bodlaender","year":"1996","unstructured":"H. Bodlaender, B. de Fluiter, Parallel Algorithms for Series Parallel Graphs, Proc. 4. ESA, LNCS 1136, 1996, 277\u2013289."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V. Bang Le, J. Spinrad, Graph Classes: A Survey, SIAM 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/0221046","volume":"21","author":"S. Buss","year":"1992","unstructured":"S. Buss, S. Cook, A. Gupta, V. Ramachandran, An Optimal Parallel Algorithm for Formula Evaluation, SIAM J. Comput. 21, 1992, 755\u2013780.","journal-title":"SIAM J. Comput"},{"key":"30_CR8","unstructured":"A. Chiu, G. Davida, B. Litow, NC 1 Division, unpublished manuscript, November 1999."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S. Cook","year":"1987","unstructured":"S. Cook, P. McKenzie, Problems Complete for Deterministic Logarithmic Space, J. Algo. 8, 1987, 385\u2013394.","journal-title":"J. Algo"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R. Duffin","year":"1965","unstructured":"R. Duffin, Topology of Series-Parallel Networks, J.Math. Analysis Appl. 10, 1965, 303\u2013318.","journal-title":"J.Math. Analysis Appl"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, Parallel Recognition of Series-Parallel Graphs, Inf. & Comp. 98, 1992, 41\u201355.","journal-title":"Inf. & Comp"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0890-5401(87)90061-7","volume":"75","author":"X. He","year":"1987","unstructured":"X. He, Y. Yesha, Parallel Recognition and Decomposition of Two Terminal Series Parallel Graphs, Inf. & Comp. 75, 1987, 15\u201338.","journal-title":"Inf. & Comp"},{"key":"30_CR13","unstructured":"B. Jenner, K.-J. Lange, P. McKenzie, Tree Isomorphism and Some Other Complete Problems for Deterministic Logspace, publication #1059, DIRO, Universit\u00e9 de Montr\u00e9al, 1997."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"R. Karp, V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, in: J. van Leeuwen (Ed.): Handbook of Theoretical Computer Science, Volume A, 1990, 869\u2013941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. Tarjan, E. Lawlers The Recognition of Series Parallel Digraphs, SIAM J. Comput. 11, 1982, 298\u2013313.","journal-title":"SIAM J. Comput"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:29:55Z","timestamp":1556501395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}