Stavros S. Cosmadakis

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