{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:21:08Z","timestamp":1742952068812,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_35","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"417-429","source":"Crossref","is-referenced-by-count":9,"title":["The Complexity of Sorting with Networks of Stacks and Queues"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pergel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0196-6774(89)90037-0","volume":"10","author":"N. Amato","year":"1989","unstructured":"Amato, N., Blum, M., Irani, S., Rubinfeld, R.: Reversing trains: a turn of the century sorting problem. J. Alg.\u00a010, 413\u2013428 (1989)","journal-title":"J. Alg."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(96)00057-6","volume":"178","author":"M.D. Atkinson","year":"1997","unstructured":"Atkinson, M.D., Livesy, M.J., Tulley, D.: Permutations generated by token passing in graphs. Theor. Comput. Sci.\u00a0178, 103\u2013118 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"35_CR3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.37236\/1688","volume":"9","author":"M. B\u00f3na","year":"2003","unstructured":"B\u00f3na, M.: A survey of stack-sorting disciplines. Electr. J. Combin.\u00a09(2), 16 pages (2003)","journal-title":"Electr. J. Combin."},{"key":"35_CR4","doi-asserted-by":"crossref","DOI":"10.1201\/9780203494370","volume-title":"Combinatorics of Permutations","author":"M. B\u00f3na","year":"2004","unstructured":"B\u00f3na, M.: Combinatorics of Permutations. Chapman & Hall, Boca Raton (2004)"},{"key":"35_CR5","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol.\u00a01. Addison-Wesley, Reading (updated and revised) (1997)","edition":"3"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M.E.: Sorting with Complete Networks of Stacks, TU Berlin, Mathematik (preprint, 036-2007)","DOI":"10.1007\/978-3-540-92182-0_78"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-540-75520-3_64","volume-title":"Algorithms \u2013 ESA 2007","author":"F.G. K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Sch\u00e4fer, G., Spenke, I.: Solutions to real-world instances of Pspace-complete stacking. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 729\u2013740. Springer, Heidelberg (2007)"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Sorting using networks of queues and stacks. J. Assoc. Comput. Mach.\u00a019, 341\u2013346 (1972)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:17:31Z","timestamp":1715059051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}