default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShietung Peng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2015
[j32]Antoine Bossard, Keiichi Kaneko
, Shietung Peng:
Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. 8(4): 315-323 (2015)- 2012
- [j31]Yamin Li, Shietung Peng, Wanming Chu:
Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm. Int. J. Netw. Comput. 2(2): 234-250 (2012) - 2011
- [j30]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. 54(8): 1372-1381 (2011) - [j29]Yamin Li, Shietung Peng, Wanming Chu:
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. Int. J. Found. Comput. Sci. 22(5): 1001-1018 (2011) - [j28]Yamin Li, Shietung Peng, Wanming Chu:
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. Int. J. Netw. Comput. 1(2): 178-190 (2011) - [j27]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Prefix Computation and Sorting on a Recursive Dual-Net. J. Inf. Process. Syst. 7(2): 271-286 (2011) - [c66]Yamin Li, Shietung Peng, Wanming Chu:
Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm. ICNC 2011: 58-67 - [c65]Yamin Li, Shietung Peng, Wanming Chu:
Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICA3PP (1) 2011: 54-65 - [c64]Yamin Li, Shietung Peng, Wanming Chu:
Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube. ICA3PP (1) 2011: 117-128 - [c63]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS 2011: 442-451 - 2010
- [j26]Yamin Li, Shietung Peng, Wanming Chu:
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supercomput. 53(2): 329-351 (2010) - [c62]Yamin Li, Shietung Peng, Wanming Chu:
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. CIT 2010: 147-154 - [c61]Yamin Li, Shietung Peng, Wanming Chu:
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICNC 2010: 9-14 - [c60]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Prefix Computation in the Recursive Dual-Net. ICA3PP (1) 2010: 54-64 - [c59]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) 2010: 511-519 - [c58]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Sorting on Recursive Dual-Nets. PDCAT 2010: 110-117 - [c57]Shietung Peng, Keiichi Kaneko:
Set-to-Set Disjoint-Path Routing in Metacube. PDCAT 2010: 128-137
2000 – 2009
- 2009
- [j25]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) - [c56]Yamin Li, Shietung Peng, Wanming Chu:
Hamiltonian Connectedness of Recursive Dual-Net. CIT (1) 2009: 203-208 - [c55]Yamin Li, Shietung Peng, Wanming Chu:
The Recursive Dual-Net and Its Applications. APPT 2009: 363-374 - [c54]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. ICA3PP 2009: 372-383 - [c53]Yamin Li, Shietung Peng, Wanming Chu:
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. ICA3PP 2009: 809-820 - [c52]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN 2009: 23-28 - [c51]Yamin Li, Shietung Peng, Wanming Chu:
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. PDCAT 2009: 48-56 - [c50]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-Set Disjoint-path Routing in Metacube. PDCAT 2009: 57-62 - 2008
- [c49]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 - [c48]Yamin Li, Shietung Peng, Wanming Chu:
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. HICSS 2008: 472 - [c47]Yamin Li, Shietung Peng, Wanming Chu:
Prefix Computation and Sorting in Dual-Cube. ICPP 2008: 389-396 - [c46]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 - [c45]Keiichi Kaneko, Shietung Peng:
Node-to-Set Disjoint Paths Routing in Dual-Cube. ISPAN 2008: 77-82 - [c44]Yamin Li, Shietung Peng, Wanming Chu:
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. PDCAT 2008: 54-61 - [c43]Keiichi Kaneko, Shietung Peng:
Set-to-Set Disjoint Paths Routing in Dual-Cubes. PDCAT 2008: 129-136 - 2007
- [c42]Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng:
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. PDCS 2007: 200-205 - [c41]Yamin Li, Shietung Peng, Wanming Chu:
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. PDCAT 2007: 285-292 - [c40]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. PDCAT 2007: 355-362 - [c39]Naoki Sawada, Keiichi Kaneko, Shietung Peng:
Pairwise Disjoint Paths in Pancake Graphs. PDCAT 2007: 376-382 - 2006
- [j24]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) - [c38]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. MASS 2006: 199-205 - [c37]Yamin Li, Shietung Peng, Wanming Chu:
K-MCore for Multicasting on Mobile Ad Hoc Networks. PDCAT 2006: 109-114 - [c36]Keiichi Kaneko, Shietung Peng:
Disjoint Paths Routing in Pancake Graphs. PDCAT 2006: 254-259 - 2005
- [j23]Yamin Li, Shietung Peng, Wanming Chu:
Fault-tolerant cycle embedding in dual-cube with node faults. Int. J. High Perform. Comput. Netw. 3(1): 45-53 (2005) - [c35]Yamin Li, Shietung Peng, Wanming Chu:
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. ICPADS (1) 2005: 71-77 - [c34]Yamin Li, Shietung Peng, Wanming Chu:
Online Adaptive Fault-Tolerant Routing in 2D Torus. ISPA 2005: 150-161 - [c33]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. PDCAT 2005: 75-79 - 2004
- [j22]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Collective Communications in Dual-Cube. J. Supercomput. 28(1): 71-90 (2004) - [c32]Yamin Li, Shietung Peng, Wanming Chu:
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes. PDCS 2004: 222-228 - [c31]Yamin Li, Shietung Peng, Wanming Chu:
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. CIS 2004: 51-56 - [c30]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 - [c29]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 - 2003
- [j21]Qian-Ping Gu, Shietung Peng:
Multihop All-to-All Broadcast on WDM Optical Networks. IEEE Trans. Parallel Distributed Syst. 14(5): 477-486 (2003) - 2002
- [c28]Yamin Li, Shietung Peng, Wanming Chu:
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. CW 2002: 85-94 - [c27]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Communication in Metacube: A New Interconnection Network. ISPAN 2002: 165- - 2001
- [c26]Yamin Li, Shietung Peng:
Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network. ICPADS 2001: 315-322 - [c25]Qian-Ping Gu, Shietung Peng:
Multi-hop All-to-All Broadcast on WDM Optical Networks. ICPP Workshops 2001: 291-296 - 2000
- [j20]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60(6): 764-774 (2000) - [j19]Qian-Ping Gu, Shietung Peng:
Cluster fault-tolerant routing in star graphs. Networks 35(1): 83-90 (2000) - [c24]Shietung Peng, Stanislav Sedukhin:
Design of Multi-dimensional DCT Array Processors for Video Applications. Euro-Par 2000: 1086-1094 - [c23]Qian-Ping Gu, Shietung Peng:
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ICPP 2000: 513-520 - [c22]Qian-Ping Gu, Shietung Peng:
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. IPDPS 2000: 761-768
1990 – 1999
- 1999
- [j18]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) - [j17]Qian-Ping Gu, Shietung Peng:
Unicast in Hypercubes with Large Number of Faulty Nodes. IEEE Trans. Parallel Distributed Syst. 10(10): 964-975 (1999) - [c21]Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata:
A new scalable array processor for two-dimensional discrete Fourier transform. PARCO 1999: 358-365 - [c20]Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata:
Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT. PDPTA 1999: 1544-1550 - 1998
- [j16]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. Inf. Process. Lett. 67(6): 283-287 (1998) - [j15]Qian-Ping Gu, Shietung Peng:
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24(8): 1245-1261 (1998) - [c19]Qian-Ping Gu, Shietung Peng:
Routing in Hypercubes with Large Number of Faulty Nodes. ICPADS 1998: 718- - [c18]Qian-Ping Gu, Shietung Peng:
Cluster Fault Tolerant Routing in Hypercubes. ICPP 1998: 148-155 - 1997
- [j14]Qian-Ping Gu, Shietung Peng:
Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62(4): 201-207 (1997) - [j13]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46(9): 1042-1049 (1997) - [c17]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. ISPAN 1997: 404-409 - 1996
- [j12]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) - [j11]Qian-Ping Gu, Shietung Peng:
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. Comput. J. 39(7): 626-629 (1996) - [j10]Shietung Peng, Stanislav Sedukhin:
Array Processors Design for Division-free Linear System Solving. Comput. J. 39(8): 713-722 (1996) - [j9]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) - [j8]Qian-Ping Gu, Shietung Peng:
Fault Tolerant Routing in Hypercubes and Star Graphs. Parallel Process. Lett. 6(1): 127-136 (1996) - [c16]Shietung Peng, Stanislav Sedukhin, Igor S. Sedukhin:
Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination. ASAP 1996: 183-192 - [c15]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ICPADS 1996: 98-105 - 1995
- [j7]Qian-Ping Gu, Shietung Peng:
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. IEICE Trans. Inf. Syst. 78-D(9): 1171-1177 (1995) - [j6]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. Inf. Process. Lett. 56(1): 29-35 (1995) - [c14]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 - [c13]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. SPDP 1995: 673-680 - 1994
- [j5]Shietung Peng, Win-Tsung Lo:
A Simple Optimal Parallel Algorithm for a Core of a Tree. J. Parallel Distributed Comput. 20(3): 388-392 (1994) - [j4]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) - [c12]Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for K-tree Recognition and its Applications. HICSS (2) 1994: 194-202 - [c11]Qian-Ping Gu, Shietung Peng:
Algorithms for Node Disjoint Paths in Incomplete Star Networks. ICPADS 1994: 296-303 - [c10]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC 1994: 342-350 - [c9]Qian-Ping Gu, Shietung Peng:
Advanced fault tolerant routing in hypercubes. ISPAN 1994: 189-196 - 1993
- [j3]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
- [c8]Shietung Peng, A. B. Stephens, Yelena Yesha:
Algorithms for a K-Tree Core of a Tree. ICCI 1992: 38-41 - [c7]Win-Tsung Lo, Shietung Peng:
An Optimal Parallel Algorithm for a Core of a Tree. ICPP (3) 1992: 326-329 - 1991
- [c6]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
- [j2]Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs and Parity Graphs with Applications. J. Algorithms 11(2): 252-284 (1990) - [c5]Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. ICPP (3) 1990: 364-365
1980 – 1989
- 1989
- [c4]Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs Recognition and Applications. WADS 1989: 335-351 - 1987
- [c3]Eliezer Dekel, Simeon C. Ntafos, Shietung Peng:
Compression Trees and Their Applications. ICPP 1987: 132-139 - 1986
- [j1]Eliezer Dekel, Shietung Peng, S. Sitharma Lyengar:
Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree. Int. J. Parallel Program. 15(6): 503-528 (1986) - [c2]Eliezer Dekel, Simeon C. Ntafos, Shietung Peng:
Parallel Tree Techniques and Code Optimization. Aegean Workshop on Computing 1986: 205-216 - [c1]Eliezer Dekel, Shietung Peng, Shietung Iyengar:
Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree. ICPP 1986: 1010-1012
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
