Research NoteO(log logN) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube☆
References (15)
- et al.
Parallel priority queues
Inform. Process. Lett.
(1991) - et al.
Parallel algorithms for priority queue operations
Theoret. Comput. Sci.
(1995) - et al.
Taking random walks to grow trees in hypercubes
J. Assoc. Comput. Mach.
(1993) - et al.
Efficient embeddings of trees in hypercubes
SIAM J. Comput.
(1992) - et al.
Fast and efficient operations on parallel priority queues
Proc. Fifth Ann. Int. Symp. Algorithms and Computation
(1994) - et al.
ON
Proc. Int. Parallel Processing Symposium
(1997) - et al.
Optimal and load balanced mapping of parallel priority queues in hypercubes
IEEE Trans. Parallel Distrib. Systems
(1996)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This work is partially supported by a Texas Advanced Technology Program grant under Award TATP-003594031. The authors can be reached via e-mail at [email protected] and [email protected].
Copyright © 1998 Academic Press. All rights reserved.