default search action
Jay Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Jay Cheng, Shin-Shiang Huang, Hsin-Hung Chou, Ming-Che Tang:
On the maximum buffer size achieved in a class of constructions of optical priority queues. J. Commun. Networks 25(4): 429-439 (2023) - 2022
- [j21]Jay Cheng
, Sheng-Hua Yang, Chun-Yung Wang
On Efficient Constructions of Optical Priority Queues. IEEE Trans. Commun. 70(3): 1861-1874 (2022) - [c30]Jay Cheng, Hsin-Hung Chou, Shin-Shiang Huang, Ming-Che Tang:
Constructions of Optical MIMO Priority Queues With Time-Varying Service Capacity. APCC 2022: 504-509
2010 – 2019
- 2019
- [c29]Jay Cheng, Chun-Yung Wang, Bin Tang:
Construction Efficiency for Constructions of Optical Priority Queues Under Priority-Based Routing. ICSAI 2019: 1029-1034 - 2017
- [j20]Jay Cheng
Greedy Constructions of Optical Queues With a Limited Number of Recirculations. IEEE Trans. Inf. Theory 63(8): 5314-5326 (2017) - 2016
- [j19]Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Duan-Shin Lee, Cheng-Yu Chen:
Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses. ACM Trans. Model. Perform. Evaluation Comput. Syst. 1(2): 8:1-8:25 (2016) - 2015
- [j18]Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Xuan-Chao Huang, Duan-Shin Lee, Chao-Yi Chen:
Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching. IEEE Trans. Computers 64(12): 3404-3416 (2015) - 2014
- [j17]Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Duan-Shin Lee:
Constructions of Memoryless Crosstalk Avoidance Codes Via ${\cal C}$ -Transform. IEEE Trans. Very Large Scale Integr. Syst. 22(9): 2030-2033 (2014) - 2013
- [c28]Jay Cheng, Hsin-Hung Chou, Chih-Heng Cheng:
A necessary and sufficient condition for SDL constructions of optical FIFO queues. GLOBECOM 2013: 2339-2345 - [c27]Xuan-Chao Huang, Jay Cheng, Hsin-Hung Chou, Chih-Heng Cheng, Hsien-Tsan Chen:
Detecting overlapping communities in networks based on a simple node behavior model. GLOBECOM 2013: 3120-3125 - [c26]Hung-Shih Chueh, Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee:
Load-balanced Birkhoff-von Neumann switches and fat-tree networks. HPSR 2013: 142-147 - [c25]Yeong-Lin Lai, Jay Cheng:
A 2.45-GHz RFID wireless-sensor-network location tracking system. ISCE 2013: 133-134 - 2012
- [c24]Sheng-Hua Yang, Jay Cheng, Hsin-Hung Chou, Chih-Heng Cheng:
Loss Probability and Delay of Finite-Buffer Queues with Discrete ON-OFF Markovian Arrivals and Geometric Service Times. ICAIT 2012: 83-97 - 2011
- [j16]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 Commun. Lett. 15(8): 899-901 (2011) - [j15]Jay Cheng, Hsien-Chen Chiu, Cheng-Shang Chang, Duan-Shin Lee:
Constructions of Optical Priority Queues With Multiple Inputs and Multiple Outputs. IEEE Trans. Inf. Theory 57(7): 4274-4301 (2011) - [j14]Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Chi-Feung Wu:
Quasi-Output-Buffered Switches. IEEE Trans. Parallel Distributed Syst. 22(5): 833-846 (2011) - [c23]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 - [c22]Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee:
Maximizing throughput in wireless networks with finite internal buffers. INFOCOM 2011: 2345-2353 - 2010
- [j13]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 Commun. Lett. 14(8): 770-772 (2010) - [c21]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 - [c20]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 - [c19]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 - [i2]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) - [i1]Xuan-Chao Huang, Jay Cheng:
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions. CoRR abs/1004.4277 (2010)
2000 – 2009
- 2009
- [j12]Cheng-Shang Chang, Jay Cheng, Tsz-Hsuan Chao, Duan-Shin Lee:
Optimal constructions of fault tolerant optical linear compressors and linear decompressors. IEEE Trans. Commun. 57(4): 1140-1150 (2009) - [j11]Jay Cheng:
On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources. IEEE Trans. Inf. Theory 55(4): 1692-1695 (2009) - [j10]Jay Cheng, Toby Berger:
On minimal eigenvalues of a class of tridiagonal matrices. IEEE Trans. Inf. Theory 55(11): 5024-5031 (2009) - [j9]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) - [c18]Jie Yang, Yingying Chen
Determining the Number of Attackers and Localizing Multiple Adversaries in Wireless Spoofing Attacks. INFOCOM 2009: 666-674 - [c17]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 - [c16]Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee:
SDL Constructions of FIFO, LIFO and Absolute Contractors. INFOCOM 2009: 738-746 - [c15]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 - 2008
- [j8]Jay Cheng:
Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations. IEEE Trans. Inf. Theory 54(9): 4040-4052 (2008) - [c14]Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Chi-Feung Wu:
Quasi-Output-Buffered Switches. INFOCOM 2008: 306-310 - [c13]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 - [c12]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 - 2007
- [j7]Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee:
A simple proof for the constructions of optical priority queues. Queueing Syst. Theory Appl. 56(2): 73-77 (2007) - [j6]Po-Kai Huang, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee:
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines. IEEE Trans. Inf. Theory 53(5): 1778-1798 (2007) - [j5]Jay Cheng, Tien-Ke Huang, Claudio Weidmann:
New Bounds on the Expected Length of Optimal One-to-One Codes. IEEE Trans. Inf. Theory 53(5): 1884-1895 (2007) - [j4]Jay Cheng:
Constructions of Fault-Tolerant Optical 2-to-1 FIFO Multiplexers. IEEE Trans. Inf. Theory 53(11): 4092-4105 (2007) - [c11]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 - [c10]Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee, Ching-Chu Huang:
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts. INFOCOM 2007: 679-687 - [c9]Cheng-Shang Chang, Tsz-Hsuan Chao, Jay Cheng, Duan-Shin Lee:
Constructions of Fault Tolerant Linear Compressors and Linear Decompressors. INFOCOM 2007: 688-696 - [c8]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 - [c7]Jay Cheng:
On the expected codeword length per symbol of optimal prefix codes for extended sources. IWCMC 2007: 325-328 - 2006
- [j3]Cheng-Shang Chang, Yi-Ting Chen, Jay Cheng, Po-Kai Huang, Duan-Shin Lee:
From switching theory to "queueing" theory. SIGMETRICS Perform. Evaluation Rev. 34(2): 26-28 (2006) - [j2]Chih-Chieh Chou
A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines. IEEE Trans. Inf. Theory 52(10): 4519-4531 (2006) - [c6]Jay Cheng, Tien-Ke Huang:
New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes. DCC 2006: 43-52 - [c5]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 - [c4]Jay Cheng, Tien-Ke Huang:
Upper bounds on exponentiated expected length of optimal one-to-one codes. IWCMC 2006: 1207-1212 - 2003
- [c3]Jay Cheng, Toby Berger:
Capacity and performance analysis for hybrid selection/maximal-ratio combining in Nakagami fading with unequal fading parameters and branch powers. ICC 2003: 3031-3035 - [c2]Jay Cheng, Toby Berger:
Performance analysis for MRC and postdetection EGC over generalized gamma fading channels. WCNC 2003: 120-125
1990 – 1999
- 1997
- [j1]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 Trans. Inf. Theory 43(1): 294-298 (1997) - 1995
- [c1]Cheng-Shang Chang, Jay Cheng:
Computable Exponential Bounds for Intree Networks with Routing. INFOCOM 1995: 197-204
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: