The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harry H. Tan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Scott K. Walley, Harry H. Tan
    Shortest Paths in Random Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:213-222 [Conf]
  2. Chung G. Chang, Harry H. Tan
    Queueing Analysis of Explicit Policy Assignmant Push-Out Buffer Sharing Schemes for ATM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:500-509 [Conf]
  3. Santiago V. Hung, Harry H. Tan
    Performance Analysis of Slotted Replication ALOHA Over Fading Communications Channels. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:228-236 [Conf]
  4. Chung Gu Kang, Harry H. Tan
    Queueing Analysis of Explicit Priority Assignment Partial Buffer Sharing Schemes for ATM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:810-819 [Conf]
  5. Harry H. Tan, Santiago V. Hung
    Performance Analysis of Slotted ALOHA Over Fading Communications Channels. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1990, pp:595-602 [Conf]
  6. Harry H. Tan, Tsun-Yee Yan
    A New Free-Access Collision Resolution Algorithm Based Connection Request Procedure for Land Mobile Satellite Systems. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1989, pp:1057-1062 [Conf]
  7. Kuang Tsai, Harry H. Tan
    Common Channel Priority Acknowledgement Schemes for Carrier Sense Cable Systems. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1990, pp:1196-1203 [Conf]
  8. Kuang Tsai, Harry H. Tan
    Stability Analysis for Persistent CSMA/CD Systems. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:1316-1325 [Conf]
  9. Scott K. Walley, Harry H. Tan, Audrey M. Viterbi
    Shortest Path Cost Distribution in Random Graphs with Positive Integer Edge Costs. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:1023-1032 [Conf]
  10. Scott K. Walley, Harry H. Tan, Audrey M. Viterbi
    Limit Distributions for the Diameter and the Shortest Path Hop Count in Random Graphs with Positive Integer Edge Costs. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:618-627 [Conf]
  11. Chung Gu Kang, Harry H. Tan
    Fault-tolerant design of packet switched network with unreliable links. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1997, v:20, n:7, pp:544-553 [Journal]
  12. Chung Gu Kang, Harry H. Tan
    Combined channel allocation and routing algorithms in packet switched networks. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1997, v:20, n:13, pp:1175-1190 [Journal]
  13. Chung Gu Kang, Harry H. Tan
    Queueing analysis of explicit priority assignment buffer access scheme for ATM networks. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1998, v:21, n:11, pp:996-1009 [Journal]
  14. William J. Leighton III, Harry H. Tan
    Trellis Coding for Degraded Broadcast Channels [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:39, n:2, pp:119-134 [Journal]
  15. Harry H. Tan
    Block Coding for Stationary Gaussian Sources with Memory Under a Square-Error Fidelity Criterion [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:29, n:1, pp:11-28 [Journal]
  16. Harry H. Tan
    Two-User Interference Channels With Correlated Information Sources [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:44, n:1, pp:77-104 [Journal]
  17. Harry H. Tan, K. Yao
    Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:27, n:3, pp:272-288 [Journal]
  18. William J. Leighton III, Harry H. Tan
    Capacity region of degraded broadcast channels with feedback. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1977, v:13, n:2, pp:167-177 [Journal]

Search in 0.003secs, Finished in 0.004secs
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