| 2011 | ICA3PP | Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. | Yamin Li, Shietung Peng, Wanming Chu |
| 2011 | ICA3PP | Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube. | Yamin Li, Shietung Peng, Wanming Chu |
| 2010 | ICA3PP | Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. | Antoine Bossard, Keiichi Kaneko, Shietung Peng |
| 2010 | ICA3PP | Parallel Prefix Computation in the Recursive Dual-Net. | Yamin Li, Shietung Peng, Wanming Chu |
| 2010 | PDCAT | Parallel Sorting on Recursive Dual-Nets. | Yamin Li, Shietung Peng, Wanming Chu |
| 2010 | PDCAT | Set-to-Set Disjoint-Path Routing in Metacube. | Shietung Peng, Keiichi Kaneko |
| 2009 | ICA3PP | An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. | Yamin Li, Shietung Peng, Wanming Chu |
| 2009 | ICA3PP | Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. | Yamin Li, Shietung Peng, Wanming Chu |
| 2009 | PDCAT | Node-to-Set Disjoint-path Routing in Metacube. | Antoine Bossard, Keiichi Kaneko, Shietung Peng |
| 2009 | PDCAT | Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. | Yamin Li, Shietung Peng, Wanming Chu |
| 2008 | AINA | A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. | Yamin Li, Shietung Peng, Wanming Chu |
| 2008 | ICPP | Prefix Computation and Sorting in Dual-Cube. | Yamin Li, Shietung Peng, Wanming Chu |
| 2008 | PDCAT | Set-to-Set Disjoint Paths Routing in Dual-Cubes. | Keiichi Kaneko, Shietung Peng |
| 2008 | PDCAT | An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. | Yamin Li, Shietung Peng, Wanming Chu |
| 2007 | PDCAT | An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. | Yamin Li, Shietung Peng, Wanming Chu |
| 2007 | PDCAT | Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. | Yamin Li, Shietung Peng, Wanming Chu |
| 2007 | PDCAT | Pairwise Disjoint Paths in Pancake Graphs. | Naoki Sawada, Keiichi Kaneko, Shietung Peng |
| 2006 | MASS | An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. | Yamin Li, Shietung Peng, Wanming Chu |
| 2006 | PDCAT | Disjoint Paths Routing in Pancake Graphs. | Keiichi Kaneko, Shietung Peng |
| 2006 | PDCAT | K-MCore for Multicasting on Mobile Ad Hoc Networks. | Yamin Li, Shietung Peng, Wanming Chu |
| 2005 | ICPADS | Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. | Yamin Li, Shietung Peng, Wanming Chu |
| 2005 | ISPA | Online Adaptive Fault-Tolerant Routing in 2D Torus. | Yamin Li, Shietung Peng, Wanming Chu |
| 2005 | PDCAT | An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. | Yamin Li, Shietung Peng, Wanming Chu |
| 2004 | CIS | Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. | Yamin Li, Shietung Peng, Wanming Chu |
| 2004 | PDCAT | An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes. | Yamin Li, Shietung Peng, Wanming Chu |
| 2002 | CW | From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. | Yamin Li, Shietung Peng, Wanming Chu |
| 2001 | ICPADS | Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network. | Yamin Li, Shietung Peng |
| 2000 | EuroPar | Design of Multi-dimensional DCT Array Processors for Video Applications. | Shietung Peng, Stanislav Sedukhin |
| 2000 | ICPP | Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. | Qian-Ping Gu, Shietung Peng |
| 1999 | PDPTA | Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT. | Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata |
| 1998 | ICPADS | Routing in Hypercubes with Large Number of Faulty Nodes. | Qian-Ping Gu, Shietung Peng |
| 1998 | ICPP | Cluster Fault Tolerant Routing in Hypercubes. | Qian-Ping Gu, Shietung Peng |
| 1996 | ICPADS | An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. | Qian-Ping Gu, Shietung Peng |
| 1994 | ICPADS | Algorithms for Node Disjoint Paths in Incomplete Star Networks. | Qian-Ping Gu, Shietung Peng |
| 1994 | ISAAC | k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. | Qian-Ping Gu, Shietung Peng |
| 1992 | ICCI | Algorithms for a K-Tree Core of a Tree. | Shietung Peng, A. B. Stephens, Yelena Yesha |
| 1992 | ICPP | An Optimal Parallel Algorithm for a Core of a Tree. | Win-Tsung Lo, Shietung Peng |
| 1991 | CCC | Parallel algorithms for finding connected, independent and total domination in interval graphs. | Gur Saran Adhar, Shietung Peng |
| 1990 | ICPP | Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. | Gur Saran Adhar, Shietung Peng |
| 1989 | WADS | Parallel Algorithms for Cographs Recognition and Applications. | Gur Saran Adhar, Shietung Peng |
| 1987 | ICPP | Compression Trees and Their Applications. | Eliezer Dekel, Simeon C. Ntafos, Shietung Peng |
| 1986 | ICPP | Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree. | Eliezer Dekel, Shietung Peng, Shietung Iyengar |