Jeong Han Kim | Academic Influence

Jeong Han Kim's AcademicInfluence.com Rankings

Jeong Han Kim

Mathematics

#2316

World Rank

#3595

Historical Rank

Group Theory

#380

World Rank

#436

Historical Rank

Number Theory

#436

World Rank

#538

Historical Rank

Algebra

#741

World Rank

#967

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Jeong Han Kim's Degrees

PhD Mathematics Seoul National University
Masters Mathematics Seoul National University
Bachelors Mathematics Seoul National University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Jeong Han Kim Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeong Han Kim is a South Korean mathematician. He studied physics and mathematical physics at Yonsei University, and earned his Ph.D. in mathematics at Rutgers University. He was a researcher at AT&T Bell Labs and at Microsoft Research, and was Underwood Chair Professor of Mathematics at Yonsei University. He is currently a Professor of the School of Computational Sciences at the Korea Institute for Advanced Study.

(See a Problem?)

Jeong Han Kim's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Ramsey Number R(3, t) Has Order of Magnitude t2/log t (1995) (366)
The scaling window of the 2‐SAT transition (1999) (206)
Concentration of Multivariate Polynomials and Its Applications (2000) (184)
Generating Random Regular Graphs (2003) (144)
A Sequential Algorithm for Generating Random Graphs (2007) (141)
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics (1999) (113)
On Brooks' Theorem for Sparse Graphs (1995) (112)
Nearly perfect matchings in regular simple hypergraphs (1997) (99)
Entropy and sorting (1992) (86)
Poisson Cloning Model for Random Graphs (2008) (82)
On the asymmetry of random regular graphs and random graphs (2002) (82)
Divide and conquer martingales and the number of triangles in a random graph (2004) (80)
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs (2001) (69)
Limits on the efficiency of one-way permutation-based hash functions (1999) (68)
Large Deviations for Small Buffers: An Insensitivity Result (2001) (65)
Small Complete Arcs in Projective Planes (2003) (62)
Two Approaches to Sidorenko's Conjecture (2013) (62)
Some advances on Sidorenko's conjecture (2015) (59)
Witnesses for non-satisfiability of dense random 3CNF formulas (2006) (58)
The cover time, the blanket time, and the Matthews bound (2000) (52)
Optimal query complexity bounds for finding graphs (2008) (52)
Anatomy of a young giant component in the random graph (2009) (51)
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm (2007) (41)
Small subgraphs of random regular graphs (2007) (37)
Diameters in Supercritical Random Graphs Via First Passage Percolation (2009) (37)
Permutation Pseudographs and Contiguity (2002) (31)
On Increasing Subsequences of Random Permutations (1996) (31)
How complex are random graphs in first order logic? (2004) (29)
Perfect matchings in random uniform hypergraphs (2003) (29)
On coupon colorings of graphs (2014) (29)
Oblivious routing in directed graphs with random demands (2005) (27)
Two‐coloring random hypergraphs (2002) (26)
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log (2006) (26)
A phase transition for avoiding a giant component (2006) (26)
Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks (1998) (24)
Universality of Random Graphs for Graphs of Maximum Degree Two (2013) (20)
Poisson Cloning Model for Random Graph (2004) (18)
Random Matchings in Regular Graphs (1998) (17)
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions (2008) (16)
Regular subgraphs of random graphs (2006) (13)
Tail bound for the minimal spanning tree of a complete graph (2003) (12)
Two-coloring random hypergraphs (2002) (12)
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph (1997) (12)
Phase transition in a random NK landscape model (2005) (11)
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number (2000) (11)
On Tail Distribution of Interpost Distance (2000) (10)
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems (2004) (9)
Hamiltonian decompositions of random bipartite regular graphs (2004) (8)
Sidorenko's conjecture for higher tree decompositions (2018) (7)
Nearly Optimal Partial Steiner Systems (2001) (7)
Discrepancy After Adding A Single Set (2005) (7)
Finding cores of random 2-SAT formulae via Poisson cloning (2008) (6)
On the total variation distance between the binomial random graph and the random intersection graph (2015) (6)
Score certificates for tournaments (1997) (5)
On a phase transition of the random intersection graph: Supercritical region (2015) (5)
Finding Weighted Graphs by Combinatorial Search (2012) (4)
Economical Covers with Geometric Applications (2003) (3)
Majority dynamics on sparse random graphs (2021) (3)
Linear Operators That Preserve the Genus of a Graph (2019) (3)
Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions (2021) (3)
On the optimal capacity of binary neural networks: rigorous combinatorial approaches (1995) (2)
A Near Optimal Bound for Pollard's Rho to Solve Discrete Log (2006) (1)
On 3-colorings of E(Kn) (1993) (1)
Non-combinatorial approaches to two combinatorial problems (1993) (0)
[20]J.Spencer,AsymptoticLowerBoundsforRamseyFunctions, Discrete (0)
Tight Bounds For Random MAX 2-SAT (2006) (0)
2 ON TAIL DISTRIBUTION OF INTERPOST DISTANCE (1999) (0)
Scaling windows in the Random 2-SAT Problem (2001) (0)
Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates (2020) (0)
Threshold functions for incidence properties in finite vector spaces (2022) (0)
Degrees, sizes and chromatic indices of uniform hypergraphs (2002) (0)
Poisson Cloning Model for Random Graphs Extended Abstract (2010) (0)
Giant Component and Poisson Cloning Model (2015) (0)

This paper list is powered by the following services:

Other Resources About Jeong Han Kim

en.wikipedia.org

What Schools Are Affiliated With Jeong Han Kim?

Jeong Han Kim is affiliated with the following schools: