| * | 2009 |
|---|
| 71 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
The Recursive Dual-Net and Its Applications.
APPT 2009: 363-374 |
| 70 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors.
ICA3PP 2009: 372-383 |
| 69 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation.
ICA3PP 2009: 809-820 |
| 68 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications.
Comput. J. 52(2): 268-275 (2009) |
| 2008 |
|---|
| 67 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks.
AINA 2008: 106-113 |
| 66 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network.
HICSS 2008: 472 |
| 65 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Prefix Computation and Sorting in Dual-Cube.
ICPP 2008: 389-396 |
| 64 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks.
ISPAN 2008: 53-58 |
| 63 | EE | Keiichi Kaneko,
Shietung Peng:
Node-to-Set Disjoint Paths Routing in Dual-Cube.
ISPAN 2008: 77-82 |
| 62 | EE | Keiichi Kaneko,
Shietung Peng:
Set-to-Set Disjoint Paths Routing in Dual-Cubes.
PDCAT 2008: 129-136 |
| 61 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube.
PDCAT 2008: 54-61 |
| 2007 |
|---|
| 60 | | Tatsuro Watanabe,
Keiichi Kaneko,
Shietung Peng:
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs.
ISCA PDCS 2007: 200-205 |
| 59 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks.
PDCAT 2007: 285-292 |
| 58 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications.
PDCAT 2007: 355-362 |
| 57 | EE | Naoki Sawada,
Keiichi Kaneko,
Shietung Peng:
Pairwise Disjoint Paths in Pancake Graphs.
PDCAT 2007: 376-382 |
| 2006 |
|---|
| 56 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
K-MCore for Multicasting on Mobile Ad Hoc Networks.
PDCAT 2006: 109-114 |
| 55 | EE | Keiichi Kaneko,
Shietung Peng:
Disjoint Paths Routing in Pancake Graphs.
PDCAT 2006: 254-259 |
| 54 | EE | Biing-Feng Wang,
Shietung Peng,
Hong-Yi Yu,
Shan-Chyun Ku:
Efficient algorithms for a constrained k-tree core problem in a tree network.
J. Algorithms 59(2): 107-124 (2006) |
| 2005 |
|---|
| 53 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus.
ICPADS (1) 2005: 71-77 |
| 52 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Online Adaptive Fault-Tolerant Routing in 2D Torus.
ISPA 2005: 150-161 |
| 51 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks.
PDCAT 2005: 75-79 |
| 50 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Fault-tolerant cycle embedding in dual-cube with node faults.
IJHPCN 3(1): 45-53 (2005) |
| 2004 |
|---|
| 49 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes.
CIS 2004: 51-56 |
| 48 | | Yamin Li,
Shietung Peng,
Wanming Chu:
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes.
ISCA PDCS 2004: 222-228 |
| 47 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes.
PDCAT 2004: 196-201 |
| 46 | | Yamin Li,
Shietung Peng,
Wanming Chu:
Fault-tolerant cycle embedding in hypercube with mixed link and node failures.
Parallel and Distributed Computing and Networks 2004: 561-566 |
| 45 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Collective Communications in Dual-Cube.
The Journal of Supercomputing 28(1): 71-90 (2004) |
| 2003 |
|---|
| 44 | EE | Qian-Ping Gu,
Shietung Peng:
Multihop All-to-All Broadcast on WDM Optical Networks.
IEEE Trans. Parallel Distrib. Syst. 14(5): 477-486 (2003) |
| 2002 |
|---|
| 43 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube.
CW 2002: 85-94 |
| 42 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Communication in Metacube: A New Interconnection Network.
ISPAN 2002: 165- |
| 2001 |
|---|
| 41 | | Yamin Li,
Shietung Peng:
Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network.
ICPADS 2001: 315-322 |
| 40 | EE | Qian-Ping Gu,
Shietung Peng:
Multi-hop All-to-All Broadcast on WDM Optical Networks.
ICPP Workshops 2001: 291-296 |
| 2000 |
|---|
| 39 | EE | Shietung Peng,
Stanislav Sedukhin:
Design of Multi-dimensional DCT Array Processors for Video Applications.
Euro-Par 2000: 1086-1094 |
| 38 | EE | Qian-Ping Gu,
Shietung Peng:
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.
ICPP 2000: 513-520 |
| 37 | EE | Qian-Ping Gu,
Shietung Peng:
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.
IPDPS 2000: 761-768 |
| 36 | | Qian-Ping Gu,
Shietung Peng:
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes.
J. Parallel Distrib. Comput. 60(6): 764-774 (2000) |
| 35 | EE | Qian-Ping Gu,
Shietung Peng:
Cluster fault-tolerant routing in star graphs.
Networks 35(1): 83-90 (2000) |
| 1999 |
|---|
| 34 | | Shietung Peng,
Stanislav Sedukhin,
Hiroshi Nagata:
Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT.
PDPTA 1999: 1544-1550 |
| 33 | EE | Qian-Ping Gu,
Shietung Peng:
Unicast in Hypercubes with Large Number of Faulty Nodes.
IEEE Trans. Parallel Distrib. Syst. 10(10): 964-975 (1999) |
| 32 | EE | Qian-Ping Gu,
Shietung Peng,
Ivan Hal Sudborough:
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.
Theor. Comput. Sci. 210(2): 327-339 (1999) |
| 1998 |
|---|
| 31 | EE | Qian-Ping Gu,
Shietung Peng:
Routing in Hypercubes with Large Number of Faulty Nodes.
ICPADS 1998: 718- |
| 30 | EE | Qian-Ping Gu,
Shietung Peng:
Cluster Fault Tolerant Routing in Hypercubes.
ICPP 1998: 148-155 |
| 29 | EE | Qian-Ping Gu,
Shietung Peng:
An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs.
Inf. Process. Lett. 67(6): 283-287 (1998) |
| 28 | | Qian-Ping Gu,
Shietung Peng:
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes.
Parallel Computing 24(8): 1245-1261 (1998) |
| 1997 |
|---|
| 27 | EE | Qian-Ping Gu,
Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes.
ISPAN 1997: 404-409 |
| 26 | | Qian-Ping Gu,
Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.
IEEE Trans. Computers 46(9): 1042-1049 (1997) |
| 25 | EE | Qian-Ping Gu,
Shietung Peng:
Node-To-Set Disjoint Paths Problem in Star Graphs.
Inf. Process. Lett. 62(4): 201-207 (1997) |
| 1996 |
|---|
| 24 | EE | Shietung Peng,
Stanislav Sedukhin,
Igor S. Sedukhin:
Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination.
ASAP 1996: 183-192 |
| 23 | EE | Qian-Ping Gu,
Shietung Peng:
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.
ICPADS 1996: 98-105 |
| 22 | | Qian-Ping Gu,
Shietung Peng:
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters.
Comput. J. 39(1): 14-19 (1996) |
| 21 | | Qian-Ping Gu,
Shietung Peng:
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes.
Comput. J. 39(7): 626-629 (1996) |
| 20 | | Shietung Peng,
Stanislav Sedukhin:
Array Processors Design for Division-free Linear System Solving.
Comput. J. 39(8): 713-722 (1996) |
| 19 | | Shietung Peng,
Win-Tsung Lo:
Efficient Algorithms for Finding a Core of a Tree with a Specified Length.
J. Algorithms 20(3): 445-458 (1996) |
| 18 | EE | Qian-Ping Gu,
Shietung Peng:
Fault Tolerant Routing in Hypercubes and Star Graphs.
Parallel Processing Letters 6(1): 127-136 (1996) |
| 1995 |
|---|
| 17 | | Qian-Ping Gu,
Shietung Peng:
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters.
Parallel and Distributed Computing and Systems 1995: 229-233 |
| 16 | EE | Qian-Ping Gu,
Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs.
Inf. Process. Lett. 56(1): 29-35 (1995) |
| 1994 |
|---|
| 15 | | Gur Saran Adhar,
Shietung Peng:
Parallel Algorithms for K-tree Recognition and its Applications.
HICSS (2) 1994: 194-202 |
| 14 | | Qian-Ping Gu,
Shietung Peng:
Algorithms for Node Disjoint Paths in Incomplete Star Networks.
ICPADS 1994: 296-303 |
| 13 | EE | Qian-Ping Gu,
Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.
ISAAC 1994: 342-350 |
| 12 | | Shietung Peng,
Win-Tsung Lo:
A Simple Optimal Parallel Algorithm for a Core of a Tree.
J. Parallel Distrib. Comput. 20(3): 388-392 (1994) |
| 11 | EE | Shietung Peng,
Win-Tsung Lo:
The Optimal Location of a Structured Facility in a Tree Network.
Parallel Algorithms Appl. 2(1-2): 43-60 (1994) |
| 1993 |
|---|
| 10 | | Shietung Peng,
A. B. Stephens,
Yelena Yesha:
Algorithms for a Core and k-Tree Core of a Tree.
J. Algorithms 15(1): 143-159 (1993) |
| 1992 |
|---|
| 9 | | Shietung Peng,
A. B. Stephens,
Yelena Yesha:
Algorithms for a K-Tree Core of a Tree.
ICCI 1992: 38-41 |
| 8 | | Win-Tsung Lo,
Shietung Peng:
An Optimal Parallel Algorithm for a Core of a Tree.
ICPP (3) 1992: 326-329 |
| 1991 |
|---|
| 7 | | Gur Saran Adhar,
Shietung Peng:
Parallel algorithms for finding connected, independent and total domination in interval graphs.
Algorithms and Parallel VLSI Architectures 1991: 85-90 |
| 1990 |
|---|
| 6 | | Gur Saran Adhar,
Shietung Peng:
Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs.
ICPP (3) 1990: 364-365 |
| 5 | | Gur Saran Adhar,
Shietung Peng:
Parallel Algorithms for Cographs and Parity Graphs with Applications.
J. Algorithms 11(2): 252-284 (1990) |
| 1989 |
|---|
| 4 | | Gur Saran Adhar,
Shietung Peng:
Parallel Algorithms for Cographs Recognition and Applications.
WADS 1989: 335-351 |
| 1987 |
|---|
| 3 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Compression Trees and Their Applications.
ICPP 1987: 132-139 |
| 1986 |
|---|
| 2 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Parallel Tree Techniques and Code Optimization.
Aegean Workshop on Computing 1986: 205-216 |
| 1 | | Eliezer Dekel,
Shietung Peng,
Shietung Iyengar:
Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree.
ICPP 1986: 1010-1012 |
