The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shietung Peng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. Hamiltonian Connectedness of Recursive Dual-Net. [Citation Graph (, )][DBLP]


  56. Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. [Citation Graph (, )][DBLP]


  57. A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  58. The Recursive Dual-Net and Its Applications. [Citation Graph (, )][DBLP]


  59. K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. [Citation Graph (, )][DBLP]


  60. An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. [Citation Graph (, )][DBLP]


  61. Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. [Citation Graph (, )][DBLP]


  62. Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. [Citation Graph (, )][DBLP]


  63. Parallel Prefix Computation in the Recursive Dual-Net. [Citation Graph (, )][DBLP]


  64. Prefix Computation and Sorting in Dual-Cube. [Citation Graph (, )][DBLP]


  65. K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  66. Node-to-Set Disjoint Paths Routing in Dual-Cube. [Citation Graph (, )][DBLP]


  67. A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. [Citation Graph (, )][DBLP]


  68. Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. [Citation Graph (, )][DBLP]


  69. An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. [Citation Graph (, )][DBLP]


  70. Pairwise Disjoint Paths in Pancake Graphs. [Citation Graph (, )][DBLP]


  71. An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. [Citation Graph (, )][DBLP]


  72. Set-to-Set Disjoint Paths Routing in Dual-Cubes. [Citation Graph (, )][DBLP]


  73. Node-to-Set Disjoint-path Routing in Metacube. [Citation Graph (, )][DBLP]


  74. Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. [Citation Graph (, )][DBLP]


  75. Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002