The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeong Han Kim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  41. A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. [Citation Graph (, )][DBLP]


  42. Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. [Citation Graph (, )][DBLP]


  43. Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. [Citation Graph (, )][DBLP]


  44. Optimal query complexity bounds for finding graphs. [Citation Graph (, )][DBLP]


  45. Phase transition in a random NK landscape model. [Citation Graph (, )][DBLP]


  46. Optimal query complexity bounds for finding graphs. [Citation Graph (, )][DBLP]


  47. Finding cores of random 2-SAT formulae via Poisson cloning [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002