 | 2011 |
| 37 |  | Hsien-Jone Hsieh,
Dyi-Rong Duh:
ω-wide diameters of enhanced pyramid networks.
Theor. Comput. Sci. 412(29): 3658-3675 (2011) |
| 2010 |
| 36 |  | Jia-Wei Lin,
Dyi-Rong Duh:
Distributed Fault Detection of Wireless Sensor Networks Based on Cluster Heads.
ICWN 2010: 472-477 |
| 35 |  | Geng-Cyuan Jheng,
Dyi-Rong Duh,
Cheng-Nan Lai:
Real-time reconfigurable cache for low-power embedded systems.
IJES 4(3/4): 235-247 (2010) |
| 34 |  | Yi-Ching Chen,
Dyi-Rong Duh:
Two-node-Hamiltonicity of enhanced pyramid networks.
Inf. Sci. 180(13): 2588-2595 (2010) |
| 2009 |
| 33 |  | Leu-Chin Chen,
Dyi-Rong Duh,
Tsang-Yi Wang:
Using a Saturation Counter to Improve the Accuracy of Final Decisions in Wireless Sensor Networks.
ICWN 2009: 124-129 |
| 32 |  | Ruei-Yu Wu,
Dyi-Rong Duh:
Hamiltonicity of the Pyramid Network with or without Fault.
J. Inf. Sci. Eng. 25(2): 531-542 (2009) |
| 2008 |
| 31 |  | Tsang-Yi Wang,
Li-Yuan Chang,
Dyi-Rong Duh,
Jeng-Yang Wu:
Fault-tolerant decision fusion via collaborative sensor fault detection in wireless sensor networks.
IEEE Transactions on Wireless Communications 7(2): 756-768 (2008) |
| 30 |  | Tsung-Chi Lin,
Dyi-Rong Duh:
Constructing vertex-disjoint paths in (n, k)-star graphs.
Inf. Sci. 178(3): 788-801 (2008) |
| 29 |  | Ying-You Chen,
Dyi-Rong Duh,
Tai-Ling Ye,
Jung-Sheng Fu:
Weak-vertex-pancyclicity of (n, k)-star graphs.
Theor. Comput. Sci. 396(1-3): 191-199 (2008) |
| 2007 |
| 28 |  | Jeng-Yang Wu,
Dyi-Rong Duh,
Tsang-Yi Wang,
Li-Yuan Chang:
Fast and Simple On-Line Sensor Fault Detection Scheme for Wireless Sensor Networks.
EUC 2007: 444-455 |
| 27 |  | Jeng-Yang Wu,
Dyi-Rong Duh,
Tsang-Yi Wang,
Li-Yuan Chang:
On-Line Sensor Fault Detection Scheme for Wireless Sensor Networks.
ICWN 2007: 329-334 |
| 26 |  | Dyi-Rong Duh,
Yi-Ching Chen,
Ruei-Yu Wu:
Proof that pyramid networks are 1-Hamiltonian-connected with high probability.
Inf. Sci. 177(19): 4188-4199 (2007) |
| 25 |  | Yi-Jung Chen,
Dyi-Rong Duh,
Yunghsiang Sam Han:
Improved Modulo (2n+1) Multiplier for IDEA.
J. Inf. Sci. Eng. 23(3): 911-923 (2007) |
| 2006 |
| 24 |  | Hsien-Jone Hsieh,
Dyi-Rong Duh:
Constructing Node-Disjoint Paths in Enhanced Pyramid Networks.
Asia-Pacific Computer Systems Architecture Conference 2006: 380-386 |
| 23 |  | Dyi-Rong Duh,
Hsien-Jone Hsieh:
Average Distances of Pyramid Networks.
PDPTA 2006: 171-176 |
| 22 |  | Dyi-Rong Duh,
Tsung-Chi Lin,
Chi-Ho Tung,
Shin-Jie Chan:
An Implementation of AES Algorithm with the Multiple Spaces Random Key Pre-Distribution Scheme on MOTE-KIT 5040.
SUTC (2) 2006: 64-71 |
| 2005 |
| 21 |  | Yi-Ching Chen,
Dyi-Rong Duh,
Ruei-Yu Wu:
Hamiltonian-Connectedness of the Pyramid Network with One Faulty Node.
Parallel and Distributed Computing and Networks 2005: 147-152 |
| 2004 |
| 20 |  | Yi-Ching Chen,
Dyi-Rong Duh,
Hsien-Jone Hsieh:
On the Enhanced Pyramid Network.
PDPTA 2004: 1483-1489 |
| 19 |  | Ruei-Yu Wu,
Dyi-Rong Duh:
Pancyclicity of Pyramid Networks.
PDPTA 2004: 1523-1526 |
| 18 |  | Yi-Jung Chen,
Dyi-Rong Duh,
Yunghsiang S. Han:
A New Modulo (2n+1) Multiplier for IDEA.
Security and Management 2004: 318-324 |
| 17 |  | Chien-Cheng Lee,
Pau-Choo Chung,
Dyi-Rong Duh,
Yunghsiang S. Han,
Chi-Wei Lin:
A practice of a collaborative multipoint medical teleconsultation system on broadband network.
J. High Speed Networks 13(3): 207-222 (2004) |
| 2002 |
| 16 |  | Cheng-Nan Lai,
Gen-Huey Chen,
Dyi-Rong Duh:
Constructing One-to-Many Disjoint Paths in Folded Hypercubes.
IEEE Trans. Computers 51(1): 33-45 (2002) |
| 15 |  | Jung-Sheng Fu,
Gen-Huey Chen,
Dyi-Rong Duh:
Node-disjoint paths and related problems on hierarchical cubic networks.
Networks 40(3): 142-154 (2002) |
| 2001 |
| 14 |  | Jung-Sheng Fu,
Gen-Huey Chen,
Dyi-Rong Duh:
Combinatorial Properties of Hierarchical Cubic Networks.
ICPADS 2001: 525-532 |
| 13 |  | Gen-Huey Chen,
Shien-Ching Hwang,
Hui-Ling Huang,
Ming-Yang Su,
Dyi-Rong Duh:
A general broadcasting scheme for recursive networks with complete connection.
Parallel Computing 27(9): 1273-1278 (2001) |
| 2000 |
| 12 |  | Cheng-Nan Lai,
Gen-Huey Chen,
Dyi-Rong Duh:
Optimal One-to-Many Disjoint Paths in Folded Hypercubes.
ISPAN 2000: 148-155 |
| 11 |  | Ming-Yang Su,
Hui-Ling Huang,
Gen-Huey Chen,
Dyi-Rong Duh:
Node-disjoint paths in incomplete WK-recursive networks.
Parallel Computing 26(13-14): 1925-1944 (2000) |
| 1999 |
| 10 |  | Ming-Yang Su,
Gen-Huey Chen,
Dyi-Rong Duh:
Broadcasting on Incomplete WK-Recursive Networks.
J. Parallel Distrib. Comput. 57(3): 271-294 (1999) |
| 1998 |
| 9 |  | Gen-Huey Chen,
Shien-Ching Hwang,
Ming-Yang Su,
Dyi-Rong Duh:
A General Broadcasting Scheme for Recursive Networks with Complete Connection.
ICPADS 1998: 248- |
| 8 |  | Ming-Yang Su,
Gen-Huey Chen,
Dyi-Rong Duh:
Topological properties of incomplete WK-recursive networks.
Networks 32(1): 23-45 (1998) |
| 1997 |
| 7 |  | Ming-Yang Su,
Gen-Huey Chen,
Dyi-Rong Duh:
A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks.
IEEE Trans. Parallel Distrib. Syst. 8(4): 367-379 (1997) |
| 6 |  | Dyi-Rong Duh,
Gen-Huey Chen:
On the Rabin number problem.
Networks 30(3): 219-230 (1997) |
| 1996 |
| 5 |  | Ming-Yang Su,
Gen-Huey Chen,
Dyi-Rong Duh:
A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks.
ICPADS 1996: 90-97 |
| 4 |  | Ming-Yang Su,
Gen-Huey Chen,
Dyi-Rong Duh:
Broadcasting on Incomplete WK-Recursive Networks.
ISPAN 1996: 375-381 |
| 3 |  | Dyi-Rong Duh,
Gen-Huey Chen,
D. Frank Hsu:
Combinatorial Properties of Generalized Hypercube Graphs.
Inf. Process. Lett. 57(1): 41-45 (1996) |
| 1995 |
| 2 |  | Dyi-Rong Duh,
Gen-Huey Chen,
Jywe-Fei Fang:
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules.
IEEE Trans. Parallel Distrib. Syst. 6(7): 714-723 (1995) |
| 1994 |
| 1 |  | Dyi-Rong Duh,
Gen-Huey Chen:
Topological Properties of WK-Recursive Networks.
J. Parallel Distrib. Comput. 23(3): 468-474 (1994) |