Contact Information

• ywchoi AT purdue DOT edu

 Research Interests

• Design and Analysis of Algorithms, Information Theory, Data Compression, Distributed Network Algorithms,
  String Algorithms, Analytic Combinatorics

 Education

• Ph.D. Computer Science, Purdue University, expected May 2010. (advisor: Wojciech Szpankowski)
• M.S. Electrical Engineering and Computer Science, Seoul National University, 2004. (advisor: Kunsoo Park)
• B.S. Electrical Engineering, Seoul National University, 2002.

 Publications

   - Journal Papers

• Constrained Pattern Matching
  Yongwook Choi and Wojciech Szpankowski
  ACM Transactions on Algorithms (TALG), to appear.
• Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
  Yongwook Choi, Maleq Khan, V.S. Anil Kumar, and Gopal Pandurangan
  IEEE Journal on Selected Areas in Communications (JSAC), 27(7), pp.1297-1304, September 2009.

• Time and Space Efficient Search with Suffix Arrays
  Yong Wook Choi, Jeong Seop Sim, and Kunsoo Park
  Journal of Korea Information Science Society: Computer Systems and Theory, 32(5-6), pp.260-267, June 2005.

   - Conference & Workshop Papers

• Fast Algorithm for Optimal Compression of Graphs
  Yongwook Choi
  SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), to appear, Austin, USA, January 2010.
• Compression of Graphical Structures
  Yongwook Choi and Wojciech Szpankowski
  IEEE International Symposium on Information Theory (ISIT), pp.364-368, Seoul, South Korea, June-July 2009.
• Large Deviations for Constrained Pattern Matching
  Yongwook Choi and Wojciech Szpankowski
  IEEE International Symposium on Information Theory (ISIT), pp.2141-2145, Toronto, Canada, July 2008.
• Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
  Yongwook Choi, Maleq Khan, V.S. Anil Kumar, and Gopal Pandurangan
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.188-190, Munich, Germany, June 2008.
• Pattern Matching in Constrained Sequences
  Yongwook Choi and Wojciech Szpankowski
  IEEE International Symposium on Information Theory (ISIT), pp.2606-2610, Nice, France, June 2007.
• Compressing with Collapsible Tries
  Alberto Apostolico and Yong Wook Choi
  IEEE Information Theory Workshop (ITW), pp.92-96, Punta del Este, Uruguay, March 2006.
• Textual Compression by Collapsible Tries
  Alberto Apostolico and Yong Wook Choi
  Data Compression Conference (DCC), p.437, Snowbird, USA, March 2006.
• Time and Space Efficient Search with Suffix Arrays
  Yong Wook Choi and Kunsoo Park
  Australasian Workshop on Combinatorial Algorithms (AWOCA), pp.230-238, Ballina, Australia, July 2004.

Last updated: November 20, 2009