Travelled to:1 × Canada
1 × France
1 × Spain
13 × USA
Collaborated with:P.C.Kanellakis ∅ F.N.Afrati C.H.Papadimitriou M.Yannakakis M.Y.Vardi A.R.Meyer J.G.Riecke N.Spyratos H.Gaifman
Talks about:recurs (5) queri (5) databas (3) theori (3) relat (3) type (3) polynomi (2) problem (2) express (2) complex (2)
Person: Stavros S. Cosmadakis
DBLP: Cosmadakis:Stavros_S=
Contributed to:
1999
19941991
199019891989
1989198819861985
198519851984
198319831983Wrote 17 papers:
- PODS-1999-Cosmadakis #complexity #query #recursion
- Inherent Complexity of Recursive Queries (SSC), pp. 148–154.
- LFP-1994-Cosmadakis #algebra #proving
- Complete Proof Systems for Algebraic Simply-Typed Terms (SSC), pp. 220–226.
- PODS-1991-AfratiCY #datalog #on the #polynomial
- On Datalog vs. Polynomial Time (FNA, SSC, MY), pp. 13–25.
- LICS-1990-CosmadakisMR #lazy evaluation
- Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.
- LICS-1989-Cosmadakis #recursion
- Computing with Recursive Types (SSC), pp. 24–38.
- PODS-1989-Cosmadakis #first-order #on the #query #recursion
- On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
- STOC-1989-AfratiC #query #recursion #strict
- Expressiveness of Restricted Recursive Queries (FNA, SSC), pp. 113–126.
- STOC-1988-CosmadakisGKV #database #decidability #logic programming #optimisation #problem #source code
- Decidable Optimization Problems for Database Logic Programs (SSC, HG, PCK, MYV), pp. 477–490.
- PODS-1986-CosmadakisK #evaluation #parallel #query #recursion
- Parallel Evaluation of Recursive Rule Queries (SSC, PCK), pp. 280–293.
- PODS-1985-CosmadakisKS #semantics
- Partition Semantics for Relations (SSC, PCK, NS), pp. 261–275.
- RTA-1985-CosmadakisK #database #equation
- Two Applications of Equational Theories to Database Theory (SSC, PCK), pp. 107–123.
- STOC-1985-CosmadakisK #constraints #database #equation
- Equational Theories and Database Constraints (SSC, PCK), pp. 273–284.
- PODS-1984-CosmadakisK #approach #dependence #functional #graph
- Functional and Inclusion Dependencies: A Graph Theoretic Approach (SSC, PCK), pp. 29–37.
- ICALP-1983-YannakakisKCP #clustering #graph
- Cutting and Partitioning a Graph aifter a Fixed Pattern (MY, PCK, SSC, CHP), pp. 712–722.
- PODS-1983-Cosmadakis #complexity #query #relational
- The Complexity of Evaluating Relational Queries (SSC), pp. 149–155.
- PODS-1983-Cosmadakis83a #relational
- Updates of Relational Views (SSC, CHP), pp. 317–331.
- STOC-1983-KanellakisCV #dependence #polynomial #problem
- Unary Inclusion Dependencies have Polynomial Time Inference Problems (PCK, SSC, MYV), pp. 264–277.