A parallel two-list algorithm for the knapsack problem
Parallel Computing
Comments on parallel algorithms for the knapsack problem
Parallel Computing
Journal of Parallel and Distributed Computing
Optimal parallel algorithm for the knapsack problem without memory conflicts
Journal of Computer Science and Technology
An optimal parallelization of the two-list algorithm of cost O(2n/2)
Parallel Computing
A parallel O(n27n/8) time-memory-processor tradeoff for Knapsack-like problems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
A note on developing optimal and scalable parallel two-list algorithms
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hi-index | 0.00 |