{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:16Z","timestamp":1742591416142,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180999"},{"type":"electronic","value":"9783540477600"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18099-0_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:28:21Z","timestamp":1330198101000},"page":"163-168","source":"Crossref","is-referenced-by-count":1,"title":["Area-time tradeoffs for selection"],"prefix":"10.1007","author":[{"given":"Imrich","family":"Vr\u0165o","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840437","volume":"1","author":"G. Bilardi","year":"1986","unstructured":"Bilardi, G., Preparata, F.P.: Area-time Lower bound technique with application to sorting. Algorithmica,1, 1986,1, 65\u201391.","journal-title":"Algorithmica"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bilardi,G.,Preparata,F.P.: The influence of key length on the area-time complexity of sorting. In: Proc. 12-th ICALP, 1985.","DOI":"10.1007\/BFb0015730"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cole,R.,Siegel,A.R.: On information flow and sorting. In: Proc. 26-th FOCS, Portland 1985, 208\u2013221.","DOI":"10.1109\/SFCS.1985.39"},{"issue":"6","key":"19_CR4","first-page":"535","volume":"4","author":"P. \u010euri\u0161","year":"1985","unstructured":"\u010euri\u0161, P.,S\u00fdkora, O.,Thompson, C.D.,Vr\u0165o, I.: Tight chip area bounds for sorting. Computers and Artificial Intelligence, 4, 1985, 6, 535\u2013544.","journal-title":"Computers and Artificial Intelligence"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"\u010euri\u0161,P.,S\u00fdkora,O., Thompson,C.D.,Vr\u0165o,I.: A minimum area for l-selection. To appear in Algorithmica 1987.","DOI":"10.1007\/BF01840362"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Leighton,F.T.: Tight bounds on the complexity of parallel sorting. In: Proc. 16-th STOC, Washington 1984, 71\u201380.","DOI":"10.1145\/800057.808667"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Lipton,R.J.,Sedgewick,R.: Lower bounds for VLSI. In: Proc. 13-th STOC, Milwaukee 1981, 300\u2013306.","DOI":"10.1145\/800076.802482"},{"key":"19_CR8","series-title":"Tech. Rep.","volume-title":"Tight area bounds and provably good AT2 bounds for sorting circuits","author":"A.R. Siegel","year":"1984","unstructured":"Siegel, A.R.: Tight area bounds and provably good AT2 bounds for sorting circuits. Tech. Rep., Comp.Sci.Dept., New York University, New York 1984."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Siegel,A.R.: Aspects of information flow in VLSI circuits. In:Proc. 18-th STOC, 1986, 448\u2013459.","DOI":"10.1145\/12130.12177"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Thompson,C.D.: Area-time complexity for VLSI. In: Proc. 11-th STOC, 1979, 81\u201388.","DOI":"10.1145\/800135.804401"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Thompson,C.D.,Yasuura,H.: On the area-time optimal design of l-selectors. In: Proc. Asilomar Conf. on Circuits, Systems and Computers, 1985.","DOI":"10.1109\/ACSSC.1985.671482"},{"key":"19_CR12","unstructured":"Ullman,J.D.: Computational Aspects of VLSI. Rockville, Computer Science Press 1984."},{"key":"19_CR13","first-page":"232","volume-title":"Proc. PARCELLA \"84","author":"I. Vr\u0165o","year":"1985","unstructured":"Vr\u0165o, I.: Optimal VLSI algorithm for finding the maximum element of a set. In: Proc. PARCELLA \"84, Berlin, Academie Verlag 1985,232\u2013238."},{"key":"19_CR14","unstructured":"Vr\u0165o,I.: The area-time complexity of the VLSI counter. Submitted to IPL."}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18099-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:36:52Z","timestamp":1742589412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18099-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180999","9783540477600"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-18099-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}