I agree that this site is using cookies. You can find further informations here.
X
Peng, Shietung
20  results:
Search for persons X
?
1

Hierarchical Dual-Net: A Flexible Interconnection Network a..:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
International Journal of Networking and Computing.  2 (2012)  2 - p. 234-250 , 2012
Link: https://doi.org/10.15803..
 
?
2

Node-to-set disjoint-path routing in perfect hierarchical h..:

Bossard, Antoine ; Kaneko, Keiichi ; Peng, Shietung
Procedia Computer Science.  4 (2011)  - p. 442-451 , 2011
Link: https://doi.org/10.1016/..
 
?
3

Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
International Journal of Networking and Computing.  1 (2011)  2 - p. 178-190 , 2011
Link: https://doi.org/10.15803..
 
?
4

Recursive dual‐net: A new versatile network for supercomput..:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
Journal of the Chinese Institute of Engineers.  32 (2009)  7 - p. 931-938 , 2009
Link: https://doi.org/10.1080/..
 
?
5

A new presentation of Metacubes for algorithmic design and ..:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
Journal of the Chinese Institute of Engineers.  32 (2009)  7 - p. 939-949 , 2009
Link: https://doi.org/10.1080/..
 
?
6

Metacube—a versatile family of interconnection networks for..:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
The Journal of Supercomputing.  53 (2009)  2 - p. 329-351 , 2009
Link: https://doi.org/10.1007/..
 
?
7

Efficient algorithms for a constrained k-tree core problem ..:

Wang, Biing-Feng ; Peng, Shietung ; Yu, Hong-Yi.
Journal of Algorithms.  59 (2006)  2 - p. 107-124 , 2006
Link: https://doi.org/10.1016/..
 
?
8

Efficient Collective Communications in Dual-Cube:

Li, Yamin ; Peng, Shietung ; Chu, Wanming
The Journal of Supercomputing.  28 (2004)  1 - p. 71-90 , 2004
Link: https://doi.org/10.1023/..
 
?
9

Cluster fault-tolerant routing in star graphs:

Gu, Qian-Ping ; Peng, Shietung
Networks.  35 (2000)  1 - p. 83-90 , 2000
Link: https://doi.org/10.1002/..
 
?
10

An Efficient Algorithm for the k-Pairwise Disjoint Paths Pr..:

Gu, Qian-Ping ; Peng, Shietung
Journal of Parallel and Distributed Computing.  60 (2000)  6 - p. 764-774 , 2000
Link: https://doi.org/10.1006/..
 
?
11

A 2-approximation algorithm for genome rearrangements by re..:

Gu, Qian-Ping ; Peng, Shietung ; Sudborough, Hal
Theoretical Computer Science.  210 (1999)  2 - p. 327-339 , 1999
Link: https://doi.org/10.1016/..
 
?
12

An efficient algorithm for k-pairwise disjoint paths in sta..:

Gu, Qian-Ping ; Peng, Shietung
Information Processing Letters.  67 (1998)  6 - p. 283-287 , 1998
Link: https://doi.org/10.1016/..
 
?
13

Node-to-set and set-to-set cluster fault tolerant routing i..:

Gu, Qian-Ping ; Peng, Shietung
Parallel Computing.  24 (1998)  8 - p. 1245-1261 , 1998
Link: https://doi.org/10.1016/..
 
?
14

Node-to-set disjoint paths problem in star graphs:

Gu, Qian-Ping ; Peng, Shietung
Information Processing Letters.  62 (1997)  4 - p. 201-207 , 1997
Link: https://doi.org/10.1016/..
 
?
15

Efficient Algorithms for Finding a Core of a Tree with a Sp..:

Peng, Shietung ; Lo, Win-tsung
Journal of Algorithms.  20 (1996)  3 - p. 445-458 , 1996
Link: https://doi.org/10.1006/..
 
1-15