Jeong Han Kim

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 8

Top Topics

Total Variation

Phase Transition

Threshold Functions

Top Venues

Random Struct. Algorithms

Des. Codes Cryptogr.

Digit. Creativity

IACR Cryptol. ePrint Arch.

Publications

Heewon Chung, Dongwoo Kim, Jeong Han Kim, Jiseung Kim
Amortized efficient zk-SNARK from linear-only RLWE encodings. J. Commun. Networks 25 (3) (2023)
Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran
Majority dynamics on sparse random graphs. Random Struct. Algorithms 63 (1) (2023)
Jeong Han Kim, Ben Lund, Thang Pham, Semin Yoo
Threshold functions for incidence properties in finite vector spaces. Finite Fields Their Appl. 87 (2023)
Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions. Des. Codes Cryptogr. 90 (8) (2022)
Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim
Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions. Public Key Cryptography (2) (2021)
Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim
Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates. IACR Cryptol. ePrint Arch. 2020 (2020)
Jeong Han Kim, Sang June Lee, Joohan Na
On the total variation distance between the binomial random graph and the random intersection graph. Random Struct. Algorithms 52 (4) (2018)
David Conlon, Jeong Han Kim, Choongbum Lee, Joonkyung Lee
Some advances on Sidorenko's conjecture. J. Lond. Math. Soc. 98 (3) (2018)
Jeong Han Kim, Hong-Gee Kim, Hyun-Jean Lee
The BirdMan: hybrid perception. Digit. Creativity 26 (1) (2015)
Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte
On coupon colorings of graphs. Discret. Appl. Math. 193 (2015)
Jeong Han Kim, Sangjune Lee
Universality of Random Graphs for Graphs of Maximum Degree Two. SIAM J. Discret. Math. 28 (3) (2014)
Jeong Han Kim
Finding Weighted Graphs by Combinatorial Search CoRR (2012)
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres
Anatomy of a young giant component in the random graph. Random Struct. Algorithms 39 (2) (2011)
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) (2011)
Mohsen Bayati, Jeong Han Kim, Amin Saberi
A Sequential Algorithm for Generating Random Graphs. Algorithmica 58 (4) (2010)
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19 (5-6) (2010)
Sung-Soon Choi, Jeong Han Kim
Optimal query complexity bounds for finding graphs. Artif. Intell. 174 (9-10) (2010)
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. COLT (2008)
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
Phase transition in a random NK landscape model. Artif. Intell. 172 (2-3) (2008)
Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS (2008)
Sung-Soon Choi, Jeong Han Kim
Optimal query complexity bounds for finding graphs. STOC (2008)
Jeong Han Kim
Finding cores of random 2-SAT formulae via Poisson cloning CoRR (2008)
Mohsen Bayati, Jeong Han Kim, Amin Saberi
A Sequential Algorithm for Generating Random Graphs CoRR (2007)
Jeong Han Kim, Ravi Montenegro, Prasad Tetali
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS (2007)
Jeong Han Kim, Benny Sudakov, Van H. Vu
Small subgraphs of random regular graphs. Discret. Math. 307 (15) (2007)
Mohsen Bayati, Jeong Han Kim, Amin Saberi
A Sequential Algorithm for Generating Random Graphs. APPROX-RANDOM (2007)
Jeong Han Kim, Van H. Vu
Generating Random Regular Graphs. Comb. 26 (6) (2006)
Béla Bollobás, Jeong Han Kim, Jacques Verstraëte
Regular subgraphs of random graphs. Random Struct. Algorithms 29 (1) (2006)
Tom Bohman, Jeong Han Kim
A phase transition for avoiding a giant component. Random Struct. Algorithms 28 (2) (2006)
Uriel Feige, Jeong Han Kim, Eran Ofek
Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS (2006)
Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky
How complex are random graphs in first order logic? Random Struct. Algorithms 26 (1-2) (2005)
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke
Oblivious routing in directed graphs with random demands. STOC (2005)
Jeong Han Kim, Jirí Matousek, Van H. Vu
Discrepancy After Adding A Single Set. Comb. 25 (4) (2005)
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
Phase transition in a random NK landscape model. GECCO (2005)
Jeong Han Kim
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. COCOON (2004)
Jeong Han Kim, Van H. Vu
Divide and conquer martingales and the number of triangles in a random graph. Random Struct. Algorithms 24 (2) (2004)
Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory, Ser. B 90 (2) (2004)
Jeong Han Kim, Van H. Vu
Small Complete Arcs in Projective Planes. Comb. 23 (2) (2003)
Jeong Han Kim, Van H. Vu
Generating random regular graphs. STOC (2003)
Jeong Han Kim
Perfect matchings in random uniform hypergraphs. Random Struct. Algorithms 23 (2) (2003)
Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11 (3) (2002)
Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
Two-coloring random hypergraphs. Random Struct. Algorithms 20 (2) (2002)
Jeong Han Kim, Benny Sudakov, Van H. Vu
On the asymmetry of random regular graphs and random graphs. Random Struct. Algorithms 21 (3-4) (2002)
Jeong Han Kim
Nearly Optimal Partial Steiner Systems. Electron. Notes Discret. Math. 7 (2001)
Michel Mandjes, Jeong Han Kim
Large Deviations for Small Buffers: An Insensitivity Result. Queueing Syst. Theory Appl. 37 (4) (2001)
Jeong Han Kim, Nicholas C. Wormald
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. J. Comb. Theory, Ser. B 81 (1) (2001)
Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson
The scaling window of the 2-SAT transition. Random Struct. Algorithms 18 (3) (2001)
Jeong Han Kim, Boris G. Pittel
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. J. Comb. Theory, Ser. A 92 (2) (2000)
Jeong Han Kim, Van H. Vu
Concentration of Multivariate Polynomials and Its Applications. Comb. 20 (3) (2000)
Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
Two-coloring Random Hypergraphs. ICALP Satellite Workshops (2000)
Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
The Cover Time, the Blanket Time, and the Matthews Bound. FOCS (2000)
Jeong Han Kim, Boris G. Pittel
On Tail Distribution of Interpost Distance. J. Comb. Theory, Ser. B 80 (1) (2000)
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS (1999)
Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS (1999)
Jeong Han Kim, James R. Roche
Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks. J. Comput. Syst. Sci. 56 (2) (1998)
Jeff Kahn, Jeong Han Kim
Random Matchings in Regular Graphs. Comb. 18 (2) (1998)
Noga Alon, Jeong Han Kim
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. J. Comb. Theory, Ser. A 77 (1) (1997)
Jeong Han Kim, Prasad Tetali, Peter C. Fishburn
Score certificates for tournaments. J. Graph Theory 24 (2) (1997)
Jeong Han Kim
On Increasing Subsequences of Random Permutations. J. Comb. Theory, Ser. A 76 (1) (1996)
Jeff Kahn, Jeong Han Kim
Entropy and Sorting. J. Comput. Syst. Sci. 51 (3) (1995)
Jeong Han Kim
On Brooks' Theorem for Sparse Graphs. Comb. Probab. Comput. 4 (1995)
Jeong Han Kim, James R. Roche
On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches. COLT (1995)
Jeong Han Kim
/log t. Random Struct. Algorithms 7 (3) (1995)
Jeong Han Kim
). Discret. Math. 118 (1-3) (1993)
Jeff Kahn, Jeong Han Kim
Entropy and Sorting STOC (1992)