{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:19:29Z","timestamp":1794338369807,"version":"4.9.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540123172","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0036925","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T12:38:14Z","timestamp":1138192694000},"page":"408-419","source":"Crossref","is-referenced-by-count":2,"title":["A fast sorting algorithm for VLSI"],"prefix":"10.1007","author":[{"given":"Hans -Werner","family":"Lang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred","family":"Schimmler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hartmut","family":"Schmeck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heiko","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","first-page":"307","volume-title":"Proc. AFIPS 1968 SJCC, Vol. 32","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their application. Proc. AFIPS 1968 SJCC, Vol. 32, AFIPS Press, Montvale, N.J., 307\u2013314 (1968)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Monier, L.: A model of computation for VLSI with related complexity results. Proc. 13th STOC, 318\u2013325 (1981)","DOI":"10.1145\/800076.802485"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Foster, M.J., Kung, H.T.: The design of special-purpose VLSI chips. IEEE Computer, 26\u201340 (1980)","DOI":"10.1145\/800053.801938"},{"key":"33_CR4","unstructured":"Knuth, D.E.: The Art of Computer Programming Vol. 3: Sorting and Searching. Addison Wesley (1973)"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"H.T. Kung","year":"1977","unstructured":"Kung, H.T., Thompson, C.D.: Sorting on a mesh-connected parallel computer. Comm. ACM 20, 263\u2013271 (1977)","journal-title":"Comm. ACM"},{"key":"33_CR6","unstructured":"Mead, C., Conway, L.: Introduction to VLSI Systems. Addison Wesley (1980)"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H.S. Stone","year":"1971","unstructured":"Stone, H.S.: Parallel processing with the perfect shuffle. IEEE Trans. Comput. C-20, 153\u2013161 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"33_CR8","volume-title":"Ph.D. Thesis","author":"C.D. Thompson","year":"1980","unstructured":"Thompson, C.D.: A complexity theory for VLSI. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh (1980)"},{"key":"33_CR9","unstructured":"van Leeuwen, J.: Distributed computing. Technical report RUU-CS-82-8, Department of Computer Science, University of Utrecht (1982)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036925.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:21:38Z","timestamp":1607534498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123172"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0036925","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0036892","asserted-by":"object"}]},"subject":[]}}