default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames R. Yee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j9]James R. Yee:
On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal? Int. Trans. Oper. Res. 13(3): 177-194 (2006)
1990 – 1999
- 1995
- [j8]Ming-Jeng Lee, James R. Yee:
A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks. Oper. Res. 43(1): 102-116 (1995) - [j7]James R. Yee, Edward J. Weldon Jr.:
Evaluation of the performance of error-correcting codes on a Gilbert channel. IEEE Trans. Commun. 43(8): 2316-2323 (1995) - [c10]James R. Yee, N. Thomas Gaarder:
Maximal Average Loss Rates for a Single GPS Server System with Finite Buffers. INFOCOM 1995: 1120-1128 - 1994
- [j6]Ming-Jeng Lee, James R. Yee:
An algorithm for optimal minimax routing in ATM networks. Ann. Oper. Res. 49(1): 185-206 (1994) - [j5]Song-Chyau Liang, James R. Yee:
Locating internet gateways to minimize nonlinear congestion costs. IEEE Trans. Commun. 42(9): 2740-2750 (1994) - 1993
- [j4]Ming-Jeng Lee, James R. Yee:
A design algorithm for reconfigurable ATM networks. Telecommun. Syst. 2(1): 197-224 (1993) - [c9]Ming-Jeng Lee, James R. Yee:
A Design Algorithm for Reconfigurable ATM Networks. INFOCOM 1993: 144-151 - [c8]Frank Yeong-Sung Lin, James R. Yee:
A Real-Time Distributed Routing and Admission Control Algorithm for ATM Networks. INFOCOM 1993: 792-801 - 1992
- [j3]Frank Yeong-Sung Lin, James R. Yee:
A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks. INFORMS J. Comput. 4(3): 250-266 (1992) - [j2]James R. Yee, Frank Yeong-Sung Lin:
A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair. Networks 22(2): 185-208 (1992) - [c7]James R. Yee, Ming-Jeng Lee:
A Convergence Proof for an Iterative Method for ATM Networks. INFOCOM 1992: 2472-2481 - 1990
- [j1]James N. Eagle, James R. Yee:
An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem. Oper. Res. 38(1): 110-114 (1990) - [c6]James R. Yee, Feng-Min Shiao:
On Calculating High Throughputs in Multi-Hop Slotted ALOHA Packet Radio Networks. INFOCOM 1990: 382-388
1980 – 1989
- 1989
- [c5]Ming-Jeng Lee, James R. Yee:
An Efficient Near-Optimal Algorithm for the Joint Traffic and Trunk Routing Problem in Self-Planning Networks. INFOCOM 1989: 127-135 - [c4]Frank Yeong-Sung Lin, James R. Yee:
A Distributed Routing Algorithm for Virtual Circuit Data Networks. INFOCOM 1989: 200-207 - [c3]Song-Chyau Liang, James R. Yee:
A Gateway Allocation Algorithm for Interconnecting Existing Data Networks. INFOCOM 1989: 468-473 - 1988
- [c2]Hwa-Chun Lin, James R. Yee, Cauligi S. Raghavendra:
Optimal joint load balancing and routing in message switched computer networks. INFOCOM 1988: 274-281
1970 – 1979
- 1978
- [c1]James R. Yee:
On Bounding Distributions For Stochastic Networks. ACM Annual Conference (1) 1978: 462-466
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-24 23:01 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:
