default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeong Han Kim
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j44]Jeong Han Kim, Ben Lund, Thang Pham, Semin Yoo
:
Threshold functions for incidence properties in finite vector spaces. Finite Fields Their Appl. 87: 102149 (2023)- [j43]Heewon Chung, Dongwoo Kim, Jeong Han Kim, Jiseung Kim:
Amortized efficient zk-SNARK from linear-only RLWE encodings. J. Commun. Networks 25(3): 271-284 (2023) - [j42]Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran:
Majority dynamics on sparse random graphs. Random Struct. Algorithms 63(1): 171-191 (2023) - 2022
- [j41]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): 1735-1760 (2022) - 2021
- [c17]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: 739-760 - 2020
- [i4]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: 783 (2020)
2010 – 2019
- 2018
- [j40]David Conlon, Jeong Han Kim, Choongbum Lee, Joonkyung Lee:
Some advances on Sidorenko's conjecture. J. Lond. Math. Soc. 98(3): 593-608 (2018) - [j39]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): 662-679 (2018) - 2015
- [j38]Jeong Han Kim, Hong-Gee Kim, Hyun-Jean Lee:
The BirdMan: hybrid perception. Digit. Creativity 26(1): 56-64 (2015) - [j37]Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte:
On coupon colorings of graphs. Discret. Appl. Math. 193: 94-101 (2015) - 2014
- [j36]Jeong Han Kim, Sangjune Lee:
Universality of Random Graphs for Graphs of Maximum Degree Two. SIAM J. Discret. Math. 28(3): 1467-1478 (2014) - 2012
- [i3]Jeong Han Kim:
Finding Weighted Graphs by Combinatorial Search. CoRR abs/1201.3793 (2012) - 2011
- [j35]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): 1039-1053 (2011) - [j34]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Anatomy of a young giant component in the random graph. Random Struct. Algorithms 39(2): 139-178 (2011) - 2010
- [j33]Sung-Soon Choi, Jeong Han Kim:
Optimal query complexity bounds for finding graphs. Artif. Intell. 174(9-10): 551-569 (2010) - [j32]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. Algorithmica 58(4): 860-910 (2010) - [j31]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19(5-6): 729-751 (2010)
2000 – 2009
- 2008
- [j30]Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Phase transition in a random NK landscape model. Artif. Intell. 172(2-3): 179-203 (2008) - [c16]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 - [c15]Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. COLT 2008: 123-134 - [c14]Sung-Soon Choi, Jeong Han Kim:
Optimal query complexity bounds for finding graphs. STOC 2008: 749-758 - [i2]Jeong Han Kim:
Finding cores of random 2-SAT formulae via Poisson cloning. CoRR abs/0808.1599 (2008) - 2007
- [j29]Jeong Han Kim, Benny Sudakov, Van H. Vu:
Small subgraphs of random regular graphs. Discret. Math. 307(15): 1961-1967 (2007) - [c13]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. APPROX-RANDOM 2007: 326-340 - [c12]Jeong Han Kim, Ravi Montenegro, Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS 2007: 215-223 - [i1]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. CoRR abs/cs/0702124 (2007) - 2006
- [j28]Jeong Han Kim, Van H. Vu:
Generating Random Regular Graphs. Comb. 26(6): 683-708 (2006) - [j27]Tom Bohman, Jeong Han Kim:
A phase transition for avoiding a giant component. Random Struct. Algorithms 28(2): 195-214 (2006) - [j26]Béla Bollobás, Jeong Han Kim, Jacques Verstraëte:
Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006) - [c11]Uriel Feige, Jeong Han Kim, Eran Ofek:
Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS 2006: 497-508 - 2005
- [j25]Jeong Han Kim, Jirí Matousek, Van H. Vu:
Discrepancy After Adding A Single Set. Comb. 25(4): 499-501 (2005) - [j24]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) - [c10]Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Phase transition in a random NK landscape model. GECCO 2005: 1241-1248 - [c9]Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke:
Oblivious routing in directed graphs with random demands. STOC 2005: 193-201 - 2004
- [j23]Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald:
Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory B 90(2): 195-222 (2004) - [j22]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) - [c8]Jeong Han Kim:
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. COCOON 2004: 2 - 2003
- [j21]Jeong Han Kim, Van H. Vu:
Small Complete Arcs in Projective Planes. Comb. 23(2): 311-363 (2003) - [j20]Jeong Han Kim:
Perfect matchings in random uniform hypergraphs. Random Struct. Algorithms 23(2): 111-132 (2003) - [c7]Jeong Han Kim, Van H. Vu:
Generating random regular graphs. STOC 2003: 213-222 - 2002
- [j19]Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald:
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11(3): 273-298 (2002) - [j18]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002) - [j17]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
- [j16]Jeong Han Kim:
Nearly Optimal Partial Steiner Systems. Electron. Notes Discret. Math. 7: 74-77 (2001) - [j15]Jeong Han Kim, Nicholas C. Wormald:
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. J. Comb. Theory B 81(1): 20-44 (2001) - [j14]Michel Mandjes, Jeong Han Kim:
Large Deviations for Small Buffers: An Insensitivity Result. Queueing Syst. Theory Appl. 37(4): 349-362 (2001) - [j13]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
- [j12]Jeong Han Kim, Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications. Comb. 20(3): 417-434 (2000) - [j11]Jeong Han Kim, Boris G. Pittel:
On Tail Distribution of Interpost Distance. J. Comb. Theory B 80(1): 49-56 (2000) - [j10]Jeong Han Kim, Boris G. Pittel:
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. J. Comb. Theory A 92(2): 197-206 (2000) - [c6]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 - [c5]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96
1990 – 1999
- 1999
- [c4]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 - [c3]Jeong Han Kim, Daniel R. Simon, Prasad Tetali:
Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS 1999: 535-542 - 1998
- [j9]Jeff Kahn, Jeong Han Kim:
Random Matchings in Regular Graphs. Comb. 18(2): 201-226 (1998) - [j8]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
- [j7]Noga Alon, Jeong Han Kim:
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. J. Comb. Theory A 77(1): 165-170 (1997) - [j6]Jeong Han Kim, Prasad Tetali, Peter C. Fishburn:
Score certificates for tournaments. J. Graph Theory 24(2): 117-138 (1997) - 1996
- [j5]Jeong Han Kim:
On Increasing Subsequences of Random Permutations. J. Comb. Theory A 76(1): 148-155 (1996) - 1995
- [j4]Jeong Han Kim:
On Brooks' Theorem for Sparse Graphs. Comb. Probab. Comput. 4: 97-132 (1995) - [j3]Jeff Kahn, Jeong Han Kim:
Entropy and Sorting. J. Comput. Syst. Sci. 51(3): 390-399 (1995) - [j2]Jeong Han Kim:
The Ramsey Number R(3, t) Has Order of Magnitude t2/log t. Random Struct. Algorithms 7(3): 173-208 (1995) - [c2]Jeong Han Kim, James R. Roche:
On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches. COLT 1995: 240-249 - 1993
- [j1]Jeong Han Kim:
On 3-colorings of E(Kn). Discret. Math. 118(1-3): 269-273 (1993) - 1992
- [c1]Jeff Kahn, Jeong Han Kim:
Entropy and Sorting. STOC 1992: 178-187
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
