Jay Cheng

	2011
36		Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee: Maximizing throughput in wireless networks with finite internal buffers. INFOCOM 2011: 2345-2353
35		Cheng-Shang Chang, Chin-Yi Hsu, Jay Cheng, Duan-Shin Lee: A general probabilistic framework for detecting community structure in networks. INFOCOM 2011: 730-738
34		Jay Cheng, Xuan-Chao Huang, Chih-Heng Cheng, Hsin-Hung Chou, Cheng-Shang Chang, Duan-Shin Lee: Average Number of Recirculations in SDL Constructions of Optical Priority Queues. IEEE Communications Letters 15(8): 899-901 (2011)
33		Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Chi-Feung Wu: Quasi-Output-Buffered Switches. IEEE Trans. Parallel Distrib. Syst. 22(5): 833-846 (2011)
32		Jay Cheng, Hsien-Chen Chiu, Cheng-Shang Chang, Duan-Shin Lee: Constructions of Optical Priority Queues With Multiple Inputs and Multiple Outputs. IEEE Transactions on Information Theory 57(7): 4274-4301 (2011)
	2010
31		Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Jou-Ting Liao: Using Banyan Networks for Load-Balanced Switches with Incremental Update. ICC 2010: 1-6
30		Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Jou-Ting Liao: Twister Networks and Their Applications to Load-Balanced Switches. INFOCOM 2010: 2687-2695
29		Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Xuan-Chao Huang, Duan-Shin Lee: A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching. INFOCOM 2010: 839-847
28		Jay Cheng, Cheng-Shang Chang, Sheng-Hua Yang, Tsz-Hsuan Chao, Duan-Shin Lee, Ching-Ming Lien: Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions CoRR abs/1004.4070: (2010)
27		Xuan-Chao Huang, Jay Cheng: Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions CoRR abs/1004.4277: (2010)
26		Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Hung-Shih Chueh, Kuan-Ting Wang: Emulation of an Optical Flexible Delay Line by Parallel Variable Optical Delay Lines. IEEE Communications Letters 14(8): 770-772 (2010)
	2009
25		Jie Yang, Yingying Chen, Wade Trappe, Jay Cheng: Determining the Number of Attackers and Localizing Multiple Adversaries in Wireless Spoofing Attacks. INFOCOM 2009: 666-674
24		Duan-Shin Lee, Kai-Jie Hsu, Cheng-Shang Chang, Jay Cheng: Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines. INFOCOM 2009: 720-728
23		Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee: SDL Constructions of FIFO, LIFO and Absolute Contractors. INFOCOM 2009: 738-746
22		Cheng-Shang Chang, Yu-Hao Hsu, Jay Cheng, Duan-Shin Lee: A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput. INFOCOM 2009: 747-755
21		Cheng-Shang Chang, Jay Cheng, Tsz-Hsuan Chao, Duan-Shin Lee: Optimal constructions of fault tolerant optical linear compressors and linear decompressors. IEEE Transactions on Communications 57(4): 1140-1150 (2009)
20		Jay Cheng, Toby Berger: On minimal eigenvalues of a class of tridiagonal matrices. IEEE Transactions on Information Theory 55(11): 5024-5031 (2009)
19		Yi-Ting Chen, Jay Cheng, Duan-Shin Lee: Constructions of linear compressors, nonovertaking delay lines, and flexible delay lines for optical packet switching. IEEE/ACM Trans. Netw. 17(6): 2014-2027 (2009)
	2008
18		Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Chi-Feung Wu: Quasi-Output-Buffered Switches. INFOCOM 2008: 306-310
17		Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng-Sheng Yan: Queueing Analysis of Loss Systems with Variable Optical Delay Lines. INFOCOM 2008: 637-645
16		Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, Duan-Shin Lee, Ching-Ming Lien: On Constructions of Optical Queues with a Limited Number of Recirculations. INFOCOM 2008: 664-672
15		Jay Cheng: Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations. IEEE Transactions on Information Theory 54(9): 4040-4052 (2008)
	2007
14		Tsz-Hsuan Chao, Cheng-Shang Chang, Duan-Shin Lee, Jay Cheng: Constructions of Multicast Flexible Delay Lines and Optical Multicast Switches with 100% Throughput. GLOBECOM 2007: 2237-2241
13		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		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		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		Jay Cheng: On the expected codeword length per symbol of optimal prefix codes for extended sources. IWCMC 2007: 325-328
9		Jay Cheng: Constructions of Fault-Tolerant Optical 2-to-1 FIFO Multiplexers. IEEE Transactions on Information Theory 53(11): 4092-4105 (2007)
8		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		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		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		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		Jay Cheng, Tien-Ke Huang: Upper bounds on exponentiated expected length of optimal one-to-one codes. IWCMC 2006: 1207-1212
3		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

Coauthor Index

1	Toby Berger	[20]
2	Cheng-Shang Chang	[1] [3] [5] [7] [11] [12] [13] [14] [16] [17] [18] [21] [22] [23] [24] [26] [28] [29] [30] [31] [32] [33] [34] [35] [36]
3	Chi-Chao Chao	[2]
4	Tsz-Hsuan Chao	[11] [14] [16] [21] [28]
5	Yi-Ting Chen	[3] [5] [12] [19]
6	Yingying Chen	[25]
7	Chih-Heng Cheng	[34]
8	Hsien-Chen Chiu	[7] [13] [32]
9	Hsin-Hung Chou	[34]
10	Hung-Shih Chueh	[26]
11	Chin-Yi Hsu	[35]
12	Kai-Jie Hsu	[24]
13	Yu-Hao Hsu	[22]
14	C.-C. Huang	[12]
15	Po-Kai Huang	[3]
16	Tien-Ke Huang	[4] [6] [8] [29]
17	Xuan-Chao Huang	[27] [29] [34]
18	Duan-Shin Lee	[3] [5] [7] [11] [12] [13] [14] [16] [17] [18] [19] [21] [22] [23] [24] [26] [28] [29] [30] [31] [32] [33] [34] [35] [36]
19	Jou-Ting Liao	[30] [31]
20	Ching-Ming Lien	[16] [28] [30] [31] [36]
21	Wade Trappe	[25]
22	Kuan-Ting Wang	[26]
23	Claudio Weidmann	[8]
24	Chi-Feung Wu	[18] [33]
25	Horng-Sheng Yan	[17]
26	Sheng-Hua Yang	[28]
27	Jie Yang	[25]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page