Phokion G. Kolaitis ACM (born July 4, 1950) is a computer scientist who is currently a Distinguished Research Professor at UC Santa Cruz and a Principal Research Staff Member at the IBM Almaden Research Center. His research interests include principles of database systems, logic in computer science, and computational complexity.
Phokion G. Kolaitis | |
---|---|
Born | |
Alma mater | University of Athens UCLA |
Awards | Guggenheim Fellowship NKUA Honorary Doctorate Alonzo Church Award |
Scientific career | |
Fields | Database systems Logic in Computer Science Computational Complexity |
Institutions | |
Doctoral advisor | Yiannis N. Moschovakis |
Website | users |
Kolaitis obtained a bachelor's degree in mathematics from the University of Athens in 1973 and a master's degree and Ph.D in Mathematics from the University of California, Los Angeles in 1974 and 1978, respectively.[1]
Kolaitis is currently a Distinguished Research Professor at the Computer Science and Engineering Department of University of California, Santa Cruz. He is also a Principal Research Staff Member in the theory group at the IBM Almaden Research Center. He is known for his work on principles of database systems, logic in computer science, computational complexity, and other related fields.[2]
Data exchange: semantics and query answering, R Fagin, PG Kolaitis, RJ Miller, L Popa, Theoretical Computer Science 336 (1), 89-124[3]
Conjunctive-query containment and constraint satisfaction, PG Kolaitis, MY Vardi, Journal of Computer and System Sciences 61 (2), 302-332[4]
Data exchange: getting to the core, R Fagin, PG Kolaitis, L Popa, ACM Transactions on Database Systems (TODS) 30 (1), 174-210[5]
Composing schema mappings: Second-order dependencies to the rescue, R Fagin, PG Kolaitis, L Popa, WC Tan, ACM Transactions on Database Systems (TODS) 30 (4), 994-1055[6]
On the decision problem for two-variable first-order logic, E Grädel, PG Kolaitis, MY Vardi, Bulletin of Symbolic Logic, 53-69[7]