On 3-colorings of E(Kn). - Jeong Han Kim (Discret. Math., 1993)

On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches. - Jeong Han Kim; James R. Roche (COLT, 1995)

On Brooks' Theorem for Sparse Graphs. - Jeong Han Kim (Comb. Probab. Comput., 1995)

Entropy and Sorting. - Jeff Kahn 001; Jeong Han Kim (J. Comput. Syst. Sci., 1995)

The Ramsey Number R(3, t) Has Order of Magnitude t2/log t. - Jeong Han Kim (Random Struct. Algorithms, 1995)

On Increasing Subsequences of Random Permutations. - Jeong Han Kim (J. Comb. Theory A, 1996)

On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. - Noga Alon; Jeong Han Kim (J. Comb. Theory A, 1997)

Score certificates for tournaments. - Jeong Han Kim; Prasad Tetali; Peter C. Fishburn (J. Graph Theory, 1997)

Random Matchings in Regular Graphs. - Jeff Kahn 001; Jeong Han Kim (Comb., 1998)

Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks. - Jeong Han Kim; James R. Roche (J. Comput. Syst. Sci., 1998)

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 (FOCS, 1999)

Limits on the Efficiency of One-Way Permutation-Based Hash Functions. - Jeong Han Kim; Daniel R. Simon; Prasad Tetali (FOCS, 1999)

The Cover Time, the Blanket Time, and the Matthews Bound. - Jeff Kahn 001; Jeong Han Kim; László Lovász 001; Van H. Vu (FOCS, 2000)

Concentration of Multivariate Polynomials and Its Applications. - Jeong Han Kim; Van H. Vu (Comb., 2000)

Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. - Jeong Han Kim; Boris G. Pittel (J. Comb. Theory A, 2000)

On Tail Distribution of Interpost Distance. - Jeong Han Kim; Boris G. Pittel (J. Comb. Theory B, 2000)

Nearly Optimal Partial Steiner Systems. - Jeong Han Kim (Electron. Notes Discret. Math., 2001)

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. - Jeong Han Kim; Nicholas C. Wormald (J. Comb. Theory B, 2001)

Large Deviations for Small Buffers: An Insensitivity Result. - Michel Mandjes; Jeong Han Kim (Queueing Syst. Theory Appl., 2001)

The scaling window of the 2-SAT transition. - Béla Bollobás; Christian Borgs; Jennifer T. Chayes; Jeong Han Kim; David Bruce Wilson (Random Struct. Algorithms, 2001)

Permutation Pseudographs And Contiguity. - Catherine S. Greenhill; Svante Janson; Jeong Han Kim; Nicholas C. Wormald (Comb. Probab. Comput., 2002)

Two-coloring random hypergraphs. - Dimitris Achlioptas; Jeong Han Kim; Michael Krivelevich; Prasad Tetali (Random Struct. Algorithms, 2002)

On the asymmetry of random regular graphs and random graphs. - Jeong Han Kim; Benny Sudakov; Van H. Vu (Random Struct. Algorithms, 2002)

Small Complete Arcs in Projective Planes. - Jeong Han Kim; Van H. Vu (Comb., 2003)

Perfect matchings in random uniform hypergraphs. - Jeong Han Kim (Random Struct. Algorithms, 2003)

The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. - Jeong Han Kim (COCOON, 2004)

Hamiltonian decompositions of random bipartite regular graphs. - Catherine S. Greenhill; Jeong Han Kim; Nicholas C. Wormald (J. Comb. Theory B, 2004)

Divide and conquer martingales and the number of triangles in a random graph. - Jeong Han Kim; Van H. Vu (Random Struct. Algorithms, 2004)

Oblivious routing in directed graphs with random demands. - Mohammad Taghi Hajiaghayi; Jeong Han Kim; Tom Leighton; Harald Räcke (STOC, 2005)

Discrepancy After Adding A Single Set. - Jeong Han Kim; Jirí Matousek 001; Van H. Vu (Comb., 2005)

How complex are random graphs in first order logic? - Jeong Han Kim; Oleg Pikhurko; Joel H. Spencer; Oleg Verbitsky 001 (Random Struct. Algorithms, 2005)

