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