P
Phokion G. Kolaitis
Researcher at University of California, Santa Cruz
Publications - 240
Citations - 10403
Phokion G. Kolaitis is an academic researcher from University of California, Santa Cruz. The author has contributed to research in topics: Data exchange & Conjunctive query. The author has an hindex of 52, co-authored 232 publications receiving 9956 citations. Previous affiliations of Phokion G. Kolaitis include Occidental College & University of Chicago.
Papers
More filters
Posted Content
Computational Social Choice Meets Databases
TL;DR: In this paper, the authors develop a novel framework that aims to create bridges between the computational social choice and the database management communities, and establish a number of results about the complexity of the necessary answers of conjunctive queries involving positional scoring rules.
Journal ArticleDOI
Can Datalog Be Approximated
TL;DR: It is shown that for several large and well-studied classes of unbounded Datalog predicates it is not possible to find finite unions of conjunctive queries that satisfy the aforementioned qualitative criteria and have the property that the relative error of the approximation is bounded by a constant.
Journal ArticleDOI
Paper and proposal reviews: is the process flawed?
Henry F. Korth,Philip A. Bernstein,Mary Fernández,Le Gruenwald,Phokion G. Kolaitis,Kathryn S. McKinley,Tamer Özsu +6 more
TL;DR: This short paper summarizes the panelists' presentations and audience commentary on paper and proposal reviews and concludes with some observations and suggestions on how to address this issue in the near-term future.
Journal ArticleDOI
Integer Programming as a Framework for Optimization and Approximability
TL;DR: Structural approximation theory seeks to provide a framework for expressing optimization problems and isolating structural or syntactic conditions that explain the apparent difference in the approximation properties of different NP-optimization problems as discussed by the authors.
Proceedings ArticleDOI
Decision Problems in Information Theory
TL;DR: An investigation of decision problems about constraints on entropies is initiated by placing several different such problems into levels of the arithmetical hierarchy and it is proved that the classical implication problem for conditional independence statements is co-recursively enumerable.