( en | de | ru )

 

Disambiguation of "Kim, Jeong Han"

Author of the publication

copydeleteadd this publication to your clipboard
Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions.

, , , and . Public Key Cryptography (2), volume 12711 of Lecture Notes in Computer Science, page 739-760. Springer, (2021)

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

Generating random regular graphs., and . STOC, page 213-222. ACM, (2003)On coupon colorings of graphs., , , and . Discret. Appl. Math., (2015)Majority dynamics on sparse random graphs., , , and . Random Struct. Algorithms, 63 (1): 171-191 (August 2023)Witnesses for non-satisfiability of dense random 3CNF formulas., , and . FOCS, page 497-508. IEEE Computer Society, (2006)On Increasing Subsequences of Random Permutations.. J. Comb. Theory A, 76 (1): 148-155 (1996)Perfect matchings in random uniform hypergraphs.. Random Struct. Algorithms, 23 (2): 111-132 (2003)On the total variation distance between the binomial random graph and the random intersection graph., , and . Random Struct. Algorithms, 52 (4): 662-679 (2018)The Cover Time, the Blanket Time, and the Matthews Bound., , , and . FOCS, page 467-475. IEEE Computer Society, (2000)Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number., and . J. Comb. Theory A, 92 (2): 197-206 (2000)Optimal query complexity bounds for finding graphs., and . STOC, page 749-758. ACM, (2008)