- IEEE Transactions on Signal Processing 43(10):2427-2430 (1995)
- IEEE Trans. Parallel Distrib. Syst. 13(12):1211-1219 (2002)
- IEEE Trans. Parallel Distrib. Syst. 7(6):555-564 (1996)
- IEEE Trans. Parallel Distrib. Syst. 10(5):487-499 (1999)
- IEEE Trans. Parallel Distrib. Syst. 11(8):838-850 (2000)
- IEEE Trans. Parallel Distrib. Syst. 13(4):399-412 (2002)
- IEEE Trans. Parallel Distrib. Syst. 7(8):896 (1996)
- IEEE Trans. Parallel Distrib. Syst. 14(3):222-235 (2003)
- IEEE Trans. Mob. Comput. 10(3):377-391 (2011)
- IEEE Trans. Computers 54(5):558-572 (2005)
- Theor. Comput. Sci. 412(41):5752-5759 (2011)
- Parallel Computing 26(11):1411-1428 (2000)
- Olog log N Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube.J. Parallel Distrib. Comput. 48(2):200-211 (1998)
- J. Parallel Distrib. Comput. 60(8):998-1027 (2000)
- Discrete Applied Mathematics 121(1-3):215-227 (2002)
- Inf. Process. Lett. 50(1):1-8 (1994)
- Inf. Process. Lett. 47(3):145-148 (1993)
- Inf. Process. Lett. 40(1):33-40 (1991)
- ICTCS, volume 2841 of Lecture Notes in Computer Science, page 150-162. Springer, (2003)
- IWDC, volume 2571 of Lecture Notes in Computer Science, page 203-213. Springer, (2002)


author