{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:47:36Z","timestamp":1787503656767,"version":"build-2736575974"},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"value":"354015650X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015730","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:45:47Z","timestamp":1132706747000},"page":"53-62","source":"Crossref","is-referenced-by-count":6,"title":["The influence of key length on the area-time complexity of sorting"],"prefix":"10.1007","author":[{"given":"G.","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"C. D. Thompson, \u201cA Complexity Theory for VLSI,\u201c Ph.D. Thesis, Dept. of Comp. Science, Carnegie-Mellon Univ.; August 1980."},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/322261.322269","volume":"28","author":"R. P. Brent","year":"1981","unstructured":"R. P. Brent and H. T. Kung, \u201cThe chip complexity of binary arithmetic,\u201c Journal of the ACM, vol. 28, n. 3, pp. 521\u2013534; July 1981.","journal-title":"Journal of the ACM"},{"issue":"3","key":"5_CR3","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TC.1983.1676221","volume":"C-32","author":"J. Vuillemin","year":"1983","unstructured":"J. Vuillemin, \u201cA combinatorial limit to the computing power of VLSI circuits,\u201c IEEE Trans. on Comp. vol. C-32, n. 3, pp. 294\u2013300, March 1983.","journal-title":"IEEE Trans. on Comp."},{"key":"5_CR4","unstructured":"G. Bilardi and F. P. Preparata, \u201cSquare tessellation techniques for area-time lower bounds,\u201c submitted for publication."},{"key":"5_CR5","unstructured":"G. Bilardi, \u201cThe Area-Time Complexity of Sorting,\u201c Ph.D. Thesis, Univ. of Illinois, 1984."},{"key":"5_CR6","unstructured":"J. D. Ullman, Computational Aspects of VLSI, Computer Science Press; 1983."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, \u201cTight bounds on the complexity of parallel sorting,\u201c Proc. 16th Annual ACM Symposium on Theory of Computing, Washington, D. C., pp. 71\u201380; April 1984. (Also IEEE Trans. on Comp. April 1985).","DOI":"10.1109\/TC.1985.5009385"},{"key":"5_CR8","unstructured":"A. Siegel, \u201cOptimal area VLSI circuits for sorting,\u201c submitted for sub. publication."},{"issue":"12","key":"5_CR9","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","volume":"C-32","author":"C. D. Thompson","year":"1983","unstructured":"C. D. Thompson, The VLSI complexity of sorting, IEEE Trans. Comp., vol. C-32, n. 12, pp. 1171\u20131184; Dec. 1983.","journal-title":"IEEE Trans. Comp."},{"issue":"7","key":"5_CR10","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1109\/TC.1984.5009338","volume":"C-33","author":"G. Bilardi","year":"1984","unstructured":"G. Bilardi and F. P. Preparata, \u201cAn architecture for bitonic sorting with optimal VLSI performance,\u201c IEEE Trans. Comp., vol. C-33, n. 7, pp. 640\u2013651; July 1984.","journal-title":"IEEE Trans. Comp."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"G. Bilardi and F. P. Preparata, \u201cA minimum area VLSI network for O(logN) time sorting\u201d, Proc. 16th Annual ACM Symposium on Theory of Computing, Washington, D. C., pp. 64\u201370; April 1984. (Also see IEEE Trans. on Comp. April 1985.)","DOI":"10.1145\/800057.808666"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"G. Bilardi and F. P. Preparata, \u201cThe VLSI optimality of the AKS sorting network,\u201c Information Processing Letters, to appear.","DOI":"10.1016\/0020-0190(85)90062-6"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0020-0190(80)90010-1","volume":"11","author":"R. B. Johnson","year":"1980","unstructured":"R. B. Johnson, \u201cThe complexity of a VLSI adder,\u201c Information Processing Letters, vol. 11, n. 2, pp. 92\u201393; October 1980.","journal-title":"Information Processing Letters"},{"key":"5_CR14","unstructured":"G. M. Baudet, \u201cOn the area required by VLSI circuits,\u201c manuscript."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"A. Siegel, \u201cMinimal Storage Sorting Circuits,\u201c IEEE Trans. Comp., vol. C-34, n. 4; April 1985.","DOI":"10.1109\/TC.1985.5009386"},{"key":"5_CR16","unstructured":"R. Cole and A. Siegel, \u201cOptimal VLSI network that sort a numbers in an arbitrary, fixed range\u201d, manuscript."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:20:36Z","timestamp":1586564436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0015730","relation":{},"subject":[]}}