Assistant Teaching Professor, Computer Science
Christos Kapoutsis joined CMU-Q in 2012. He holds a B.Sc. in informatics from the Aristotle University of Thessaloniki, Greece (1997) and a M.Sc. from the master's program in logic and algorithms (μΠλΑ) at the University of Athens, Greece (2000). He received his Ph.D. in 2006 from MIT under the supervision of Micheal Sipser; the title of his Ph.D. thesis was "Algorithms and lower bounds for finite automata size complexity."
Previously, Kapoutsis worked as a postdoctoral researcher at ETH-Zurich under the supervision of Juraj Hromkovic, a visiting lecturer at the University of Cyprus, and a postdoctoral researcher at the Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA) in Paris (Marie-Curie Fellow, 2010-2012).
Ph.D., Computer Science, MIT. Thesis: Algorithms and lower bounds for finite automata size complexity.
M.Sc., Master Program in Logic and Algorithms (μΠλΑ), University of Athens, Greece
B.Sc., Informatics, Aristotle University of Thessaloniki, Greece