Jeong Han Kim's (김정한)       

Home Page

 Welcome

Hi, this is Jeong Han Kim. I currently work for Microsoft as a Senior Researcher. In this homepage,

you will be able to find out more about me, my publications, and some media articles on me. 

Please make yourself comfortable and look around. I hope you enjoy your visit. Thank you.

 (More Photos: P1 P2)

                      Jeong Han Kim                         CV (Abridged, Full, Korean)

                      Microsoft Research                    Research Interests    

                      One Microsoft Way                    Recent Publications (Full List)

                      Redmond WA98052                  Awards & Honors

                      jehkim@microsoft.com              Media Articles (Korean)

                      Phone(425)703-2067                Fax(425)708-3767

 Research Interests

• Extremal Graph Theory
• Random Graph and Random Structure
• Probabilistic Method in Combinatorics
• Combinatorial Optimization
• Discrete Probability Theory
• Neural Networks, Networks & Systems

 Dong-A Weekly Columns (Korean)

• 원리는 잊어버리고 공식만 외우는 세태 [2005년 12월 06일 513호]
• 정의 철저한 이해 우선 … 브라운 선생님의 수학수업 [2005년 11월 22일 511호]
• 위대한 뉴턴에게도 수많은 반대자가 있었다 [2005년 11월 15일 510호]
• 자랑스런 한국인이여! 너 자신을 알라 [2005년 10월 18일 506호]
• 공손히 말한 거짓이 서툴게 말한 진리를 이기는 세상 [2005년 10월 04일 504호]
• 수학으로 본 떡값과 뇌물의 차이 [2005년 09월 06일 501호]
• 수학자들의 꿈 = 복잡한 현상 간단한 원리로 풀기 [2005년 08월 23일 499호]
• 미래 예측 능력 필요한데 ‘평강공주’로 키울 텐가 [2005년 08월 09일 497호]
• 2000년 전부터 통한 진리 ‘공부에 왕도는 없다’ [2005년 07월 26일 495호]
• ‘고기 잡는 법’ 가르치지 않고 ‘고기’만 먹여주는 한국 교육 [2005년 07월 12일 493호]
• 정확한 의사표현이 관찰?#49324;고력 키우기 ‘첫걸음’ [2005년 07월 05일 492호]

 Lectures    

• 이산수학 (MAT2106-02): Lecture1, Lecture2: page1, page2, page3, page4, Lecture3, Lecture4

        (Please refer my home page at Yonsei University)

• 확률론적조합론(CA791-01)

• 800억 복권 당첨 된다면  (Korean)

• Probabilistic Combinatorics :

       Chapter 1, Chapter 2, Chapter 3 (part 1), Chapter 3 (part 2), Chapter 4,

       Chapter 5:part 1, part 2, part 3, part4, part 5   Chapter 6: part 1, part 2

       Chapter 7, Chapter 8: Part 1, Part2

       Appendix: Complexity

Recent Publications (Full List)

1. (With U. Feige & E. Ofek) Witnesses for non-satisfiability of dense random 3CNF formulas, to appear in Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS),  2006.
2. Finding cores of random 2-SAT formulae via Poisson cloning (revised on July 28, 2006), Preprint.
3. Poisson Cloning Model for Random Graph.  (revised on Jan 28, 2006, presentation slides), Preprint.
4. (With V. Vu) Generating Random Regular Graphs, To appear in Combinatorica.
5. (With M. Hajiaghayi) Tight Bounds For Random MAX 2-SAT,  Preprint.
6. (With B. Bollob? & J. Verstra?e) Regular Subgraphs of Random Graph, Random Structures and Algorithms,                      29 (2006), 1-13.
7. (With T. Bohman) A phase transition for avoiding a giant component, Random Structures & Algorithms,                           28 (2006), 195-214.                
8. (With Matouvsek, Jivr? Vu, Van H.) Discrepancy after adding a single set, Combinatorica, 25 (2005), 499-501.
9. (With Sung-Soon Choi(최성순), Kyomin Jung(정교민)) , Phase transition in a random NK landscape model, Genetic and Evolutionary Computation Conference  (GECCO), 2005, 1241-1248, Conference Paper.
10. (With M. Hajiaghayi, T. Leighton, H. R?ke) Oblivious routing in directed graphs with random demands,  ACM Symposium on Theory of Computing (STOC), 2005, 193-201, Conference Paper.
11. (With Pikhurko, Oleg; Spencer, Joel H.; Verbitsky, Oleg) How complex are random graphs in first order logic?, Random Structures and Algorithms, 26 (2005), 119-145.

 Awards & Honors

• Fulkerson Prize, August, 1997.
• Alfred P. Sloan Fellow, February, 1997.
• Sloan Dissertation Fellowship, September, 1992.
• Yon-Am Fellowship, March, 1985.

[Papers][Media Articles][Contact me]

Copyright(c) 2001. All rights reserved.