Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, New York, 1974.
2. M. Ajtai, J. Komlós, W. L. Steiger, and E. Szemerédi. Optimal parallel selection has complexity O(log log n). Journal of Computer and System Sciences, 38:125–133, 1989.
3. M. Atkinson, J. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM, 29(10):996–1000, October 1986.
4. Y. Azar and N. Pippenger. Parallel selection. Discrete Appl. Math., 27:49–58, 1990.
5. Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data-structure. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 196–202, October 1989.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献