Stavros S. Cosmadakis

Dimitris J. Kavvadias

Lina Panagopoulou

Theor. Comput. Sci., 2020

2010

Undecidability and intractability results concerning datalog programs and their persistency numbers.

[BibT_eX]

[DOI]

Eugénie Foustoucos

Anastasios Sidiropoulos

ACM Trans. Comput. Log., 2010

2005

Datalog programs and their persistency numbers.

[BibT_eX]

[DOI]

Eugénie Foustoucos

ACM Trans. Comput. Log., 2005

2002

Inherent Complexity of Recursive Queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

2001

On the orthographic dimension of definable sets.

[BibT_eX]

[DOI]

Gabriel M. Kuper

Leonid Libkin

Inf. Process. Lett., 2001

View Serializable Updates of Concurrent Index Structures.

[BibT_eX]

[DOI]

Kleoni Ioannidou

Stergios Stergiou

Proceedings of the Database Programming Languages, 8th International Workshop, 2001

1999

Inherent Complexity of Recursive Queries (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Optimization of Nested SQL Queries by Tableau Equivalence.

[BibT_eX]

[DOI]

Vasilis Aggelis

Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

1995

On Datalog vs. Polynomial Time.

[BibT_eX]

[DOI]

Mihalis Yannakakis

J. Comput. Syst. Sci., 1995

1994

Linear vs Polynomial Constraints in Database Query Languages.

[BibT_eX]

[DOI]

Stéphane Grumbach

Gabriel M. Kuper

Proceedings of the Principles and Practice of Constraint Programming, 1994

Complete Proof Systems for Algebraic Simply-Typed Terms.

[BibT_eX]

[DOI]

Proceedings of the 1994 ACM Conference on LISP and Functional Programming, 1994

1993

Logical Reducibility and Monadic NP

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1990

Polynomial-Time Implication Problems for Unary Inclusion Dependencies

[BibT_eX]

[DOI]

Moshe Y. Vardi

J. ACM, January, 1990

Completeness for typed lazy inequalities

[BibT_eX]

[DOI]

Albert R. Meyer

Jon G. Riecke

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

Expressiveness of Restricted Recursive Queries (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On the First-Order Expressibility of Recursive Queries.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Computing with Recursive Types (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988

The Word and Generator Problems for Lattices

[BibT_eX]

[DOI]

Inf. Comput., June, 1988

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)

[BibT_eX]

[DOI]

Haim Gaifman

Moshe Y. Vardi

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

The Complexity of Minimizing Wire Lengths in VLSI Layouts.

[BibT_eX]

[DOI]

Sandeep N. Bhatt

Inf. Process. Lett., 1987

Database Theory and Cylindric Lattices (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Partition Semantics for Relations.

[BibT_eX]

[DOI]

Nicolas Spyratos

J. Comput. Syst. Sci., 1986

The Complexity of the Travelling Repairman Problem.

[BibT_eX]

[DOI]

George Papageorgiou

Nadia Papakostantinou

RAIRO Theor. Informatics Appl., 1986

Functional and Inclusion Dependencies.

[BibT_eX]

Adv. Comput. Res., 1986

Parallel Evaluation of Recursive Rule Queries.

[BibT_eX]

[DOI]

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

1985

Equational Theories and Database Constraints

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Two Applications of Equational Theories to Database Theory.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984

The Traveling Salesman Problem with Many Visits to Few Cities.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Updates of Relational Views.

[BibT_eX]

[DOI]

J. ACM, 1984

Functional and Inclusion Dependencies: A Graph Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983

The Complexity of Evaluating Relational Queries

[BibT_eX]

[DOI]

Inf. Control., 1983

Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)

[BibT_eX]

[DOI]

Moshe Y. Vardi

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract).

[BibT_eX]

[DOI]

Mihalis Yannakakis