Parallel Tree Techniques and Code Optimization. - Eliezer Dekel; Simeon C. Ntafos; Shietung Peng (Aegean Workshop on Computing, 1986)

Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree. - Eliezer Dekel; Shietung Peng; Shietung Iyengar (ICPP, 1986)

Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree. - Eliezer Dekel; Shietung Peng; S. Sitharma Lyengar (Int. J. Parallel Program., 1986)

Compression Trees and Their Applications. - Eliezer Dekel; Simeon C. Ntafos; Shietung Peng (ICPP, 1987)

Parallel Algorithms for Cographs Recognition and Applications. - Gur Saran Adhar; Shietung Peng (WADS, 1989)

Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. - Gur Saran Adhar; Shietung Peng (ICPP (3), 1990)

Parallel Algorithms for Cographs and Parity Graphs with Applications. - Gur Saran Adhar; Shietung Peng (J. Algorithms, 1990)

Parallel algorithms for finding connected, independent and total domination in interval graphs. - Gur Saran Adhar; Shietung Peng (Algorithms and Parallel VLSI Architectures, 1991)

Algorithms for a K-Tree Core of a Tree. - Shietung Peng; A. B. Stephens; Yelena Yesha (ICCI, 1992)

An Optimal Parallel Algorithm for a Core of a Tree. - Win-Tsung Lo; Shietung Peng (ICPP (3), 1992)

Algorithms for a Core and k-Tree Core of a Tree. - Shietung Peng; A. B. Stephens; Yelena Yesha (J. Algorithms, 1993)

Parallel Algorithms for K-tree Recognition and its Applications. - Gur Saran Adhar; Shietung Peng (HICSS (2), 1994)

Algorithms for Node Disjoint Paths in Incomplete Star Networks. - Qian-Ping Gu; Shietung Peng (ICPADS, 1994)

Advanced fault tolerant routing in hypercubes. - Qian-Ping Gu; Shietung Peng (ISPAN, 1994)

A Simple Optimal Parallel Algorithm for a Core of a Tree. - Shietung Peng; Win-Tsung Lo (J. Parallel Distributed Comput., 1994)

The Optimal Location of a Structured Facility in a Tree Network. - Shietung Peng; Win-Tsung Lo (Parallel Algorithms Appl., 1994)

Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. - Qian-Ping Gu; Shietung Peng (Parallel and Distributed Computing and Systems, 1995)

An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. - Qian-Ping Gu; Shietung Peng (SPDP, 1995)

Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. - Qian-Ping Gu; Shietung Peng (IEICE Trans. Inf. Syst., 1995)

Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1995)

Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination. - Shietung Peng; Stanislav Sedukhin; Igor S. Sedukhin (ASAP, 1996)

An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. - Qian-Ping Gu; Shietung Peng (ICPADS, 1996)

Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (Comput. J., 1996)

An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. - Qian-Ping Gu; Shietung Peng (Comput. J., 1996)

Array Processors Design for Division-free Linear System Solving. - Shietung Peng; Stanislav Sedukhin (Comput. J., 1996)

Efficient Algorithms for Finding a Core of a Tree with a Specified Length. - Shietung Peng; Win-Tsung Lo (J. Algorithms, 1996)

Fault Tolerant Routing in Hypercubes and Star Graphs. - Qian-Ping Gu; Shietung Peng (Parallel Process. Lett., 1996)

Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (ISPAN, 1997)

Node-To-Set Disjoint Paths Problem in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1997)

k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Computers, 1997)

Routing in Hypercubes with Large Number of Faulty Nodes. - Qian-Ping Gu; Shietung Peng (ICPADS, 1998)

Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (ICPP, 1998)

An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1998)

Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (Parallel Comput., 1998)

A new scalable array processor for two-dimensional discrete Fourier transform. - Shietung Peng; Stanislav Sedukhin; Hiroshi Nagata (PARCO, 1999)

Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT. - Shietung Peng; Stanislav Sedukhin; Hiroshi Nagata (PDPTA, 1999)

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. - Qian-Ping Gu; Shietung Peng; Ivan Hal Sudborough (Theor. Comput. Sci., 1999)

Unicast in Hypercubes with Large Number of Faulty Nodes. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Parallel Distributed Syst., 1999)

Design of Multi-dimensional DCT Array Processors for Video Applications. - Shietung Peng; Stanislav Sedukhin (Euro-Par, 2000)

Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. - Qian-Ping Gu; Shietung Peng (ICPP, 2000)

Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. - Qian-Ping Gu; Shietung Peng (IPDPS, 2000)

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. - Qian-Ping Gu; Shietung Peng (J. Parallel Distributed Comput., 2000)

Cluster fault-tolerant routing in star graphs. - Qian-Ping Gu; Shietung Peng (Networks, 2000)

Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network. - Yamin Li; Shietung Peng (ICPADS, 2001)

