The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jay Cheng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jay Cheng, Tien-Ke Huang
    New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:43-52 [Conf]
  2. Cheng-Shang Chang, Jay Cheng
    Computable Exponential Bounds for Intree Networks with Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:197-204 [Conf]
  3. Cheng-Shang Chang, Yi-Ting Chen, Jay Cheng, Po-Kai Huang, Duan-Shin Lee
    From switching theory to "queueing" theory. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2006, v:34, n:2, pp:26-28 [Journal]
  4. Jay Cheng, Chi-chao Chao
    On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:294-298 [Journal]
  5. Jay Cheng, Tien-Ke Huang, Claudio Weidmann
    New Bounds on the Expected Length of Optimal One-to-One Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1884-1895 [Journal]
  6. 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. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:679-687 [Conf]
  7. Cheng-Shang Chang, Tsz-Hsuan Chao, Jay Cheng, Duan-Shin Lee
    Constructions of Fault Tolerant Linear Compressors and Linear Decompressors. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:688-696 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2501-2505 [Conf]
  9. Cheng-Shang Chang, Yi-Ting Chen, Jay Cheng, Duan-Shin Lee
    Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  10. Jay Cheng
    On the expected codeword length per symbol of optimal prefix codes for extended sources. [Citation Graph (0, 0)][DBLP]
    IWCMC, 2007, pp:325-328 [Conf]
  11. Jay Cheng, Tien-Ke Huang
    Upper bounds on exponentiated expected length of optimal one-to-one codes. [Citation Graph (0, 0)][DBLP]
    IWCMC, 2006, pp:1207-1212 [Conf]
  12. Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee
    A simple proof for the constructions of optical priority queues. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2007, v:56, n:2, pp:73-77 [Journal]

  13. Quasi-Output-Buffered Switches. [Citation Graph (, )][DBLP]


  14. Queueing Analysis of Loss Systems with Variable Optical Delay Lines. [Citation Graph (, )][DBLP]


  15. On Constructions of Optical Queues with a Limited Number of Recirculations. [Citation Graph (, )][DBLP]


  16. SDL Constructions of FIFO, LIFO and Absolute Contractors. [Citation Graph (, )][DBLP]


  17. A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput. [Citation Graph (, )][DBLP]


  18. Determining the Number of Attackers and Localizing Multiple Adversaries in Wireless Spoofing Attacks. [Citation Graph (, )][DBLP]


  19. Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines. [Citation Graph (, )][DBLP]


  20. A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching. [Citation Graph (, )][DBLP]


  21. Twister Networks and Their Applications to Load-Balanced Switches. [Citation Graph (, )][DBLP]


  22. Constructions of Multicast Flexible Delay Lines and Optical Multicast Switches with 100% Throughput. [Citation Graph (, )][DBLP]


  23. Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions [Citation Graph (, )][DBLP]


  24. Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002