2026 Phokion G. Kolaitis: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	56	4064	3950	1934	1867	223	12955

Research.com Recognitions

2017 - Member of Academia Europaea
2010 - Fellow of the American Association for the Advancement of Science (AAAS)
2005 - ACM Fellow For contributions to logic in computer science.
1993 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

Phokion G. Kolaitis is affiliated with the University of California, Santa Cruz in the United States. Their research primarily spans the field of Computer Science, with substantial contributions in several subfields and topics related to logic, database systems, and artificial intelligence.

The main areas of study include:

Artificial Intelligence
Computer Networks and Communications
Computational Theory and Mathematics
Signal Processing
Management Science and Operations Research

Their prominent research topics encompass:

Advanced Database Systems and Queries
Semantic Web and Ontologies
Logic, Reasoning, and Knowledge
Data Management and Algorithms
Advanced Algebra and Logic
Data Quality and Management
Computability, Logic, AI Algorithms

Kolaitis has published in various respected venues, including:

arXiv (Cornell University)
Proceedings of the ACM on Management of Data
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Database Systems
ACM SIGMOD Record

Recent scholarly works include:

"Decision Problems in Information Theory" (2020), arXiv (Cornell University)
"Bag Query Containment and Information Theory" (2021), ACM Transactions on Database Systems
"Ontology-Enriched Query Answering on Relational Databases" (2021), Proceedings of the AAAI Conference on Artificial Intelligence
"On the Language of Nested Tuple Generating Dependencies" (2020), ACM Transactions on Database Systems
"Logic and Learning (Dagstuhl Seminar 19361)" (2020), Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators include:

Albert Atserias
Ronald Fagin
Neil Immerman
Jonathan Lenchner
Rik Sengupta

The awards received by Kolaitis over their career include:

Member of Academia Europaea (2017)
Fellow of the American Association for the Advancement of Science (AAAS) (2010)
ACM Fellow (2005), recognized for contributions to logic in computer science
Fellow of John Simon Guggenheim Memorial Foundation (1993)

Best Publications

Data exchange: semantics and query answering

Ronald Fagin;Phokion G. Kolaitis;Renée J. Miller;Lucian Popa

1675
Citations
Data Exchange: Semantics and Query Answering

Ronald Fagin;Phokion G. Kolaitis;Renée J. Miller;Lucian Popa

1588
Citations
Data exchange: getting to the core

Ronald Fagin;Phokion G. Kolaitis;Lucian Popa

543
Citations
Constraint satisfaction, bounded treewidth, and finite-variable logics

Victor Dalmau;Phokion G. Kolaitis;Moshe Y. Vardi

513
Citations
Composing schema mappings: second-order dependencies to the rescue

Ronald Fagin;Phokion G. Kolaitis;Lucian Popa;Wang-Chiew Tan

450
Citations
Conjunctive-query containment and constraint satisfaction

Phokion G. Kolaitis;Moshe Y. Vardi

442
Citations
On the Decision Problem for Two-Variable First-Order Logic

Erich Grädel;Phokion G. Kolaitis;Moshe Y. Vardi

440
Citations
Schema mappings, data exchange, and metadata management

Phokion G. Kolaitis

375
Citations
Generalized quantifiers and pebble games on finite structures

Phokion G. Kolaitis;Jouko A. Väänänen

332
Citations
Finite Model Theory and Its Applications

E. Grädel;P. Kolaitis;L. Libkin;M.J. Marx

268
Citations
Why not negation by fixpoint

Phokion G. Kolaitis;Christos H. Papadimitriou

236
Citations
Infinitary logics and 0–1 laws

Phokion G. Kolaitis;Moshe Y. Vardi

213
Citations
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

Parikshit Gopalan;Phokion G. Kolaitis;Elitza Maneva;Christos H. Papadimitriou

207
Citations
Peer data exchange

Ariel Fuxman;Phokion G. Kolaitis;Renée J. Miller;Wang-Chiew Tan

192
Citations
On the expressive power of datalog: tools and a case study

Phokion G. Kolaitis;Moshe Y. Vardi

180
Citations
Repair checking in inconsistent databases: algorithms and complexity

Foto N. Afrati;Phokion G. Kolaitis

177
Citations
On the unusual effectiveness of logic in computer science

Joseph Y. Halpern;Robert Harper;Neil Immerman;Phokion G. Kolaitis

168
Citations
The expressive power of stratified logic programs

Phokion G. Kolaitis

158
Citations
Logical definability of NP optimization problems

Phokion G. Kolaitis;Madhukar N. Thakur

148
Citations
Approximation Properties of NP Minimization Classes

P.G. Kolaitis;M.N. Thakur

139
Citations
Composing schema mappings: Second-order dependencies to the rescue

Unknown

85
Citations

Frequent Co-Authors

Moshe Y. Vardi Rice University

Wang-Chiew Tan Facebook (United States)

Ronald Fagin IBM (United States)

Lucian Popa IBM (United States)

Christos H. Papadimitriou Columbia University

Erich Grädel RWTH Aachen University

Dan Suciu University of Washington

Maurizio Lenzerini Sapienza University of Rome

Leonid Libkin University of Edinburgh

Simone Severini University College London

External Links

Wikipedia of Phokion G. Kolaitis Personal website of Phokion G. Kolaitis Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Considering an online degree can open more flexible and affordable pathways for advancing your education in Computer Science or related fields. Today, some of the most affordable online doctoral programs make it possible to gain advanced expertise without the high costs or need to relocate.

If you're interested in leadership within educational technology or curriculum design, pursuing the cheapest online doctorate in educational leadership can fast-track your career while you continue to work. For those looking for quicker entry into the industry, exploring a 6 month degree course can provide foundational skills in a shorter timeframe.

Additionally, opting for a second major or complementing your Computer Science degree with a business focus can expand your job prospects. Many students benefit from the business degree programs available online, which are both cost-effective and flexible.

Ultimately, these pathways provide diverse opportunities to tailor your education and career for future success in both technology and management roles.