( en | de | ru )

 

Disambiguation of "Kim, Jeong Han"

Author of the publication

copydeleteadd this publication to your clipboard
How complex are random graphs in first order logic?

, , , and . Random Struct. Algorithms, 26 (1-2): 119-145 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jeong Dae Han

Jeong Han Lee

Jeong Won Kim

Jeong Beom Kim

Hye-Jeong Kim

 

Other publications of authors with the same name

A phase transition for avoiding a giant component., and . Random Struct. Algorithms, 28 (2): 195-214 (2006)Generating random regular graphs., and . STOC, page 213-222. ACM, (2003)Phase transition in a random NK landscape model., , and . Artif. Intell., 172 (2-3): 179-203 (2008)Anatomy of a young giant component in the random graph., , , and . Random Struct. Algorithms, 39 (2): 139-178 (2011)Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions., , , and . Des. Codes Cryptogr., 90 (8): 1735-1760 (2022)On Increasing Subsequences of Random Permutations.. J. Comb. Theory, Ser. A, 76 (1): 148-155 (1996)Majority dynamics on sparse random graphs., , , and . Random Struct. Algorithms, 63 (1): 171-191 (August 2023)On coupon colorings of graphs., , , and . Discret. Appl. Math., (2015)Witnesses for non-satisfiability of dense random 3CNF formulas., , and . FOCS, page 497-508. IEEE Computer Society, (2006)Optimal query complexity bounds for finding graphs., and . STOC, page 749-758. ACM, (2008)