default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry H. Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j20]Eesa M. Bastaki, Harry H. Tan, Yi Shi, Khaled Ben Letaief:
Frame synchronization based on multiple frame observations. IEEE Trans. Wirel. Commun. 9(3): 1097-1107 (2010)
2000 – 2009
- 2002
- [j19]Mark T. Core, Harry H. Tan:
BER for optical heterodyne DPSK receivers using delay demodulation and integration detection. IEEE Trans. Commun. 50(1): 21-30 (2002)
1990 – 1999
- 1998
- [j18]Chung Gu Kang, Harry H. Tan:
Queueing analysis of explicit priority assignment buffer access scheme for ATM networks. Comput. Commun. 21(11): 996-1009 (1998) - 1997
- [j17]Chung Gu Kang, Harry H. Tan:
Fault-tolerant design of packet switched network with unreliable links. Comput. Commun. 20(7): 544-553 (1997) - [j16]Chung Gu Kang, Harry H. Tan:
Combined channel allocation and routing algorithms in packet switched networks. Comput. Commun. 20(13): 1175-1190 (1997) - 1996
- [j15]Harry H. Tan, Tsun-Yee Yan:
A Multiple-Channel Free-Access Collision Resolution Algorithm Based Connection Request Procedure for Land Mobile Satellite Networks. Int. J. Satell. Commun. Netw. 14(4): 313-325 (1996) - [j14]Harry H. Tan, Kuang Tsai:
Packet output processes of CSMA and CSMA/CD protocols. IEEE Trans. Commun. 44(4): 464-474 (1996) - 1995
- [c10]Scott K. Walley, Harry H. Tan:
Shortest Paths in Random Weighted Graphs. COCOON 1995: 213-222 - 1994
- [c9]Chung G. Chang, Harry H. Tan:
Queueing Analysis of Explicit Policy Assignmant Push-Out Buffer Sharing Schemes for ATM Networks. INFOCOM 1994: 500-509 - [c8]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. INFOCOM 1994: 618-627 - 1993
- [c7]Chung Gu Kang, Harry H. Tan:
Queueing Analysis of Explicit Priority Assignment Partial Buffer Sharing Schemes for ATM Networks. INFOCOM 1993: 810-819 - [c6]Scott K. Walley, Harry H. Tan, Audrey M. Viterbi:
Shortest Path Cost Distribution in Random Graphs with Positive Integer Edge Costs. INFOCOM 1993: 1023-1032 - 1991
- [c5]Santiago V. Hung, Harry H. Tan:
Performance Analysis of Slotted Replication ALOHA Over Fading Communications Channels. INFOCOM 1991: 228-236 - [c4]Kuang Tsai, Harry H. Tan:
Stability Analysis for Persistent CSMA/CD Systems. INFOCOM 1991: 1316-1325 - 1990
- [c3]Harry H. Tan, Santiago V. Hung:
Performance Analysis of Slotted ALOHA Over Fading Communications Channels. INFOCOM 1990: 595-602 - [c2]Kuang Tsai, Harry H. Tan:
Common Channel Priority Acknowledgement Schemes for Carrier Sense Cable Systems. INFOCOM 1990: 1196-1203
1980 – 1989
- 1989
- [c1]Harry H. Tan, Tsun-Yee Yan:
A New Free-Access Collision Resolution Algorithm Based Connection Request Procedure for Land Mobile Satellite Systems. INFOCOM 1989: 1057-1062 - 1987
- [j13]Gee L. Lui, Harry H. Tan:
On Joint Symbol and Frame Synchronization for Direct-Detection Optical Communication Systems. IEEE Trans. Commun. 35(2): 250-255 (1987) - [j12]Gee L. Lui, Harry H. Tan:
Frame Synchronization for Gaussian Channels. IEEE Trans. Commun. 35(8): 818-829 (1987) - 1986
- [j11]Gee L. Lui, Harry H. Tan:
Frame Synchronization for Direct-Detection Optical Communication Systems. IEEE Trans. Commun. 34(3): 227-237 (1986) - 1980
- [j10]Harry H. Tan:
Two-User Interference Channels With Correlated Information Sources. Inf. Control. 44(1): 77-104 (1980)
1970 – 1979
- 1978
- [j9]William J. Leighton III, Harry H. Tan:
Trellis Coding for Degraded Broadcast Channels. Inf. Control. 39(2): 119-134 (1978) - [j8]Kung Yao, Harry H. Tan:
Absolute error rate-distortion functions for sources with constrained magnitudes (Corresp.). IEEE Trans. Inf. Theory 24(4): 499-503 (1978) - 1977
- [j7]William J. Leighton III, Harry H. Tan:
Capacity region of degraded broadcast channels with feedback. Inf. Sci. 13(2): 167-177 (1977) - 1976
- [j6]Harry H. Tan:
Tree coding of discrete-time abstract alphabet stationary block-ergodic sources with a fidelity criterion. IEEE Trans. Inf. Theory 22(6): 671-681 (1976) - 1975
- [j5]Harry H. Tan, Kung Yao:
Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources. Inf. Control. 27(3): 272-288 (1975) - [j4]Harry H. Tan:
Block Coding for Stationary Gaussian Sources with Memory Under a Square-Error Fidelity Criterion. Inf. Control. 29(1): 11-28 (1975) - [j3]Harry H. Tan, Kung Yao:
Evaluation of rate-distortion functions for a class of independent identically distributed sources under an absolute-magnitude criterion. IEEE Trans. Inf. Theory 21(1): 59-64 (1975) - [j2]Harry H. Tan:
Convergence of distortion for block coding of symmetric modular sources (Corresp.). IEEE Trans. Inf. Theory 21(4): 469-472 (1975) - 1973
- [j1]Kung Yao, Harry H. Tan:
Some comments on the generalized Shannon lower bound for stationary finite-alphabet sources with memory (Corresp.). IEEE Trans. Inf. Theory 19(6): 815-817 (1973)
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-04-25 05:58 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:
