The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jeong Han Kim" ( http://dblp.L3S.de/Authors/Jeong_Han_Kim )

URL (Homepage):  http://research.microsoft.com/research/theory/jehkim/  Author page on DBLP  Author page in RDF  Community of Jeong Han Kim in ASPL-2

Publication years (Num. hits)
1992-2000 (18) 2001-2005 (17) 2006-2010 (16) 2011-2018 (8)
Publication types (Num. hits)
article(43) inproceedings(16)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 30 occurrences of 30 keywords

Results
Found 60 publication records. Showing 59 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jeong Han Kim, Sang June Lee, Joohan Na On the total variation distance between the binomial random graph and the random intersection graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Conlon, Jeong Han Kim, Choongbum Lee, Joonkyung Lee Some advances on Sidorenko's conjecture. Search on Bibsonomy J. London Math. Society The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Hong-Gee Kim, Hyun-Jean Lee The BirdMan: hybrid perception. Search on Bibsonomy Digital Creativity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte On coupon colorings of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Sangjune Lee Universality of Random Graphs for Graphs of Maximum Degree Two. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim Finding Weighted Graphs by Combinatorial Search Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Sung-Soon Choi, Kyomin Jung, Jeong Han Kim Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres Anatomy of a young giant component in the random graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres Diameters in Supercritical Random Graphs Via First Passage Percolation. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sung-Soon Choi, Jeong Han Kim Optimal query complexity bounds for finding graphs. Search on Bibsonomy Artif. Intell. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mohsen Bayati, Jeong Han Kim, Amin Saberi A Sequential Algorithm for Generating Random Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sung-Soon Choi, Kyomin Jung, Jeong Han Kim Phase transition in a random NK landscape model. Search on Bibsonomy Artif. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim Finding cores of random 2-SAT formulae via Poisson cloning Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Jeong 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. Search on Bibsonomy ANTS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Pollard Rho, collision time, Discrete Logarithm, self intersection, Birthday Paradox
1Sung-Soon Choi, Kyomin Jung, Jeong Han Kim Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. Search on Bibsonomy COLT The full citation details ... 2008 DBLP  BibTeX  RDF
1Sung-Soon Choi, Jeong Han Kim Optimal query complexity bounds for finding graphs. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF coin weighing problem, combinatorial group testing, combinatorial search, graph finding, littlewood-offord theorem, pseudo-boolean function, fourier coefficient
1Mohsen Bayati, Jeong Han Kim, Amin Saberi A Sequential Algorithm for Generating Random Graphs Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Jeong Han Kim, Benny Sudakov, Van H. Vu Small subgraphs of random regular graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Ravi Montenegro, Prasad Tetali Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mohsen Bayati, Jeong Han Kim, Amin Saberi A Sequential Algorithm for Generating Random Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Van H. Vu Generating Random Regular Graphs. Search on Bibsonomy Combinatorica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80
1Béla Bollobás, Jeong Han Kim, Jacques Verstraëte Regular subgraphs of random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tom Bohman, Jeong Han Kim A phase transition for avoiding a giant component. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Jeong Han Kim, Eran Ofek Witnesses for non-satisfiability of dense random 3CNF formulas. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Jirí Matousek 0001, Van H. Vu Discrepancy After Adding A Single Set. Search on Bibsonomy Combinatorica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05D40
1Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky How complex are random graphs in first order logic? Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sung-Soon Choi, Kyomin Jung, Jeong Han Kim Phase transition in a random NK landscape model. Search on Bibsonomy GECCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF random k-SAT problem, unit clause algorithm, phase transition, branching process, NK landscape
1Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke Oblivious routing in directed graphs with random demands. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF demand distributions, directed graphs, oblivious routing
1Jeong Han Kim, Van H. Vu Divide and conquer martingales and the number of triangles in a random graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald Hamiltonian decompositions of random bipartite regular graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Van H. Vu Small Complete Arcs in Projective Planes. Search on Bibsonomy Combinatorica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000): 05B25
1Jeong Han Kim Perfect matchings in random uniform hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Van H. Vu Generating random regular graphs. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF configuration model, concentration, inequality, random regular graph
1Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald Permutation Pseudographs And Contiguity. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali Two-coloring random hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Benny Sudakov, Van H. Vu On the asymmetry of random regular graphs and random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim Nearly Optimal Partial Steiner Systems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michel Mandjes, Jeong Han Kim Large Deviations for Small Buffers: An Insensitivity Result. Search on Bibsonomy Queueing Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson The scaling window of the 2-SAT transition. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Nicholas C. Wormald Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Van H. Vu Concentration of Multivariate Polynomials and Its Applications. Search on Bibsonomy Combinatorica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05, 60
1Jeong Han Kim, Boris G. Pittel Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Boris G. Pittel On Tail Distribution of Interpost Distance. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jeff Kahn, Jeong Han Kim, László Lovász 0001, Van H. Vu The Cover Time, the Blanket Time, and the Matthews Bound. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF blanket time, Matthews bound, Matthews bounds, deterministic-polynomial time algorithm, computational complexity, approximation algorithm, graph theory, graph, theorem proving, random walk, deterministic algorithms, approximation theory, stationary distribution, cover time
1Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali Two-coloring Random Hypergraphs. Search on Bibsonomy ICALP Satellite Workshops The full citation details ... 2000 DBLP  BibTeX  RDF
1Christian 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. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Daniel R. Simon, Prasad Tetali Limits on the Efficiency of One-Way Permutation-Based Hash Functions. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF cryptography, Oracle, complexity theory, relativization
1Jeff Kahn, Jeong Han Kim Random Matchings in Regular Graphs. Search on Bibsonomy Combinatorica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C65, 60G42, 05C70, 05C80, 60C05, 60F05
1Jeong Han Kim, James R. Roche Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Noga Alon, Jeong Han Kim On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Prasad Tetali, Peter C. Fishburn Score certificates for tournaments. Search on Bibsonomy Journal of Graph Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim On Increasing Subsequences of Random Permutations. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim On Brooks' Theorem for Sparse Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Jeff Kahn, Jeong Han Kim Entropy and Sorting. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim The Ramsey Number R(3, t) Has Order of Magnitude t2/log t. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, James R. Roche On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches. Search on Bibsonomy COLT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim On 3-colorings of E(Kn). Search on Bibsonomy Discrete Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Jeff Kahn, Jeong Han Kim Entropy and Sorting Search on Bibsonomy STOC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #59 of 59 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license