Stathis Zachos
Stathis K. Zachos is a mathematician, logician and theoretical computer scientist.Biography
Zachos received his PhD from the ETHZ in Mathematics, 1978. He has held the posts of professor in Computer Science at UCSB, CUNY and NTUA and Adjunct professor at ETHZ. He has worked as a researcher at MIT, Brown-Boveri.
Stathis has published research papers in several areas of Computer Science. His work on Randomized Complexity Classes, Arthur–Merlin Games, and Interactive Proof Systems has been very influential in proving important theorems and is cited in main textbooks of computational complexity. One of his important contributions, using Interactive Proof Systems and Probabilistic Quantifiers, is that the Graph isomorphism Problem is not likely to be NP-complete. Graph Isomorphism is one of the very few celebrated problems in NP that have not been shown yet to be either NP-Complete or in P. Zachos's most influential work was introducing and proving properties of the class Parity-P. He also introduced Probabilistic Quantifiers and Alternations of Probabilistic Quantifiers to uniformly describe various Complexity Classes as well as Interactive Proof Systems and Probabilistic Games.
His current interests include Probabilistic and Functional Complexity Classes, Combinatory Algebras as a foundation to Theory of Computations, the interconnections of Cryptographic Techniques and Computational Complexity as well as Algorithms for Graph Problems. He has co-organized International Conferences: STOC '87, ICALP, CiE, PLS, ASL European Summer Meeting, ACAC and NYCAC.
He is the brother of theoretical physicist Cosmas Zachos.
