Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)
2. Amirazizi, H.R., Hellman, M.E.: Time Memory Processor trade-offs. IEEE Transactions on Information Theory 34(3), 502–512 (1988)
3. Chang, H.K.-C., Chen, J.J.-R., Shyu, S.-J.: A Parallel Algorithm for the Knapsack Problem Using a Generation and Searching Techniques. Parallel Computing 20(2), 233–243 (1994)
4. Chedid, F.B.: An Optimal Parallelization of the Two-List Algorithm of Cost O(2
n/2). Parallel Computing 34(1), 63–65 (2008)
5. Chedid, F.B.: A Scalable Parallelization of the Two-List Algorithm of Optimal Cost O(2
n/2). In: Proceedings of Algorithms and Complexity in Durham, ACiD 2007, King’s College, London. Texts in Algorithmics, vol. 9, pp. 35–42 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献