Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kim, Jeong Han"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Universality of random graphs for graphs of maximum degree two
Jeong Han Kim
,
Sang June Lee
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1467-1478
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Sung-Soon Choi
,
Kyomin Jung
,
Jeong Han Kim
Journal of Computer and System Sciences
77
(6), 2011, pp. 1039-1053
A sequential algorithm for generating random graphs
Mohsen Bayati
,
Jeong Han Kim
,
Amin Saberi
Algorithmica
58
(4), 2010, pp. 860-910
Optimal query complexity bounds for finding graphs
Sung-Soon Choi
,
Jeong Han Kim
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 749-758
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm
Jeong Han Kim
,
Ravi Montenegro
,
Yuval Peres
,
Prasad Tetali
Lecture Notes in Computer Science
5011
, 2008, pp. 402-415
Oblivious routing in directed graphs with random demands
MohammadTaghi Hajiaghayi
,
Jeong Han Kim
,
Tom Leighton
,
Harald Räcke
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 193-201
Discrepancy after adding a single set
Jeong Han Kim
,
Jiȓí Matous̑ek
,
Van H. Vu
Combinatorica
25
(4), 2005, pp. 499-501
Hamiltonian decompositions of random bipartite regular graphs
Catherine Greenhill
,
Jeong Han Kim
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 195-222
The poisson cloning model for random graphs, random directed graphs and random
k
-SAT problems
Jeong Han Kim
Lecture Notes in Computer Science
3106
, 2004, pp. 2-2
Generating random regular graphs
Jeong Han Kim
,
Van H. Vu
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 213-222
Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
Jeong Han Kim
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 20-44
Two-coloring random hypergraphs
Dimitris Achlioptas
,
Jeong Han Kim
,
Michael Krivelevich
,
Prasad Tetali
Proceedings in Informatics
8
, 2000, pp. 85-96
Confirming the Kleitman-Winston conjecture on the largest coefficient in a
q
-Catalan number
Jeong Han Kim
,
Boris Pittel
Journal of Combinatorial Theory Series A
92
(2), 2000, pp. 197-206
On tail distribution of interpost distance
Jeong Han Kim
,
Boris Pittel
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 49-56
Concentration of multivariate polynomials and its applications
Jeong Han Kim
,
Van H. Vu
Combinatorica
20
(3), 2000, pp. 417-434
Random matchings in reagular graphs
Jeff Kahn
,
Jeong Han Kim
Combinatorica
18
(2), 1998, pp. 201-226
Covering cubes by random half cubes, with applications to binary neural networks
Jeong Han Kim
,
James R. Roche
Journal of Computer and System Sciences
56
(2), 1998, pp. 223-252
On the degree, size and chromatic index of a uniform hypergraph
Noga Alon
,
Jeong Han Kim
Journal of Combinatorial Theory Series A
77
(1), 1997, pp. 165-170
Score certificates for tournaments
Jeong Han Kim
,
Prasad Tetali
,
Peter Fishburn
Journal of Graph Theory
24
(2), 1997, pp. 117-138
Entropy and sorting
Jeff Kahn
,
Jeong Han Kim
Journal of Computer and System Sciences
51
(3), 1995, pp. 390-399
On 3-colorings of
E(K _n)
Jeong Han Kim
Discrete Mathematics
118
(1-3), 1993, pp. 269-273
Entropy and sorting
Jeff Kahn
,
Jeong Han Kim
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 178-187