Ker-I Ko

Rank/Position Title:

Professor

Home Page:

http://www.cs.sunysb.edu/~keriko

Date of original appointment to this faculty, followed by dates and ranks of advancement:

• September 1986, Associate Professor
• September 1991, Professor

Degrees:

Conferences, workshops, and professional development:

• Seminar on Computational Complexity and Computational Analysis, Kyushu University, Fukuoka, Japan, Nov. 2004
• Sixth International Workshop on Computability and Complexity in Analysis, Lutherstadt, Wittenburg, Germany, Aug 2004
• International Conference on Computability and Complexity in Analysis, University of Cincinnati, Cincinnati, Ohio, Aug 2003
• Seventh International Computing and Combinatoriacs Conference, Guilin, China, Aug 2001.
• Seventh Asian Logic Conference, Hsitou, Taiwan, June 1999

Other related computing experience:

Department, college, and/or university committee membership:

Department PhD qualifying exam committee

Principal publications of the last five years.

• A. Chou and K. Ko, A note on the complexity of distance functions of two-dimensional domains, Theoretical Computer Science, (to appear, 2005).
• A. Chou and K. Ko, On the complexity of finding paths in a two-dimensional domain II: piecewise Straight-line paths, Proceedings of Sixth Workshop on Computability and Complexity in Analysis, Electronic Notes in Theoretical Computer Science, 120 (2005).
• A. Chou and K. Ko, On the complexity of finding paths in a two-dimensional domain I: shortest paths, Mathematical Logic Quarterly 50 (2004), 551-572.
• K.-I. Ko, Computational complexity of fractals, in "Proceedings of the 7th and 8th Asian Logic Conferences," R. Downey et al., eds., World Scientific, Singapore, 2003, p. 252-269.
• D.-Z. Du, K.-I. Ko and J. Wang, Introduction to Computational Complexity, (in Chinese), Higher Education Press, Beijing, 2002, 500 pp.
• D.-Z. Du and K-I Ko, Problem Solving in Automata, Languages, and Complexity, John Wiley & Sons, New York, 2001, 400pp.
• D.-Z. Du and K. Ko, On Cook's theorem, MathMedia (in Chinese), 24:4, 2000.
• D.-Z. Du and K-I Ko, Theory of Computational Complexity, John Wiley & Sons, New York, 2000, 500pp.

Other scholarly activity: grants, sabbaticals, software development, etc.:

• National Science Foundation Grant CCF 0430124, $150,000, August 2004-July 2007.
• Member of Editorial Board, SIAM Jounral on Computing, 1991-present
• Associate Editor, Journal of Complexity, 1995-present
• Sabbatical visits to National Chiao-Tung University , Hsinchu , Taiwan , Jan.-June 1999.

Scientific, professional, and honor societies of which you are a member:

Honors and awards:

Courses taught this and last academic year term-by-term

Academic advising:

Assigned advisor for 18 undergraduate students during 2004/2005 academic year.

Brief description of major research and scholarly activities:

My research activities include many aspects of theoretical computer science, including compuational complexity theory, theory of computation, computable analysis, and computational learning theory.