Jeong Han 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 Kyomin Jung

> Home > Persons > Jeong Han Kim

Publications

2011
[j35]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/ChoiJK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/ChoiJK11
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions. J. Comput. Syst. Sci. 77(6): 1039-1053 (2011)
2008
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/ai/ChoiJK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/ChoiJK08
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Phase transition in a random NK landscape model. Artif. Intell. 172(2-3): 179-203 (2008)
[c15]
- view
  - electronic edition @ helsinki.fi (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/colt/ChoiJK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/ChoiJK08
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. COLT 2008: 123-134
2005
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/gecco/ChoiJK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/ChoiJK05
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Phase transition in a random NK landscape model. GECCO 2005: 1241-1248

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.