Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Laying out graphs using queues
SIAM Journal on Computing
An improved upper bound on the queuenumber of the hypercube
Information Processing Letters
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
SIAM Journal on Discrete Mathematics
Hi-index | 0.89 |