Subareas: Algorithms, Automated Theorem Proving
Theory is concerned with the general properties of computers, languages, and algorithms as opposed to their use for specific applications. Prof. Anderson and Baruah study scheduling algorithms for scheduling jobs on computers, and develop new algorithms with better asymptotic run times than existing ones. Prof. Snoeyink studies geometric algorithms, which are concerned with computing properties of geometric diagrams composed of lines and points, or modifying such diagrams in specified ways. Such algorithms arise in many application areas. Prof. Plaisted’s main research area is the application of computers to proving mathematical theorems, and developing theorem proving methods with better performance than existing ones.