Stavros S. Cosmadakis

Publication Activity (10 Years)

Years Active: 1983-2020
Publications (10 Years): 1

Top Topics

Computationally Expensive

Computational Efficiency

Machine Learning Algorithms

Orders Of Magnitude

Top Venues

Theor. Comput. Sci.

Publications

Stavros S. Cosmadakis, Dimitris J. Kavvadias, Lina Panagopoulou
Resolution based algorithms for the transversal hypergraph generation problem. Theor. Comput. Sci. 815 (2020)
Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos
Undecidability and intractability results concerning datalog programs and their persistency numbers. ACM Trans. Comput. Log. 11 (2) (2010)
Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos
Datalog programs and their persistency numbers. ACM Trans. Comput. Log. 6 (3) (2005)
Stavros S. Cosmadakis
Inherent Complexity of Recursive Queries. J. Comput. Syst. Sci. 64 (3) (2002)
Stavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin
On the orthographic dimension of definable sets. Inf. Process. Lett. 79 (3) (2001)
Stavros S. Cosmadakis, Kleoni Ioannidou, Stergios Stergiou
View Serializable Updates of Concurrent Index Structures. DBPL (2001)
Stavros S. Cosmadakis
Inherent Complexity of Recursive Queries (Extended Abstract). PODS (1999)
Vasilis Aggelis, Stavros S. Cosmadakis
Optimization of Nested SQL Queries by Tableau Equivalence. DBPL (1999)
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51 (2) (1995)
Stavros S. Cosmadakis
Complete Proof Systems for Algebraic Simply-Typed Terms. LISP and Functional Programming (1994)
Foto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper
Linear vs Polynomial Constraints in Database Query Languages. PPCP (1994)
Stavros S. Cosmadakis
Logical Reducibility and Monadic NP FOCS (1993)
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. PODS (1991)
Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi
Polynomial-Time Implication Problems for Unary Inclusion Dependencies J. ACM 37 (1) (1990)
Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke
Completeness for typed lazy inequalities LICS (1990)
Stavros S. Cosmadakis
Computing with Recursive Types (Extended Abstract) LICS (1989)
Stavros S. Cosmadakis
On the First-Order Expressibility of Recursive Queries. PODS (1989)
Foto N. Afrati, Stavros S. Cosmadakis
Expressiveness of Restricted Recursive Queries (Extended Abstract) STOC (1989)
Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi
Decidable Optimization Problems for Database Logic Programs (Preliminary Report) STOC (1988)
Stavros S. Cosmadakis
The Word and Generator Problems for Lattices Inf. Comput. 77 (3) (1988)
Sandeep N. Bhatt, Stavros S. Cosmadakis
The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inf. Process. Lett. 25 (4) (1987)
Stavros S. Cosmadakis
Database Theory and Cylindric Lattices (Extended Abstract) FOCS (1987)
Stavros S. Cosmadakis, Paris C. Kanellakis
Parallel Evaluation of Recursive Rule Queries. PODS (1986)
Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou
The Complexity of the Travelling Repairman Problem. RAIRO Theor. Informatics Appl. 20 (1) (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies. Adv. Comput. Res. 3 (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
Partition Semantics for Relations. J. Comput. Syst. Sci. 33 (2) (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis
Two Applications of Equational Theories to Database Theory. RTA (1985)
Stavros S. Cosmadakis, Paris C. Kanellakis
Equational Theories and Database Constraints STOC (1985)
Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
Partition Semantics for Relations. PODS (1985)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies: A Graph Theoretic Approach. PODS (1984)
Stavros S. Cosmadakis, Christos H. Papadimitriou
Updates of Relational Views. J. ACM 31 (4) (1984)
Stavros S. Cosmadakis, Christos H. Papadimitriou
The Traveling Salesman Problem with Many Visits to Few Cities. SIAM J. Comput. 13 (1) (1984)
Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) STOC (1983)
Stavros S. Cosmadakis, Christos H. Papadimitriou
Updates of Relational Views. PODS (1983)
Stavros S. Cosmadakis
The Complexity of Evaluating Relational Queries. PODS (1983)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies. XP4.5 Workshop on Database Theory (1983)
Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). ICALP (1983)
Stavros S. Cosmadakis
The Complexity of Evaluating Relational Queries Inf. Control. 58 (1-3) (1983)