Author:
Savage John E.,Wloka Markus G.
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. M. Ajtai, J. Komlos and E. Szemeredi, “An O(n log n) Sorting Network,” in 15th Annual ACM Symposium on Theory of Computing, pp. 1–9, 1983.
2. K. E. Batcher and H. S. Stone, “Sorting Networks and Their Applications,” AFIPS Proc., Spring Joint Comput. Conf., vol. 32, pp. 307–314, 1968.
3. M. Ben-Or, “Lower Bounds for Algebraic Computation Trees,” in 15th Annual ACM Symposium on Theory of Computing, pp. 80–86, May 1983.
4. R. Cole, “Parallel Merge Sort,” in 27th Annual Symposium on Foundations of Computer Science, pp. 511–616, 1986.
5. B. A. Dalio, “DeCo — A Hierarchical Device Compilation Systems” Dept. of Computer Science, Brown University, PhD Thesis CS-87-08, May 1987.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献