Education:
B.Sc., Computing Science, Imperial
College of Science and Technology, University of London, United Kingdom, 1986
M.S., Computer Science, Tulane University, 1991
Ph.D., Computer Science, Tulane University, 1992
Ph.D Thesis: Complexity of Scheduling Problems with Constraints.
Discrete Structures (CSC_285)
Data Structures & Algorithm Analysis
(CSC_310)
Theory of Computation (CSC_311)
Organization of Programming Languages (CSC_415)
Distributed Computing, Design and Analysis of Algorithms, Computational Complexity, Scheduling Theory, Programming Languages, Algorithm Visualization, Theoretical Computer Science.
Ng, C. (with B. Belkhouche & R.
Lang), “A Branching Time Semantics for the Ada Rendezvous Mechanisms”,
Proceedings of the 29th Annual Hawaii International Conference on
System Sciences, IEEE Computer Society Press, 1996, Vol. I, pp.517-524.
Ng, C. (with N. Warsi), “An Intelligent Search Algorithm for Dynamic Programming Computation”, Neural, Parallel & Scientific Computations 3, 1995.
To
the Morehouse College Homepage
To Department
of Computer Science Homepage
Department of Computer Science
Morehouse College
830 Westview Dr. SW
Atlanta , GA 30314
Office: Room 121, Tech. Tower.
(404) 681-2800 x2827 or
Direct (404) 614-8577
Fax (404) 614-8576
cng@morehouse.edu
Last Updated: 08.19.2002