| 2008 |
|---|
| 26 | EE | 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 |
| 25 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network.
HICSS 2008: 472 |
| 24 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Prefix Computation and Sorting in Dual-Cube.
ICPP 2008: 389-396 |
| 23 | EE | 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 |
| 22 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube.
PDCAT 2008: 54-61 |
| 2007 |
|---|
| 21 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks.
PDCAT 2007: 285-292 |
| 20 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications.
PDCAT 2007: 355-362 |
| 2006 |
|---|
| 19 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
K-MCore for Multicasting on Mobile Ad Hoc Networks.
PDCAT 2006: 109-114 |
| 2005 |
|---|
| 18 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus.
ICPADS (1) 2005: 71-77 |
| 17 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Online Adaptive Fault-Tolerant Routing in 2D Torus.
ISPA 2005: 150-161 |
| 16 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks.
PDCAT 2005: 75-79 |
| 15 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Fault-tolerant cycle embedding in dual-cube with node faults.
IJHPCN 3(1): 45-53 (2005) |
| 2004 |
|---|
| 14 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes.
CIS 2004: 51-56 |
| 13 | | Yamin Li,
Shietung Peng,
Wanming Chu:
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes.
ISCA PDCS 2004: 222-228 |
| 12 | EE | 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 |
| 11 | | 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 |
| 10 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Collective Communications in Dual-Cube.
The Journal of Supercomputing 28(1): 71-90 (2004) |
| 2002 |
|---|
| 9 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube.
CW 2002: 85-94 |
| 8 | EE | Yamin Li,
Shietung Peng,
Wanming Chu:
Efficient Communication in Metacube: A New Interconnection Network.
ISPAN 2002: 165- |
| 2001 |
|---|
| 7 | EE | Kenji Watanabe,
Wanming Chu,
Yamin Li:
Exploiting Java Instruction/Thread Level Parallelism with Horizontal Multithreading.
ACSAC 2001: 35-44 |
| 2000 |
|---|
| 6 | EE | Wanming Chu,
Yamin Li:
Cost/Performance Tradeoff of n-Select Square Root Implementations.
ACAC 2000: 9-16 |
| 1997 |
|---|
| 5 | EE | Yamin Li,
Wanming Chu:
Implementation of single precision floating point square root on FPGAs.
FCCM 1997: 226-233 |
| 4 | | Yamin Li,
Wanming Chu:
Parallel-Array Implementations of a Non-Restoring Square Root Algorithm.
ICCD 1997: 690-695 |
| 1996 |
|---|
| 3 | EE | Yamin Li,
Wanming Chu:
A New Non-Restoring Square Root Algorithm and its VLSI Implementation.
ICCD 1996: 538-544 |
| 1995 |
|---|
| 2 | | Yamin Li,
Wanming Chu:
The Effects of STEF in Finely Parallel Multithreaded Processors.
HPCA 1995: 318-325 |
| 1 | | Yamin Li,
Wanming Chu:
Design and Implementation of a Multiple-Instruction-Stream.
Parallel and Distributed Computing and Systems 1995: 477-480 |
