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 (1950-07-04) 4 July 1950 (age 74)
Alma materUniversity of Athens
UCLA
AwardsGuggenheim Fellowship
NKUA Honorary Doctorate
Alonzo Church Award
Scientific career
FieldsDatabase systems
Logic in Computer Science
Computational Complexity
Institutions
Doctoral advisorYiannis N. Moschovakis
Websiteusers.soe.ucsc.edu/~kolaitis/

Education

edit

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]

Career and research

edit

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]

Selected publications

edit

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]

Recognition

edit

References

edit
  1. ^ "Curriculum Vitae. Phokion G. Kolaitis" (PDF).
  2. ^ "Phokion Kolaitis Special Event at SIGMOD 2019".
  3. ^ Fagin, Ronald; Kolaitis, Phokion G.; Miller, Renée J.; Popa, Lucian (25 May 2005). "Data exchange: semantics and query answering". Theoretical Computer Science. 336 (1): 89–124. doi:10.1016/j.tcs.2004.10.033. ISSN 0304-3975.
  4. ^ Kolaitis, Phokion G.; Vardi, Moshe Y. (1 October 2000). "Conjunctive-Query Containment and Constraint Satisfaction". Journal of Computer and System Sciences. 61 (2): 302–332. doi:10.1006/jcss.2000.1713. ISSN 0022-0000.
  5. ^ Fagin, Ronald; Kolaitis, Phokion G.; Popa, Lucian (1 March 2005). "Data exchange: getting to the core". ACM Transactions on Database Systems. 30 (1): 174–210. doi:10.1145/1061318.1061323. ISSN 0362-5915. S2CID 59942308.
  6. ^ Fagin, Ronald; Kolaitis, Phokion G.; Popa, Lucian; Tan, Wang-Chiew (1 December 2005). "Composing schema mappings: Second-order dependencies to the rescue". ACM Transactions on Database Systems. 30 (4): 994–1055. doi:10.1145/1114244.1114249. ISSN 0362-5915. S2CID 5768010.
  7. ^ Grädel, Erich; Kolaitis, Phokion G.; Vardi, Moshe Y. (1997). "On the Decision Problem for Two-Variable First-Order Logic". The Bulletin of Symbolic Logic. 3 (1): 53–69. doi:10.2307/421196. ISSN 1079-8986. JSTOR 421196. S2CID 14868390.
  8. ^ "2005 ACM Fellows".
  9. ^ "AAAS Fellows".
  10. ^ "NKUA Doctorate".
  11. ^ "2020 Alonzo Church Award".
edit