Permutation-Based Range-Join Algorithms on N-Dimensional Meshes
IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm for constructing Hamiltonian paths in meshes
Parallel Computing
Efficient Permutation-Based Range-Join Algorithms on N-Dimensional Meshes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An efficient parallel algorithm for the longest path problem in meshes
The Journal of Supercomputing
Hi-index | 0.00 |