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
Proceedings ArticleDOI
The complexity of mining maximal frequent subgraphs
TL;DR: A comprehensive investigation of the computational complexity of mining maximal frequent subgraphs, focusing on specific classes of connected graphs and establishing that the following problem is NP-complete: given two unlabeled trees, do they have more than one maximal subtree in common?
Book ChapterDOI
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
TL;DR: In this article, the authors consider fragments of existential second-order logic in which the first-order part belongs to a prefix class and show that the classifications of prefix classes with equality according to the solvability of the finite satisfiability problem are identical for the corresponding +11 fragments.
Journal ArticleDOI
The Complexity of Mining Maximal Frequent Subgraphs
TL;DR: A comprehensive investigation of the computational complexity of mining maximal frequent subgraphs, focusing on specific classes of connected graphs and establishing that the following problem is NP-complete: given two unlabeled trees, do they have more than one maximal subtree in common?
Book ChapterDOI
The Complexity of Minimal Satisfiability Problems
TL;DR: The question of whether dichotomy theorems can be proved for these problems was raised at that time, but was left open, and is settled affirmatively by establishing a dichotomy theorem for the class of all MIN SAT(S)-problems.
Journal ArticleDOI
Reverse data exchange: Coping with nulls
TL;DR: A new framework for reverse data exchange is developed that supports source instances that may contain nulls, and is overcome the semantic mismatch between source and target instances of the previous formalizations, and introduces the notions of extended identity schema mapping, extended inverse, and maximum extended recovery.