Multi-hop All-to-All Broadcast on WDM Optical Networks. - Qian-Ping Gu; Shietung Peng (ICPP Workshops, 2001)

From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. - Yamin Li; Shietung Peng; Wanming Chu (CW, 2002)

Efficient Communication in Metacube: A New Interconnection Network. - Yamin Li; Shietung Peng; Wanming Chu (ISPAN, 2002)

Multihop All-to-All Broadcast on WDM Optical Networks. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Parallel Distributed Syst., 2003)

Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes. - Yamin Li; Shietung Peng; Wanming Chu (PDCS, 2004)

Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. - Yamin Li; Shietung Peng; Wanming Chu (CIS, 2004)

An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2004)

Fault-tolerant cycle embedding in hypercube with mixed link and node failures. - Yamin Li; Shietung Peng; Wanming Chu (Parallel and Distributed Computing and Networks, 2004)

Efficient Collective Communications in Dual-Cube. - Yamin Li; Shietung Peng; Wanming Chu (J. Supercomput., 2004)

Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. - Yamin Li; Shietung Peng; Wanming Chu (ICPADS (1), 2005)

Online Adaptive Fault-Tolerant Routing in 2D Torus. - Yamin Li; Shietung Peng; Wanming Chu (ISPA, 2005)

An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2005)

Fault-tolerant cycle embedding in dual-cube with node faults. - Yamin Li; Shietung Peng; Wanming Chu (Int. J. High Perform. Comput. Netw., 2005)

An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. - Yamin Li; Shietung Peng; Wanming Chu (MASS, 2006)

Disjoint Paths Routing in Pancake Graphs. - Keiichi Kaneko; Shietung Peng (PDCAT, 2006)

K-MCore for Multicasting on Mobile Ad Hoc Networks. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2006)

Efficient algorithms for a constrained k-tree core problem in a tree network. - Biing-Feng Wang; Shietung Peng; Hong-Yi Yu; Shan-Chyun Ku (J. Algorithms, 2006)

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. - Tatsuro Watanabe; Keiichi Kaneko; Shietung Peng (PDCS, 2007)

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2007)

Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2007)

Pairwise Disjoint Paths in Pancake Graphs. - Naoki Sawada; Keiichi Kaneko; Shietung Peng (PDCAT, 2007)

A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. - Yamin Li; Shietung Peng; Wanming Chu (AINA, 2008)

K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. - Yamin Li; Shietung Peng; Wanming Chu (HICSS, 2008)

Prefix Computation and Sorting in Dual-Cube. - Yamin Li; Shietung Peng; Wanming Chu (ICPP, 2008)

Node-to-Set Disjoint Paths Routing in Dual-Cube. - Keiichi Kaneko; Shietung Peng (ISPAN, 2008)

K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. - Yamin Li; Shietung Peng; Wanming Chu (ISPAN, 2008)

Set-to-Set Disjoint Paths Routing in Dual-Cubes. - Keiichi Kaneko; Shietung Peng (PDCAT, 2008)

An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2008)

Hamiltonian Connectedness of Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (CIT (1), 2009)

The Recursive Dual-Net and Its Applications. - Yamin Li; Shietung Peng; Wanming Chu (APPT, 2009)

An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. - Yamin Li; Shietung Peng; Wanming Chu (ICA3PP, 2009)

Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. - Yamin Li; Shietung Peng; Wanming Chu (ICA3PP, 2009)

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ISPAN, 2009)

Node-to-Set Disjoint-path Routing in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (PDCAT, 2009)

Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications. - Yamin Li; Shietung Peng; Wanming Chu (Comput. J., 2009)

Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. - Yamin Li; Shietung Peng; Wanming Chu (CIT, 2010)

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICA3PP (1), 2010)

Parallel Prefix Computation in the Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (ICA3PP (1), 2010)

Parallel Sorting on Recursive Dual-Nets. - Yamin Li; Shietung Peng; Wanming Chu (PDCAT, 2010)

Set-to-Set Disjoint-Path Routing in Metacube. - Shietung Peng; Keiichi Kaneko (PDCAT, 2010)

Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. - Yamin Li; Shietung Peng; Wanming Chu (J. Supercomput., 2010)

Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (ICA3PP (1), 2011)

Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube. - Yamin Li; Shietung Peng; Wanming Chu (ICA3PP (1), 2011)

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Comput. J., 2011)

Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (Int. J. Found. Comput. Sci., 2011)

Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (Int. J. Netw. Comput., 2011)

Parallel Prefix Computation and Sorting on a Recursive Dual-Net. - Yamin Li; Shietung Peng; Wanming Chu (J. Inf. Process. Syst., 2011)

Node-to-set disjoint-path routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICCS, 2011)

Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm. - Yamin Li; Shietung Peng; Wanming Chu (Int. J. Netw. Comput., 2012)

Node-to-set disjoint paths routing in a metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Int. J. High Perform. Comput. Netw., 2015)