Author:
Bampis E.,El Haddad M.,Manoussakis Y.,Santha M.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. A. Bar-Noy and J. Naor, Sorting, minimal feedback sets, and Hamiltonian paths in tournaments, SIAM J. Disc. Math Vol.3 No1 (1990), pp. 7–20.
2. R. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974), pp. 201–206.
3. P. Camion, Chemins et circuits Hamiltoniens des graphes complets, C.R. Acad. Sci. Paris (A) 249 (1959), pp. 2151–2152.
4. R. Cole and U. Vishkin, Approximate and exact parallel scheduling, part 1: the basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988), pp. 128–142.
5. A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献