| 2007 |
|---|
| 13 | EE | Hsien-Chen Chiu,
Cheng-Shang Chang,
Jay Cheng,
Duan-Shin Lee:
Using a Single Switch with O(M) Inputs/Outputs for the Construction of an Optical Priority Queue with O(M3) Buffer.
INFOCOM 2007: 2501-2505 |
| 12 | EE | Yi-Ting Chen,
Cheng-Shang Chang,
Jay Cheng,
Duan-Shin Lee,
C.-C. Huang:
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts.
INFOCOM 2007: 679-687 |
| 11 | EE | Cheng-Shang Chang,
Tsz-Hsuan Chao,
Jay Cheng,
Duan-Shin Lee:
Constructions of Fault Tolerant Linear Compressors and Linear Decompressors.
INFOCOM 2007: 688-696 |
| 10 | EE | Jay Cheng:
On the expected codeword length per symbol of optimal prefix codes for extended sources.
IWCMC 2007: 325-328 |
| 9 | EE | Jay Cheng:
Constructions of Fault-Tolerant Optical 2-to-1 FIFO Multiplexers.
IEEE Transactions on Information Theory 53(11): 4092-4105 (2007) |
| 8 | EE | Jay Cheng,
Tien-Ke Huang,
Claudio Weidmann:
New Bounds on the Expected Length of Optimal One-to-One Codes.
IEEE Transactions on Information Theory 53(5): 1884-1895 (2007) |
| 7 | EE | Hsien-Chen Chiu,
Cheng-Shang Chang,
Jay Cheng,
Duan-Shin Lee:
A simple proof for the constructions of optical priority queues.
Queueing Syst. 56(2): 73-77 (2007) |
| 2006 |
|---|
| 6 | EE | Jay Cheng,
Tien-Ke Huang:
New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes.
DCC 2006: 43-52 |
| 5 | EE | Cheng-Shang Chang,
Yi-Ting Chen,
Jay Cheng,
Duan-Shin Lee:
Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines.
INFOCOM 2006 |
| 4 | EE | Jay Cheng,
Tien-Ke Huang:
Upper bounds on exponentiated expected length of optimal one-to-one codes.
IWCMC 2006: 1207-1212 |
| 3 | EE | Cheng-Shang Chang,
Yi-Ting Chen,
Jay Cheng,
Po-Kai Huang,
Duan-Shin Lee:
From switching theory to "queueing" theory.
SIGMETRICS Performance Evaluation Review 34(2): 26-28 (2006) |
| 1997 |
|---|
| 2 | | Jay Cheng,
Chi-Chao Chao:
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two.
IEEE Transactions on Information Theory 43(1): 294-298 (1997) |
| 1995 |
|---|
| 1 | | Cheng-Shang Chang,
Jay Cheng:
Computable Exponential Bounds for Intree Networks with Routing.
INFOCOM 1995: 197-204 |
