The following pages link to Jeong Han Kim (Q178483):
Displaying 50 items.
- A sequential algorithm for generating random graphs (Q603928) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- On 3-colorings of \(E(K_ n)\) (Q685557) (← links)
- (Q879168) (redirect page) (← links)
- Small subgraphs of random regular graphs (Q882118) (← links)
- Entropy and sorting. (Q960517) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Covering cubes by random half cubes, with applications to binary neural networks (Q1271555) (← links)
- (Q1366947) (redirect page) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Small complete arcs in projective planes (Q1416167) (← links)
- Tail bound for the minimal spanning tree of a complete graph. (Q1423115) (← links)
- Hamiltonian decompositions of random bipartite regular graphs. (Q1426097) (← links)
- Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number (Q1841228) (← links)
- On tail distribution of interpost distance (Q1850483) (← links)
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs (Q1850508) (← links)
- Sandwiching random graphs: universality between random graph models (Q1886582) (← links)
- On increasing subsequences of random permutations (Q1924244) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Cosmological particle production and pairwise hotspots on the CMB (Q2083008) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← links)
- Discrepancy after adding a single set (Q2568502) (← links)
- Threshold functions for incidence properties in finite vector spaces (Q2689352) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Analysis of a phase transition phenomenon in packet networks (Q2726728) (← links)
- (Q2741470) (← links)
- Two approaches to Sidorenko’s conjecture (Q2790648) (← links)
- Universality of Random Graphs for Graphs of Maximum Degree Two (Q2935281) (← links)
- Anatomy of a young giant component in the random graph (Q3094602) (← links)
- Permutation Pseudographs and Contiguity (Q3147239) (← links)
- Oblivious routing in directed graphs with random demands (Q3581422) (← links)
- A Sequential Algorithm for Generating Random Graphs (Q3603475) (← links)
- Score certificates for tournaments (Q4333455) (← links)
- Interference-Minimizing Colorings of Regular Graphs (Q4388976) (← links)
- Perfect matchings in random uniform hypergraphs (Q4434467) (← links)
- ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS (Q4435712) (← links)
- Divide and conquer martingales and the number of triangles in a random graph (Q4459588) (← links)
- Two‐coloring random hypergraphs (Q4543631) (← links)
- On the total variation distance between the binomial random graph and the random intersection graph (Q4584914) (← links)
- Some advances on Sidorenko's conjecture (Q4646248) (← links)
- How complex are random graphs in first order logic? (Q4667860) (← links)
- Computing and Combinatorics (Q4681174) (← links)
- On the asymmetry of random regular graphs and random graphs (Q4798165) (← links)
- The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> (Q4851927) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- Diameters in Supercritical Random Graphs Via First Passage Percolation (Q4911110) (← links)
- (Q5302100) (← links)
