Jeong Han Kim

Orcid: 0000-0002-2437-5793

Affiliations:

Microsoft Research

According to our database¹, Jeong Han Kim authored at least 57 papers between 1993 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Majority dynamics on sparse random graphs.

[BibT_eX]

[DOI]

Debsoumya Chakraborti

Jeong Han Kim

Joonkyung Lee

Tuan Tran

Random Struct. Algorithms, August, 2023

Amortized efficient zk-SNARK from linear-only RLWE encodings.

[BibT_eX]

[DOI]

J. Commun. Networks, June, 2023

Threshold functions for incidence properties in finite vector spaces.

[BibT_eX]

[DOI]

Finite Fields Their Appl., March, 2023

2022

Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

2021

Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2021, 2021

2020

Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2018

On the total variation distance between the binomial random graph and the random intersection graph.

[BibT_eX]

[DOI]

Jeong Han Kim

Sang June Lee

Joohan Na

Random Struct. Algorithms, 2018

Some advances on Sidorenko's conjecture.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2018

2015

On coupon colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The BirdMan: hybrid perception.

[BibT_eX]

[DOI]

Jeong Han Kim

Hong-Gee Kim

Hyun-Jean Lee

Digit. Creativity, 2015

2014

Universality of Random Graphs for Graphs of Maximum Degree Two.

[BibT_eX]

[DOI]

Jeong Han Kim

Sangjune Lee

SIAM J. Discret. Math., 2014

2012

Finding Weighted Graphs by Combinatorial Search

[BibT_eX]

[DOI]

Jeong Han Kim

CoRR, 2012

2011

Anatomy of a young giant component in the random graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions.

[BibT_eX]

[DOI]

Sung-Soon Choi

Kyomin Jung

Jeong Han Kim

J. Comput. Syst. Sci., 2011

2010

Diameters in Supercritical Random Graphs Via First Passage Percolation.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

A Sequential Algorithm for Generating Random Graphs.

[BibT_eX]

[DOI]

Mohsen Bayati

Jeong Han Kim

Amin Saberi

Algorithmica, 2010

Optimal query complexity bounds for finding graphs.

[BibT_eX]

[DOI]

Sung-Soon Choi

Jeong Han Kim

Artif. Intell., 2010

2008

Finding cores of random 2-SAT formulae via Poisson cloning

[BibT_eX]

[DOI]

Jeong Han Kim

CoRR, 2008

Phase transition in a random NK landscape model.

[BibT_eX]

[DOI]

Sung-Soon Choi

Kyomin Jung

Jeong Han Kim

Artif. Intell., 2008

A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

Small subgraphs of random regular graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Benny Sudakov

Van H. Vu

Discret. Math., 2007

Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.

[BibT_eX]

[DOI]

Jeong Han Kim

Ravi Montenegro

Prasad Tetali

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Béla Bollobás

Jeong Han Kim

Jacques Verstraëte

Random Struct. Algorithms, 2006

A phase transition for avoiding a giant component.

[BibT_eX]

[DOI]

Tom Bohman

Jeong Han Kim

Random Struct. Algorithms, 2006

Generating Random Regular Graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Van H. Vu

Comb., 2006

Witnesses for non-satisfiability of dense random 3CNF formulas.

[BibT_eX]

[DOI]

Uriel Feige

Jeong Han Kim

Eran Ofek

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

How complex are random graphs in first order logic?

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

Discrepancy After Adding A Single Set.

[BibT_eX]

[DOI]

Jeong Han Kim

Jirí Matousek

Van H. Vu

Comb., 2005

Oblivious routing in directed graphs with random demands.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Jeong Han Kim

Tom Leighton

Harald Räcke

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Divide and conquer martingales and the number of triangles in a random graph.

[BibT_eX]

[DOI]

Jeong Han Kim

Van H. Vu

Random Struct. Algorithms, 2004

Hamiltonian decompositions of random bipartite regular graphs.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Jeong Han Kim

Nicholas C. Wormald

J. Comb. Theory B, 2004

The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems.

[BibT_eX]

[DOI]

Jeong Han Kim

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Perfect matchings in random uniform hypergraphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Random Struct. Algorithms, 2003

Small Complete Arcs in Projective Planes.

[BibT_eX]

[DOI]

Jeong Han Kim

Van H. Vu

Comb., 2003

2002

On the asymmetry of random regular graphs and random graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Benny Sudakov

Van H. Vu

Random Struct. Algorithms, 2002

Two-coloring random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Permutation Pseudographs And Contiguity.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Svante Janson

Jeong Han Kim

Nicholas C. Wormald

Comb. Probab. Comput., 2002

2001

The scaling window of the 2-SAT transition.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Large Deviations for Small Buffers: An Insensitivity Result.

[BibT_eX]

[DOI]

Michel Mandjes

Jeong Han Kim

Queueing Syst. Theory Appl., 2001

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Nicholas C. Wormald

J. Comb. Theory B, 2001

Nearly Optimal Partial Steiner Systems.

[BibT_eX]

[DOI]

Jeong Han Kim

Electron. Notes Discret. Math., 2001

2000

On Tail Distribution of Interpost Distance.

[BibT_eX]

[DOI]

Jeong Han Kim

Boris G. Pittel

J. Comb. Theory B, 2000

Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number.

[BibT_eX]

[DOI]

Jeong Han Kim

Boris G. Pittel

J. Comb. Theory A, 2000

Concentration of Multivariate Polynomials and Its Applications.

[BibT_eX]

[DOI]

Jeong Han Kim

Van H. Vu

Comb., 2000

The Cover Time, the Blanket Time, and the Matthews Bound.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Limits on the Efficiency of One-Way Permutation-Based Hash Functions.

[BibT_eX]

[DOI]

Jeong Han Kim

Daniel R. Simon

Prasad Tetali

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks.

[BibT_eX]

[DOI]

Jeong Han Kim

James R. Roche

J. Comput. Syst. Sci., 1998

Random Matchings in Regular Graphs.

[BibT_eX]

[DOI]

Jeff Kahn

Jeong Han Kim

Comb., 1998

1997

Score certificates for tournaments.

[BibT_eX]

[DOI]

Jeong Han Kim

Prasad Tetali

Peter C. Fishburn

J. Graph Theory, 1997

On the Degree, Size, and Chromatic Index of a Uniform Hypergraph.

[BibT_eX]

[DOI]

Noga Alon

Jeong Han Kim

J. Comb. Theory A, 1997

1996

On Increasing Subsequences of Random Permutations.

[BibT_eX]

[DOI]

Jeong Han Kim

J. Comb. Theory A, 1996

1995

The Ramsey Number R(3, t) Has Order of Magnitude t<sub>2</sub>/log t.

[BibT_eX]

[DOI]

Jeong Han Kim

Random Struct. Algorithms, 1995

Entropy and Sorting.

[BibT_eX]

[DOI]

Jeff Kahn

Jeong Han Kim

J. Comput. Syst. Sci., 1995

On Brooks' Theorem for Sparse Graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Comb. Probab. Comput., 1995

On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches.

[BibT_eX]

[DOI]

Jeong Han Kim

James R. Roche

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1993

On 3-colorings of E(K<sub>n</sub>).

[BibT_eX]

[DOI]

Jeong Han Kim

Discret. Math., 1993

Jeong Han Kim

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...