Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference42 articles.
1. Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in clogn parallel steps. Combinatorica 3, 1–19 (1983)
2. Assaf, S., Upfal, E.: Fault tolerant sorting networks. SIAM J. Discrete Math. 4(4), 472–480 (1991)
3. Batcher, K.E.: Sorting networks and their applications. In: Proc. 1968 Spring Joint Computer Conf., pp. 307–314. AFIPS Press, Reston (1968)
4. Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: CCS’08: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 257–266. ACM, New York (2008)
5. Biedl, T., Chan, T., Demaine, E.D., Fleischer, R., Golin, M., King, J.A., Munro, J.I.: Fun-sort—or the chaos of unordered binary search. Discrete Appl. Math. 144(3), 231–236 (2004)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization;2016 45th International Conference on Parallel Processing (ICPP);2016-08
2. Scalable Robustness;2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W);2016-06