- About CS
- Future Students
- Current Students
- News & Events
- Active Learning: Nina Balcan Shores Up Foundations of Her Field
- Algorithm for Success: Zvi Galil Brings the Fire to Georgia Tech
- An Agile Architecture: Hyesoon Kim Looks to Combine CPUs & GPUs
- Box Seats in Atlanta: Fortnow Poised to Take School of CS to the Show
- Quantum Resistance: Chris Peikert & the Power of Lattices
- The People’s Network: Computing Students Work for More Transparent Internet
PhD Algorithms, Combinatorics and Optimization
The College of Computing is one of the sponsors of the multidisciplinary program in Algorithms, Combinatorics, and Optimization (ACO), an approved doctoral degree program at Georgia Tech. The other sponsoring units are the School of Industrial and Systems Engineering and the School of Mathematics.
The degree program is administered by an oversight committee drawn primarily from the sponsoring units. The study of discrete structures is a rapidly growing area in computer science, applied mathematics, and operations research, most obviously in the analysis of algorithms, combinatorics, and discrete optimization. Collaborative work among the three traditionally separate disciplines is already common.
The doctorate in ACO will prepare students for careers in this exciting and expanding field. Students are expected to be well prepared in at least one of the three fields represented by the sponsoring units (computer science, mathematics, and operations research). Each student in the program is admitted through one of the three sponsoring units, which serves as the home department. Coursework is drawn from all three disciplines. The research advisor may be any member of the ACO program faculty, which is drawn from the three sponsoring units.
If this kind of work interests you and fits with your career aspirations, why not go ahead and apply?