The design and analysis of advanced algorithms is useful in a variety of applications. Combinatorial analysis of discrete structures is important in analyzing algorithms as well as in understanding the properties of the discrete structures themselves. Established research at UGA in this area has focussed on issues in complexity theory concerning exact (parameterized) and approximation algorithms; exact and asymptotic combinatorial enumeration; structural studies; loop-free algorithms; and graph algorithms. Recent studies have expanded to include randomized combinatorial algorithms, bioinformatics, quantum computation, and algorithms for counting and generating Feynman diagrams.

The Department of Computer Science at the University of Georgia invites applications for one full-time, non-tenure track lecturer position starting August 2019.

For more details and application information, please click here. 

To apply, please go to http://www.ugajobsearch.com/postings/58519.

Congratulations to Dr. Shannon Quinn for receiving a 5-year CAREER grant from NSF for the proposal titled: "CAREER: ABI-Innovation: CiliaWeb: Integrated platform for foundational and reproducible ciliary beat pattern analysis."