{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:40:16Z","timestamp":1737322816912,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_30","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"330-341","source":"Crossref","is-referenced-by-count":0,"title":["Improving the Average Delay of Sorting"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schindelhauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Komlos, J., Szemeredi, E.: Sorting in c log n parallel steps. Combinatorica\u00a03, 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Al-Hajery, M., Batcher, K.: On the bit-level complexity of bitonic sorting networks. In: Proc.\u00a022.\u00a0Int. Conf. on Parallel Processing, III.209\u2013III.213 (1993)","DOI":"10.1109\/ICPP.1993.126"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Hatirnaz, I., Leblebici, Y.: Scalable binary sorting architecture based on rank ordering withlinear area-time complexity. In: Proc.\u00a013.\u00a0IEEE ASIC\/SOC Conference, pp. 369\u2013373 (2000)","DOI":"10.1109\/ASIC.2000.880766"},{"key":"30_CR4","unstructured":"Jakoby, A.: Die Komplexit\u00e4t von Pr\u00e4fixfunktionen bez\u00fcglich ihres mittleren Zeitverhaltens. Dissertation, Universit\u00e4t zu L\u00fcbeck (1998)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Jakoby, A., Reischuk, R., Schindelhauer, C.: Circuit complexity: from the worst case to the average case. In: Proc.\u00a026.\u00a0ACM STOC, pp. 58\u201367 (1994)","DOI":"10.1145\/195058.195106"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/3-540-59042-0_111","volume-title":"STACS 95","author":"A. Jakoby","year":"1995","unstructured":"Jakoby, A., Reischuk, R., Schindelhauer, C.: Malign distributions for average case circuit complexity. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 628\u2013639. Springer, Heidelberg (1995)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/3-540-58201-0_101","volume-title":"Automata, Languages, and Programming","author":"A. Jakoby","year":"1994","unstructured":"Jakoby, A., et al.: The average case complexity of the parallel prefix problem. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 593\u2013604. Springer, Heidelberg (1994)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-45294-X_19","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"A. Jakoby","year":"2001","unstructured":"Jakoby, A., Schindelhauer, C.: Efficient Addition on Field Programmable Gate Arrays. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 219\u2013231. Springer, Heidelberg (2001)"},{"key":"30_CR9","unstructured":"Leblebici, Y., Demirci, T., Hatirnaz, I.: Full-Custom CMOS Realization of a High-Performance Binary Sorting Engine with Linear Area-Time Complexity. In: Proc.\u00a0IEEE Int.\u00a0Symp. on Circuits and Systems (2003)"},{"key":"30_CR10","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"T. Leighton","year":"1992","unstructured":"Leighton, T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo (1992)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Leighton, T., Plaxton, C.G.: A (fairly) simple circuit that (usually) sorts. In: Proc.\u00a031.\u00a0IEEE FOCS, pp. 264\u2013274 (1990)","DOI":"10.1109\/FSCS.1990.89545"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/92.748211","volume":"7","author":"R. Lin","year":"1999","unstructured":"Lin, R., Olariu, S.: Efficient VLSI architecture for Columnsort. IEEE Trans. on VLSI\u00a07, 135\u2013139 (1999)","journal-title":"IEEE Trans. on VLSI"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-Time Complexity for VLSI. In: Proc.\u00a011.\u00a0ACM STOC, pp. 81\u201388 (1979)","DOI":"10.1145\/800135.804401"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","volume":"32","author":"C.D. Thompson","year":"1983","unstructured":"Thompson, C.D.: The VLSI Complexity of Sorting. IEEE Trans. Comp.\u00a032, 1171\u20131184 (1983)","journal-title":"IEEE Trans. Comp."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:27:22Z","timestamp":1737322042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_30","relation":{},"subject":[]}}