Witnesses for non-satisfiability of dense random 3CNF formulas. - Uriel Feige; Jeong Han Kim; Eran Ofek (FOCS, 2006)

Generating Random Regular Graphs. - Jeong Han Kim; Van H. Vu (Comb., 2006)

A phase transition for avoiding a giant component. - Tom Bohman; Jeong Han Kim (Random Struct. Algorithms, 2006)

Regular subgraphs of random graphs. - Béla Bollobás; Jeong Han Kim; Jacques Verstraëte (Random Struct. Algorithms, 2006)

Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. - Jeong Han Kim; Ravi Montenegro; Prasad Tetali (FOCS, 2007)

Small subgraphs of random regular graphs. - Jeong Han Kim; Benny Sudakov; Van H. Vu (Discret. Math., 2007)

A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. - Jeong Han Kim; Ravi Montenegro; Yuval Peres; Prasad Tetali (ANTS, 2008)

Phase transition in a random NK landscape model. - Sung-Soon Choi; Kyomin Jung; Jeong Han Kim (Artif. Intell., 2008)

Finding cores of random 2-SAT formulae via Poisson cloning - Jeong Han Kim (CoRR, 2008)

Optimal query complexity bounds for finding graphs. - Sung-Soon Choi; Jeong Han Kim (Artif. Intell., 2010)

A Sequential Algorithm for Generating Random Graphs. - Mohsen Bayati; Jeong Han Kim; Amin Saberi (Algorithmica, 2010)

Diameters in Supercritical Random Graphs Via First Passage Percolation. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Comb. Probab. Comput., 2010)

Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions. - Sung-Soon Choi; Kyomin Jung; Jeong Han Kim (J. Comput. Syst. Sci., 2011)

Anatomy of a young giant component in the random graph. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Random Struct. Algorithms, 2011)

Finding Weighted Graphs by Combinatorial Search - Jeong Han Kim (CoRR, 2012)

Universality of Random Graphs for Graphs of Maximum Degree Two. - Jeong Han Kim; Sangjune Lee (SIAM J. Discret. Math., 2014)

The BirdMan: hybrid perception. - Jeong Han Kim; Hong-Gee Kim; Hyun-Jean Lee (Digit. Creativity, 2015)

On coupon colorings of graphs. - Bob Chen; Jeong Han Kim; Michael Tait; Jacques Verstraëte (Discret. Appl. Math., 2015)

Some advances on Sidorenko's conjecture. - David Conlon; Jeong Han Kim; Choongbum Lee; Joonkyung Lee (J. Lond. Math. Soc., 2018)

On the total variation distance between the binomial random graph and the random intersection graph. - Jeong Han Kim; Sang June Lee; Joohan Na (Random Struct. Algorithms, 2018)

Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates. - Jung Hee Cheon; Wonhee Cho 001; Jeong Han Kim; Jiseung Kim 001 (IACR Cryptol. ePrint Arch., 2020)

Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions. - Jung Hee Cheon; Wonhee Cho 001; Jeong Han Kim; Jiseung Kim 001 (Public Key Cryptography (2), 2021)

Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions. - Jung Hee Cheon; Wonhee Cho 001; Jeong Han Kim; Jiseung Kim 001 (Des. Codes Cryptogr., 2022)

Threshold functions for incidence properties in finite vector spaces. - Jeong Han Kim; Ben Lund 002; Thang Pham; Semin Yoo (Finite Fields Their Appl., 2023)

Amortized efficient zk-SNARK from linear-only RLWE encodings. - Heewon Chung; Dongwoo Kim 003; Jeong Han Kim; Jiseung Kim 001 (J. Commun. Networks, 2023)

Majority dynamics on sparse random graphs. - Debsoumya Chakraborti; Jeong Han Kim; Joonkyung Lee; Tuan Tran (Random Struct. Algorithms, 2023)

A new density limit for unanimity in majority dynamics on random graphs. - Jeong Han Kim; BaoLinh Tran (CoRR, 2025)