Tag Gon Kim

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 Jung Hyun Ahn

> Home > Persons > Tag Gon Kim

Publications

2012
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/simulation/AhnSK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/simulation/AhnSK12
Jung Hyun Ahn, Chang Ho Sung, Tag Gon Kim:
A binary partition-based matching algorithm for Data Distribution Management in a High-level Architecture-based distributed simulation. Simul. 88(11): 1350-1367 (2012)
2011
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/wsc/AhnSK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wsc/AhnSK11
Jung Hyun Ahn, Chang Ho Sung, Tag Gon Kim:
A binary partition-based matching algorithm for data distribution management. WSC 2011: 2728-2739
2010
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/dsrt/AhnSSK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dsrt/AhnSSK10
Jung Hyun Ahn, Moon Gi Seok, Chang Ho Sung, Tag Gon Kim:
Hierarchical Federation Composition for Information Hiding in HLA-Based Distributed Simulation. DS-RT 2010: 223-226
2007
[c20]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/scsc/AhnKK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/scsc/AhnKK07
Jung Hyun Ahn, Jae-Hyun Kim, Tag Gon Kim:
Design and implementation of data distribution management in IEEE 1516 HLA/RTI. SCSC 2007: 386-391

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.