Jeong Han Kim

From MaRDI portal
Person:178483

Available identifiers

zbMath Open kim.jeong-hanWikidataQ10559428 ScholiaQ10559428MaRDI QIDQ178483

List of research outcomes

PublicationDate of PublicationType
Threshold functions for incidence properties in finite vector spaces2023-03-10Paper
Cosmological particle production and pairwise hotspots on the CMB2022-10-10Paper
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions2022-08-04Paper
Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions2021-12-21Paper
Some advances on Sidorenko's conjecture2019-01-11Paper
On the total variation distance between the binomial random graph and the random intersection graph2018-09-05Paper
Sidorenko's conjecture for higher tree decompositions2018-05-06Paper
Two approaches to Sidorenko’s conjecture2016-03-07Paper
On coupon colorings of graphs2015-07-24Paper
Universality of Random Graphs for Graphs of Maximum Degree Two2014-12-22Paper
Diameters in Supercritical Random Graphs Via First Passage Percolation2013-03-13Paper
Finding Weighted Graphs by Combinatorial Search2012-01-18Paper
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions2012-01-11Paper
Anatomy of a young giant component in the random graph2011-10-25Paper
A sequential algorithm for generating random graphs2010-11-08Paper
Optimal query complexity bounds for finding graphs2010-09-02Paper
Oblivious routing in directed graphs with random demands2010-08-16Paper
Generating random regular graphs2010-08-16Paper
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm2010-05-06Paper
Phase transition in a random NK landscape model2009-07-17Paper
A Sequential Algorithm for Generating Random Graphs2009-02-17Paper
https://portal.mardi4nfdi.de/entity/Q53021002009-01-05Paper
Entropy and sorting.2008-12-21Paper
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm2008-05-27Paper
Small subgraphs of random regular graphs2007-05-23Paper
Generating random regular graphs2007-05-08Paper
Poisson Cloning Model for Random Graphs2006-09-26Paper
Regular subgraphs of random graphs2006-09-06Paper
Discrepancy after adding a single set2006-06-27Paper
A phase transition for avoiding a giant component2006-05-16Paper
Computing and Combinatorics2005-06-15Paper
How complex are random graphs in first order logic?2005-04-21Paper
Sandwiching random graphs: universality between random graph models2004-11-18Paper
Divide and conquer martingales and the number of triangles in a random graph2004-03-29Paper
Hamiltonian decompositions of random bipartite regular graphs.2004-03-14Paper
Tail bound for the minimal spanning tree of a complete graph.2004-02-14Paper
Small complete arcs in projective planes2003-12-14Paper
ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS2003-11-17Paper
Perfect matchings in random uniform hypergraphs2003-11-10Paper
On the asymmetry of random regular graphs and random graphs2003-03-19Paper
Permutation Pseudographs and Contiguity2003-03-09Paper
On tail distribution of interpost distance2002-12-10Paper
Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs2002-12-10Paper
Two‐coloring random hypergraphs2002-08-08Paper
The scaling window of the 2-SAT transition2002-02-19Paper
Analysis of a phase transition phenomenon in packet networks2002-02-03Paper
https://portal.mardi4nfdi.de/entity/Q27414702001-10-24Paper
Large deviations for Small buffers: An insensitivity result2001-07-19Paper
Concentration of multivariate polynomials and its applications2001-06-12Paper
Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number2001-02-22Paper
Covering cubes by random half cubes, with applications to binary neural networks1998-11-10Paper
Interference-Minimizing Colorings of Regular Graphs1998-05-11Paper
Nearly perfect matchings in regular simple hypergraphs1997-09-17Paper
On the degree, size, and chromatic index of a uniform hypergraph1997-08-18Paper
https://portal.mardi4nfdi.de/entity/Q43334551997-06-29Paper
On increasing subsequences of random permutations1997-04-07Paper
On Brooks' Theorem for Sparse Graphs1996-03-11Paper
The Ramsey number R(3, t) has order of magnitude t2/log t1996-02-08Paper
On 3-colorings of \(E(K_ n)\)1994-01-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeong Han Kim