· Kyomin Jung is an assistant professor in the division of Computer Science, department of EECS at KAIST. He has a joint appointment in the department of Mathematics, KAIST.

· He received Ph.D. in MIT Mathematics department in June 2009, and he was a member of LIDS(Laboratories for Information and Decision Systems), where he worked with Devavrat Shah.

· In Summer 2008, he worked as a research internship in Microsoft Research Machine Learning and Perception Group, Cambridge, UK.

· In Summer 2007, he worked as a research internship in IBM T.J. Watson Research Center System Analysis and Optimization Group, Yorktown, NY, USA.

· In Summer 2006, he worked as a research internship in Bell Labs Department of Mathematics of networks and systems, Murray Hill, NJ, USA.

· In Summer 2005, he worked as a research internship in Samsung Advanced Institute of Technology Communication and Network Lab, Giheung, Korea.

· In Winter 2003-2004, he was a research visitor in Microsoft Research Theory group, Redmond, WA, USA.

· His graduate study was supported by Samsung Lee Kun Hee Scholarship Foundation. (Fall 2004 ~ Spring 2008)

· He completed B.Sc. in the Department of Mathematics, Seoul National University, Korea.

· He won a Gold Medal in IMO(International Mathematical Olympiad) 1995 held in Toronto, Canada.

· His Research Interest includes 1) inference algorithms on Markov Random Field, 2) computational learning theory, 3) network resource allocations, and 4) graph algorithms.

· To students : Please feel free to contact me if you are interested in working with me on exciting ongoing or upcoming research projects.

· Current graduate stduents: Yongsub Lim, Boyoung Kim, Nam-ju Kwak.

CV Pictures Contact

---

· Course

· Fall 2009: CS774. Markov Random Field: Theory and Application.

· Publications

• Kyomin Jung and Devavrat Shah, Algorithmically Efficient Networks, submitted.
• Kyomin Jung, Pushmeet Kohli and Devavrat Shah, Local Rules for Global MAP: When Do They Work ?, To appear in the Annual Conference on Neural Information Processing Systems (NIPS), December 2009, Vancouver, Canada.
• Kyomin Jung, Devavrat Shah and Jinwoo Shin, Minimizing the Rate of Convergence for Iterative Algorithms, To appear in IEEE Transactions on Information Theory.
• Sung-soon Choi, Kyomin Jung and Byung-Ro Moon, Lower and Upper Bounds for Linkage Discovery, To appear in IEEE Transactions on Evolutionary Computation.
• Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah and Ramavarapu Sreenivas,Computing Capacity Region of a Wireless Network, IEEE International Conference on Computer Communications (INFOCOM), April 2009, Rio De Janeiro, Brazil.
• Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova and David Woodruff, Transitive-Closure Spanners, ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2009, New York, NY, USA.
• Sung-soon Choi, Kyomin Jung and Jeong Han Kim, Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo-Boolean Functions, The Annual Conference on Learning Theory (COLT), July 2008, Helsinki, Finland.
• Kyomin Jung, Yingdong Lu, Devavrat Shah, Mayank Sharma and Mark S. Squillante, Revisiting Stochastic Loss Networks: Structures and Algorithms, ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), June 2008, Annapolis, ML, USA.
• Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah and Ramavarapu Sreenivas, Feasible Rate Allocation in Wireless Networks, IEEE International Conference on Computer Communications (INFOCOM), April 2008, Phoenix AZ, USA.
• Kyomin Jung and Devavrat Shah, Local Algorithms for Approximate Inference in Minor-Excluded Graphs, Annual Conference on Neural Information Processing Systems (NIPS), December 2007, Vancouver, Canada.
• Kyomin Jung, Devavrat Shah and Jinwoo Shin, Fast and Slim Lifted Markov Chains, Invited paper to the ALLERTON Conference on Communication, Control and Computing, September 2007, Monticello IL, USA.
• Kyomin Jung and Devavrat Shah, Local Approximate Inference Algorithms, Invited paper to the ALLERTON Conference on Communication, Control and Computing, September 2007, Monticello IL, USA. Full version submitted.
• Kyomin Jung and Devavrat Shah, Low Delay Scheduling in Wireless Network, IEEE International Symposium on Information Theory (ISIT), June 2007, Nice, France. Full Version.
• Matthew Andrews, Kyomin Jung and Alexander Stolyar, Stability of the Max-Weight Routing and Scheduling Protocol in Dynamic Networks and at Critical Loads, ACM Symposium on Theory of Computing (STOC), June 2007, San Diego, USA.
• Kyomin Jung and Devavrat Shah, Fast Gossip via Non-reversible Random walk, Invited paper to the IEEE Information Theory Workshop (ITW), March 2006, Punta del Este, Uruguay.
• Kyomin Jung and Devavrat Shah, On Computationally Bounded Adversarial Capacity, Invited paper to the Information Theory and Application Workshop, February 2006, San Diego, USA.
• Sung-Soon Choi, Kyomin Jung and Jeong Han Kim, Phase Transition in a Random NK Landscape Model, ACM Genetic and Evolutionary Computation Conference (GECCO), June 2005, Washington DC, USA. Full Version in Artificial Intelligence 172(2-3): 179-203, 2008.

---

· Contact

• E-mail: kyomin at kaist.edu
• Office: E3-1, 1427
• Phone: +82-42-350-3544

Last updated: Nov 02 2009

---

(since 15 July 2009)