{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:03:37Z","timestamp":1725631417936},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127345"},{"type":"electronic","value":"9783642692987"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/978-3-642-69298-7_9","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T17:50:24Z","timestamp":1320774624000},"page":"101-116","source":"Crossref","is-referenced-by-count":5,"title":["Partition Sorts for VLSI"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Schr\u00f6der","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"81","volume-title":"Kung, H.T., Sproull, B., Steele, G. (eds.): VLSI Systems and Computations, Springer Verlag","author":"G Bilardi","year":"1981","unstructured":"Bilardi, G., Pracchi, M., Preparata, F.P.: A Critique and an Appraisal of VLSI Models of Computation. In: Kung, H.T., Sproull, B., Steele, G. (eds.): VLSI Systems and Computations, Springer Verlag, 81\u201388 (1981)"},{"doi-asserted-by":"crossref","unstructured":"Chazelle, B.M., Monier, L.M.: A Model of Computation for VLSI with Related Complexity Results. Proc. 13th Symp. Theory of Computing, 318\u2013325 (1981)","key":"9_CR2","DOI":"10.1145\/800076.802485"},{"key":"9_CR3","first-page":"269","volume-title":"VLSI 81","author":"BM Chazelle","year":"1981","unstructured":"Chazelle, B.M., Monier, L.M.: Optimality in VLSI. In: Gray, J.P. (ed.): VLSI 81, Academic Press, London, 269\u2013278 (1981)"},{"key":"9_CR4","volume-title":"The Art of Computer Programming. Vol 3\/ Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol 3\/ Sorting and Searching. Addison-Wesley, Reading, MA 1973"},{"unstructured":"Kung, H.T., Leiserson, C.E.: Algorithms for VLSI processor arrays. In chapter 8 of [MC]","key":"9_CR5"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"HT Kung","year":"1977","unstructured":"Kung, H.T., Thompson, C.D.: Sorting on a Mesh-Connected Parallel Computer. CACM, Vol. 20, 263\u2013271 (1977)","journal-title":"CACM"},{"unstructured":"LSSS]Lang, H.W., Schimmler, M., Schmeck, H., Schr\u00f6der, H.: A Fast Sorting Algorithm for VLSI. Proc. 10th ICALP, 1983.","key":"9_CR7"},{"key":"9_CR8","volume-title":"Introduction to VLSI Systems","author":"C Mead","year":"1980","unstructured":"Mead, C., Conway, L.: Introduction to VLSI Systems. Addison-Wesley, Reading, MA 1980"},{"key":"9_CR9","volume-title":"Report","author":"H Schmeck","year":"1982","unstructured":"Schmeck, H., Schr\u00f6der, H.: VLSI-gerechte Lexikon-Rechner. Tech. Report 8204, Inst. f\u00fcr Informatik, Universit\u00e4t Kiel, Kiel, 1982"},{"doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-Time Complexity for VLSI. Proc. 11th Symp. Theory of Computing 81\u201388 (1979)","key":"9_CR10","DOI":"10.1145\/800135.804401"}],"container-title":["Informatik-Fachberichte","GI - 13. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-69298-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:27:12Z","timestamp":1606256832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-69298-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127345","9783642692987"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-69298-7_9","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1983]]}}}