Eui-Seok Hwang

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 You-Chang Ko

> Home > Persons > Eui-Seok Hwang

Publications

2006
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icoin/HwangKCLR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icoin/HwangKCLR06
Eui-Seok Hwang, You-Chang Ko, Choong-Ho Cho, Hyong-Woo Lee, Sumit Roy:
Open and Association MCTAs Access and Allocation Scheme by Staggering Algorithm in IEEE 802.15.3. ICOIN 2006: 493-501
2005
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/wwic/KoHWLC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wwic/KoHWLC05
You-Chang Ko, Eui-Seok Hwang, Jeong-Jae Won, Hyong-Woo Lee, Choong-Ho Cho:
Collision Reduction Random Access Using m-Ary Split Algorithm in Wireless Access Network. WWIC 2005: 223-233
2004
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/ifip6-8/KoHDLC04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip6-8/KoHDLC04
You-Chang Ko, Eui-Seok Hwang, Jeong-Shik Dong, Hyong-Woo Lee, Choong-Ho Cho:
Throughput Analysis of ETSI BRAN HIPERLAN/2 MAC Protocol Taking Guard Timing Spaces into Consideration. PWC 2004: 204-214
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/pcm/HwangWKLC04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pcm/HwangWKLC04
Eui-Seok Hwang, Jeong-Jae Won, You-Chang Ko, Hyong-Woo Lee, Choong-Ho Cho:
Random Channel Allocation Scheme in HIPERLAN/2. PCM (1) 2004: 25-32

a service of

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.