| 2008 |
|---|
| 42 | EE | 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: 402-415 |
| 41 | EE | Sung-Soon Choi,
Jeong Han Kim:
Optimal query complexity bounds for finding graphs.
STOC 2008: 749-758 |
| 40 | EE | Sung-Soon Choi,
Kyomin Jung,
Jeong Han Kim:
Phase transition in a random NK landscape model.
Artif. Intell. 172(2-3): 179-203 (2008) |
| 2007 |
|---|
| 39 | EE | Mohsen Bayati,
Jeong Han Kim,
Amin Saberi:
A Sequential Algorithm for Generating Random Graphs.
APPROX-RANDOM 2007: 326-340 |
| 38 | EE | Jeong Han Kim,
Ravi Montenegro,
Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.
FOCS 2007: 215-223 |
| 37 | EE | Mohsen Bayati,
Jeong Han Kim,
Amin Saberi:
A Sequential Algorithm for Generating Random Graphs
CoRR abs/cs/0702124: (2007) |
| 36 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
Small subgraphs of random regular graphs.
Discrete Mathematics 307(15): 1961-1967 (2007) |
| 2006 |
|---|
| 35 | EE | Uriel Feige,
Jeong Han Kim,
Eran Ofek:
Witnesses for non-satisfiability of dense random 3CNF formulas.
FOCS 2006: 497-508 |
| 34 | EE | Tom Bohman,
Jeong Han Kim:
A phase transition for avoiding a giant component.
Random Struct. Algorithms 28(2): 195-214 (2006) |
| 33 | EE | Béla Bollobás,
Jeong Han Kim,
Jacques Verstraëte:
Regular subgraphs of random graphs.
Random Struct. Algorithms 29(1): 1-13 (2006) |
| 2005 |
|---|
| 32 | EE | Sung-Soon Choi,
Kyomin Jung,
Jeong Han Kim:
Phase transition in a random NK landscape model.
GECCO 2005: 1241-1248 |
| 31 | EE | Mohammad Taghi Hajiaghayi,
Jeong Han Kim,
Tom Leighton,
Harald Räcke:
Oblivious routing in directed graphs with random demands.
STOC 2005: 193-201 |
| 30 | EE | 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): 119-145 (2005) |
| 2004 |
|---|
| 29 | EE | Jeong Han Kim:
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems.
COCOON 2004: 2 |
| 28 | EE | Catherine S. Greenhill,
Jeong Han Kim,
Nicholas C. Wormald:
Hamiltonian decompositions of random bipartite regular graphs.
J. Comb. Theory, Ser. B 90(2): 195-222 (2004) |
| 27 | EE | Jeong Han Kim,
Van H. Vu:
Divide and conquer martingales and the number of triangles in a random graph.
Random Struct. Algorithms 24(2): 166-174 (2004) |
| 2003 |
|---|
| 26 | EE | Jeong Han Kim,
Van H. Vu:
Generating random regular graphs.
STOC 2003: 213-222 |
| 25 | EE | Jeong Han Kim,
Van H. Vu:
Small Complete Arcs in Projective Planes.
Combinatorica 23(2): 311-363 (2003) |
| 24 | EE | Jeong Han Kim:
Perfect matchings in random uniform hypergraphs.
Random Struct. Algorithms 23(2): 111-132 (2003) |
| 2002 |
|---|
| 23 | | Catherine S. Greenhill,
Svante Janson,
Jeong Han Kim,
Nicholas C. Wormald:
Permutation Pseudographs And Contiguity.
Combinatorics, Probability & Computing 11(3): (2002) |
| 22 | | Dimitris Achlioptas,
Jeong Han Kim,
Michael Krivelevich,
Prasad Tetali:
Two-coloring random hypergraphs.
Random Struct. Algorithms 20(2): 249-259 (2002) |
| 21 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms 21(3-4): 216-224 (2002) |
| 2001 |
|---|
| 20 | EE | 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): 20-44 (2001) |
| 19 | | Michel Mandjes,
Jeong Han Kim:
Large Deviations for Small Buffers: An Insensitivity Result.
Queueing Syst. 37(4): 349-362 (2001) |
| 18 | | 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): 201-256 (2001) |
| 2000 |
|---|
| 17 | | Jeff Kahn,
Jeong Han Kim,
László Lovász,
Van H. Vu:
The Cover Time, the Blanket Time, and the Matthews Bound.
FOCS 2000: 467-475 |
| 16 | | Dimitris Achlioptas,
Jeong Han Kim,
Michael Krivelevich,
Prasad Tetali:
Two-coloring Random Hypergraphs.
ICALP Satellite Workshops 2000: 85-96 |
| 15 | EE | Jeong Han Kim,
Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications.
Combinatorica 20(3): 417-434 (2000) |
| 14 | EE | Jeong Han Kim,
Boris Pittel:
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number.
J. Comb. Theory, Ser. A 92(2): 197-206 (2000) |
| 13 | EE | Jeong Han Kim,
Boris Pittel:
On Tail Distribution of Interpost Distance.
J. Comb. Theory, Ser. B 80(1): 49-56 (2000) |
| 1999 |
|---|
| 12 | EE | 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: 218-229 |
| 11 | EE | Jeong Han Kim,
Daniel R. Simon,
Prasad Tetali:
Limits on the Efficiency of One-Way Permutation-Based Hash Functions.
FOCS 1999: 535-542 |
| 1998 |
|---|
| 10 | EE | Jeff Kahn,
Jeong Han Kim:
Random Matchings in Regular Graphs.
Combinatorica 18(2): 201-226 (1998) |
| 9 | | Jeong Han Kim,
James R. Roche:
Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks.
J. Comput. Syst. Sci. 56(2): 223-252 (1998) |
| 1997 |
|---|
| 8 | EE | Noga Alon,
Jeong Han Kim:
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph.
J. Comb. Theory, Ser. A 77(1): 165-170 (1997) |
| 1996 |
|---|
| 7 | EE | Jeong Han Kim:
On Increasing Subsequences of Random Permutations.
J. Comb. Theory, Ser. A 76(1): 148-155 (1996) |
| 1995 |
|---|
| 6 | EE | Jeong Han Kim,
James R. Roche:
On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches.
COLT 1995: 240-249 |
| 5 | | Jeong Han Kim:
On Brooks' Theorem for Sparse Graphs.
Combinatorics, Probability & Computing 4: 97-132 (1995) |
| 4 | | Jeff Kahn,
Jeong Han Kim:
Entropy and Sorting.
J. Comput. Syst. Sci. 51(3): 390-399 (1995) |
| 3 | | Jeong Han Kim:
The Ramsey Number R(3, t) Has Order of Magnitude t2/log t.
Random Struct. Algorithms 7(3): 173-208 (1995) |
| 1993 |
|---|
| 2 | EE | Jeong Han Kim:
On 3-colorings of E(Kn).
Discrete Mathematics 118(1-3): 269-273 (1993) |
| 1992 |
|---|
| 1 | | Jeff Kahn,
Jeong Han Kim:
Entropy and Sorting
STOC 1992: 178-187 |
