Author:
Jakoby Andreas,Liśkiewicz Maciej,Reischuk Rüdiger,Schindelhauer Christian
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Sorting in clogn parallel steps;Ajtai;Combinatorica,1983
2. M. Al-Hajery, K. Batcher, On the bit-level complexity of bitonic sorting networks, in: Proc. 22. Int. Conf. on Parallel Processing, 1993, III.209–III.213
3. I. Hatirnaz, Y. Leblebici, Scalable binary sorting architecture based on rank ordering withlinear area-time complexity, in: Proc. 13. IEEE ASIC/SOC Conference, 2000, pp. 369–373
4. A. Jakoby, Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens, Dissertation, Universität zu Lübeck, 1998
5. A. Jakoby, R. Reischuk, C. Schindelhauer, Circuit complexity: From the worst case to the average case, in: Proc. 26. ACM STOC, 1994, pp. 58–67