| 2021 | PKC | Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions. | Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim |
| 2008 | COLT | Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. | Sung-Soon Choi, Kyomin Jung, Jeong Han Kim |
| 2008 | STOC | Optimal query complexity bounds for finding graphs. | Sung-Soon Choi, Jeong Han Kim |
| 2007 | FOCS | Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. | Jeong Han Kim, Ravi Montenegro, Prasad Tetali |
| 2006 | FOCS | Witnesses for non-satisfiability of dense random 3CNF formulas. | Uriel Feige, Jeong Han Kim, Eran Ofek |
| 2005 | GECCO | Phase transition in a random NK landscape model. | Sung-Soon Choi, Kyomin Jung, Jeong Han Kim |
| 2005 | STOC | Oblivious routing in directed graphs with random demands. | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Rcke |
| 2004 | COCOON | The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. | Jeong Han Kim |
| 2003 | STOC | Generating random regular graphs. | Jeong Han Kim, Van H. Vu |
| 2000 | FOCS | The Cover Time, the Blanket Time, and the Matthews Bound. | Jeff Kahn, Jeong Han Kim, Lszl Lovsz, Van H. Vu |
| 2000 | ICALP | Two-coloring Random Hypergraphs. | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
| 1999 | FOCS | Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. | Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu |
| 1999 | FOCS | Limits on the Efficiency of One-Way Permutation-Based Hash Functions. | Jeong Han Kim, Daniel R. Simon, Prasad Tetali |
| 1995 | COLT | On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches. | Jeong Han Kim, James R. Roche |
| 1992 | STOC | Entropy and Sorting | Jeff Kahn, Jeong Han Kim |