Stavros S. Cosmadakis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2020

Resolution based algorithms for the transversal hypergraph generation problemStavros S. Cosmadakis, Dimitris J. Kavvadias, Lina Panagopoulou. TCS, 815:1-10, 2020. [doi]

2010

Undecidability and intractability results concerning datalog programs and their persistency numbersStavros S. Cosmadakis, EugÃ©nie Foustoucos, Anastasios Sidiropoulos. tocl, 11(2), 2010. [doi]

2005

Datalog programs and their persistency numbersFoto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos. tocl, 6(3):481-518, 2005. [doi]

2002

Inherent Complexity of Recursive QueriesStavros S. Cosmadakis. jcss, 64(3):466-495, 2002. [doi]

2001

View Serializable Updates of Concurrent Index StructuresStavros S. Cosmadakis, Kleoni Ioannidou, Stergios Stergiou. DBPL 2002: 247-262 [doi]

On the orthographic dimension of definable setsStavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin. ipl, 79(3):141-145, 2001. [doi]

1999

Optimization of Nested SQL Queries by Tableau EquivalenceVasilis Aggelis, Stavros S. Cosmadakis. DBPL 2000: 31-42 [doi]

Inherent Complexity of Recursive Queries (Extended Abstract)Stavros S. Cosmadakis. PODS 1999: 148-154 [doi]

1995

On Datalog vs. Polynomial TimeFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. jcss, 51(2):177-196, 1995.

1994

Linear vs Polynomial Constraints in Database Query LanguagesFoto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper. ppcp 1994: 181-192

Complete Proof Systems for Algebraic Simply-Typed TermsStavros S. Cosmadakis. lfp 1994: 220-226 [doi]

1993

Logical Reducibility and Monadic NPStavros S. Cosmadakis. focs 1993: 52-61

1991

On Datalog vs. Polynomial TimeFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. PODS 1991: 13-25 [doi]

1990

Completeness for typed lazy inequalitiesStavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke. lics 1990: 312-320

Polynomial-Time Implication Problems for Unary Inclusion DependenciesStavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi. JACM, 37(1):15-46, January 1990. [doi]

1989

Expressiveness of Restricted Recursive Queries (Extended Abstract)Foto N. Afrati, Stavros S. Cosmadakis. stoc 1989: 113-126

On the First-Order Expressibility of Recursive QueriesStavros S. Cosmadakis. PODS 1989: 311-323 [doi]

Computing with Recursive Types (Extended Abstract)Stavros S. Cosmadakis. lics 1989: 24-38

1988

The Word and Generator Problems for LatticesStavros S. Cosmadakis. iandc, 77(3):192-217, June 1988.

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi. stoc 1988: 477-490

1987

The Complexity of Minimizing Wire Lengths in VLSI LayoutsSandeep N. Bhatt, Stavros S. Cosmadakis. ipl, 25(4):263-267, 1987.

Database Theory and Cylindric Lattices (Extended Abstract)Stavros S. Cosmadakis. focs 1987: 411-420

1986

1985

Equational Theories and Database ConstraintsStavros S. Cosmadakis, Paris C. Kanellakis. stoc 1985: 273-284

Two Applications of Equational Theories to Database TheoryStavros S. Cosmadakis, Paris C. Kanellakis. RTA 1985: 107-123

Partition Semantics for RelationsStavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos. PODS 1985: 261-275 [doi]

1984

Functional and Inclusion Dependencies: A Graph Theoretic ApproachStavros S. Cosmadakis, Paris C. Kanellakis. PODS 1984: 29-37 [doi]

The Traveling Salesman Problem with Many Visits to Few CitiesStavros S. Cosmadakis, Christos H. Papadimitriou. SICOMP, 13(1):99-108, 1984.

Updates of Relational ViewsStavros S. Cosmadakis, Christos H. Papadimitriou. JACM, 31(4):742-760, 1984. [doi]

1983

Sign in or sign up to see more results.

runs on WebDSL