Injong Rhee

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Do Young Eun

> Home > Persons > Injong Rhee

Publications

2009
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/cn/CaiEHRX09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cn/CaiEHRX09
Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, Lisong Xu:
Stochastic convex ordering for multiplicative decrease internet congestion control. Comput. Networks 53(3): 365-381 (2009)
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/twc/WonCEGNRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/twc/WonCEGNRS09
Hyungsuk Won, Han Cai, Do Young Eun, Katherine Guo, Arun N. Netravali, Injong Rhee, Krishan K. Sabnani:
Multicast scheduling in cellular data networks. IEEE Trans. Wirel. Commun. 8(9): 4540-4549 (2009)
2007
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/CaiEHRX07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/CaiEHRX07
Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, Lisong Xu:
Stochastic Ordering for Internet Congestion Control and its Applications. INFOCOM 2007: 910-918
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/WonCEGNRS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/WonCEGNRS07
Hyungsuk Won, Han Cai, Do Young Eun, Katherine Guo, Arun N. Netravali, Injong Rhee, Krishan K. Sabnani:
Multicast Scheduling in Cellular Data Networks. INFOCOM 2007: 1172-1180

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.