Shietung Peng

98 papers A 1B 13C 20Misc 4Journal 32Unranked 28
YearRankTypeTitle / Venue / Authors
2015 J jnl
Node-to-set disjoint paths routing in a metacube.
Int. J. High Perform. Comput. Netw.
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2012 J jnl
Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm.
Int. J. Netw. Comput.
Yamin Li, Shietung Peng, Wanming Chu
2011 J jnl
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.
Comput. J.
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011 J jnl
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net.
Int. J. Found. Comput. Sci.
Yamin Li, Shietung Peng, Wanming Chu
2011 — conf
Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube.
ICA3PP (1)
Yamin Li, Shietung Peng, Wanming Chu
2011 Misc conf
Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm.
ICNC
Yamin Li, Shietung Peng, Wanming Chu
2011 J jnl
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net.
Int. J. Netw. Comput.
Yamin Li, Shietung Peng, Wanming Chu
2011 Misc conf
Node-to-set disjoint-path routing in perfect hierarchical hypercubes.
ICCS
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011 J jnl
Parallel Prefix Computation and Sorting on a Recursive Dual-Net.
J. Inf. Process. Syst.
Yamin Li, Shietung Peng, Wanming Chu
2011 — conf
Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net.
ICA3PP (1)
Yamin Li, Shietung Peng, Wanming Chu
2010 C conf
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation.
CIT
Yamin Li, Shietung Peng, Wanming Chu
2010 — conf
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes.
ICA3PP (1)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2010 J jnl
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers.
J. Supercomput.
Yamin Li, Shietung Peng, Wanming Chu
2010 Misc conf
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net.
ICNC
Yamin Li, Shietung Peng, Wanming Chu
2010 — conf
Parallel Prefix Computation in the Recursive Dual-Net.
ICA3PP (1)
Yamin Li, Shietung Peng, Wanming Chu
2010 C conf
Parallel Sorting on Recursive Dual-Nets.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2010 C conf
Set-to-Set Disjoint-Path Routing in Metacube.
PDCAT
Shietung Peng, Keiichi Kaneko
2009 — conf
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube.
ISPAN
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009 C conf
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors.
ICA3PP
Yamin Li, Shietung Peng, Wanming Chu
2009 C conf
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2009 — conf
Hamiltonian Connectedness of Recursive Dual-Net.
CIT (1)
Yamin Li, Shietung Peng, Wanming Chu
2009 C conf
Node-to-Set Disjoint-path Routing in Metacube.
PDCAT
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009 J jnl
Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications.
Comput. J.
Yamin Li, Shietung Peng, Wanming Chu
2009 C conf
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation.
ICA3PP
Yamin Li, Shietung Peng, Wanming Chu
2009 — conf
The Recursive Dual-Net and Its Applications.
APPT
Yamin Li, Shietung Peng, Wanming Chu
2008 B conf
A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks.
AINA
Yamin Li, Shietung Peng, Wanming Chu
2008 C conf
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2008 — conf
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks.
ISPAN
Yamin Li, Shietung Peng, Wanming Chu
2008 — conf
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network.
HICSS
Yamin Li, Shietung Peng, Wanming Chu
2008 — conf
Node-to-Set Disjoint Paths Routing in Dual-Cube.
ISPAN
Keiichi Kaneko, Shietung Peng
2008 B conf
Prefix Computation and Sorting in Dual-Cube.
ICPP
Yamin Li, Shietung Peng, Wanming Chu
2008 C conf
Set-to-Set Disjoint Paths Routing in Dual-Cubes.
PDCAT
Keiichi Kaneko, Shietung Peng
2007 — conf
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs.
PDCS
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
2007 C conf
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2007 C conf
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2007 C conf
Pairwise Disjoint Paths in Pancake Graphs.
PDCAT
Naoki Sawada, Keiichi Kaneko, Shietung Peng
2006 B conf
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks.
MASS
Yamin Li, Shietung Peng, Wanming Chu
2006 C conf
Disjoint Paths Routing in Pancake Graphs.
PDCAT
Keiichi Kaneko, Shietung Peng
2006 J jnl
Efficient algorithms for a constrained
J. Algorithms
Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
2006 C conf
K-MCore for Multicasting on Mobile Ad Hoc Networks.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2005 — conf
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus.
ICPADS (1)
Yamin Li, Shietung Peng, Wanming Chu
2005 C conf
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2005 J jnl
Fault-tolerant cycle embedding in dual-cube with node faults.
Int. J. High Perform. Comput. Netw.
Yamin Li, Shietung Peng, Wanming Chu
2005 C conf
Online Adaptive Fault-Tolerant Routing in 2D Torus.
ISPA
Yamin Li, Shietung Peng, Wanming Chu
2004 — conf
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes.
PDCS
Yamin Li, Shietung Peng, Wanming Chu
2004 C conf
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes.
PDCAT
Yamin Li, Shietung Peng, Wanming Chu
2004 C conf
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes.
CIS
Yamin Li, Shietung Peng, Wanming Chu
2004 J jnl
Efficient Collective Communications in Dual-Cube.
J. Supercomput.
Yamin Li, Shietung Peng, Wanming Chu
2004 — conf
Fault-tolerant cycle embedding in hypercube with mixed link and node failures.
Parallel and Distributed Computing and Networks
Yamin Li, Shietung Peng, Wanming Chu
2003 J jnl
Multihop All-to-All Broadcast on WDM Optical Networks.
IEEE Trans. Parallel Distributed Syst.
Qian-Ping Gu, Shietung Peng
2002 — conf
Efficient Communication in Metacube: A New Interconnection Network.
ISPAN
Yamin Li, Shietung Peng, Wanming Chu
2002 C conf
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube.
CW
Yamin Li, Shietung Peng, Wanming Chu
2001 B conf
Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network.
ICPADS
Yamin Li, Shietung Peng
2001 — conf
Multi-hop All-to-All Broadcast on WDM Optical Networks.
ICPP Workshops
Qian-Ping Gu, Shietung Peng
2000 J jnl
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes.
J. Parallel Distributed Comput.
Qian-Ping Gu, Shietung Peng
2000 J jnl
Cluster fault-tolerant routing in star graphs.
Networks
Qian-Ping Gu, Shietung Peng
2000 — conf
Design of Multi-dimensional DCT Array Processors for Video Applications.
Euro-Par
Shietung Peng, Stanislav Sedukhin
2000 B conf
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.
ICPP
Qian-Ping Gu, Shietung Peng
2000 A conf
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.
IPDPS
Qian-Ping Gu, Shietung Peng
1999 J jnl
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.
Theor. Comput. Sci.
Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
1999 — conf
A new scalable array processor for two-dimensional discrete Fourier transform.
PARCO
Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata
1999 Misc conf
Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT.
PDPTA
Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata
1999 J jnl
Unicast in Hypercubes with Large Number of Faulty Nodes.
IEEE Trans. Parallel Distributed Syst.
Qian-Ping Gu, Shietung Peng
1998 J jnl
An Efficient Algorithm for
Inf. Process. Lett.
Qian-Ping Gu, Shietung Peng
1998 B conf
Cluster Fault Tolerant Routing in Hypercubes.
ICPP
Qian-Ping Gu, Shietung Peng
1998 J jnl
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes.
Parallel Comput.
Qian-Ping Gu, Shietung Peng
1998 B conf
Routing in Hypercubes with Large Number of Faulty Nodes.
ICPADS
Qian-Ping Gu, Shietung Peng
1997 J jnl
Node-To-Set Disjoint Paths Problem in Star Graphs.
Inf. Process. Lett.
Qian-Ping Gu, Shietung Peng
1997 — conf
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes.
ISPAN
Qian-Ping Gu, Shietung Peng
1997 J jnl
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.
IEEE Trans. Computers
Qian-Ping Gu, Shietung Peng
1996 J jnl
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters.
Comput. J.
Qian-Ping Gu, Shietung Peng
1996 B conf
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.
ICPADS
Qian-Ping Gu, Shietung Peng
1996 J jnl
Array Processors Design for Division-free Linear System Solving.
Comput. J.
Shietung Peng, Stanislav Sedukhin
1996 J jnl
Efficient Algorithms for Finding a Core of a Tree with a Specified Length.
J. Algorithms
Shietung Peng, Win-Tsung Lo
1996 J jnl
Fault Tolerant Routing in Hypercubes and Star Graphs.
Parallel Process. Lett.
Qian-Ping Gu, Shietung Peng
1996 J jnl
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes.
Comput. J.
Qian-Ping Gu, Shietung Peng
1996 — conf
Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination.
ASAP
Shietung Peng, Stanislav Sedukhin, Igor S. Sedukhin
1995 — conf
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes.
SPDP
Qian-Ping Gu, Shietung Peng
1995 — conf
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters.
Parallel and Distributed Computing and Systems
Qian-Ping Gu, Shietung Peng
1995 J jnl
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs.
IEICE Trans. Inf. Syst.
Qian-Ping Gu, Shietung Peng
1995 J jnl
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs.
Inf. Process. Lett.
Qian-Ping Gu, Shietung Peng
1994 J jnl
A Simple Optimal Parallel Algorithm for a Core of a Tree.
J. Parallel Distributed Comput.
Shietung Peng, Win-Tsung Lo
1994 — conf
Advanced fault tolerant routing in hypercubes.
ISPAN
Qian-Ping Gu, Shietung Peng
1994 B conf
Algorithms for Node Disjoint Paths in Incomplete Star Networks.
ICPADS
Qian-Ping Gu, Shietung Peng
1994 — conf
Parallel Algorithms for K-tree Recognition and its Applications.
HICSS (2)
Gur Saran Adhar, Shietung Peng
1994 J jnl
The Optimal Location of a Structured Facility in a Tree Network.
Parallel Algorithms Appl.
Shietung Peng, Win-Tsung Lo
1994 B conf
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.
ISAAC
Qian-Ping Gu, Shietung Peng
1993 J jnl
Algorithms for a Core and k-Tree Core of a Tree.
J. Algorithms
Shietung Peng, A. B. Stephens, Yelena Yesha
1992 C conf
Algorithms for a K-Tree Core of a Tree.
ICCI
Shietung Peng, A. B. Stephens, Yelena Yesha
1992 — conf
An Optimal Parallel Algorithm for a Core of a Tree.
ICPP (3)
Win-Tsung Lo, Shietung Peng
1991 — conf
Parallel algorithms for finding connected, independent and total domination in interval graphs.
Algorithms and Parallel VLSI Architectures
Gur Saran Adhar, Shietung Peng
1990 J jnl
Parallel Algorithms for Cographs and Parity Graphs with Applications.
J. Algorithms
Gur Saran Adhar, Shietung Peng
1990 — conf
Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs.
ICPP (3)
Gur Saran Adhar, Shietung Peng
1989 B conf
Parallel Algorithms for Cographs Recognition and Applications.
WADS
Gur Saran Adhar, Shietung Peng
1987 B conf
Compression Trees and Their Applications.
ICPP
Eliezer Dekel, Simeon C. Ntafos, Shietung Peng
1986 B conf
Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree.
ICPP
Eliezer Dekel, Shietung Peng, Shietung Iyengar
1986 J jnl
Optimal parallel algorithms for constructing and maintaining a balanced
Int. J. Parallel Program.
Eliezer Dekel, Shietung Peng, S. Sitharma Lyengar
1986 — conf
Parallel Tree Techniques and Code Optimization.
Aegean Workshop on Computing
Eliezer Dekel, Simeon C. Ntafos, Shietung Peng