Travelled to:
1 × Canada
1 × France
1 × Israel
1 × Spain
16 × USA
Collaborated with:
S.S.Cosmadakis G.G.Hillebrand C.H.Papadimitriou S.Abiteboul M.Y.Vardi S.Ramaswamy H.G.Mairson ∅ J.C.Mitchell E.Waller G.M.Kuper P.Z.Revesz G.Grahne C.Dwork L.J.Stockmeyer N.Spyratos D.E.Vengroff J.S.Vitter H.Gaifman C.Beeri F.Bancilhon R.Ramakrishnan K.J.Goldman S.A.Goldman S.B.Zdonik M.Yannakakis
Talks about:
languag (5) databas (5) queri (5) constraint (4) type (4) program (3) theori (3) polymorph (2) parallel (2) function (2)
Person: Paris C. Kanellakis
DBLP: Kanellakis:Paris_C=
Facilitated 1 volumes:
Contributed to:
Wrote 25 papers:
- LICS-1996-HillebrandK #on the #power of #λ-calculus
- On the Expressive Power of Simply Typed and Let-Polymorphic λ Calculi (GGH, PCK), pp. 253–263.
- PODS-1995-Kanellakis #constraints #database #programming #tutorial
- Constraint Programming and Database Languages: A Tutorial (PCK), pp. 46–53.
- SIGMOD-1995-RamaswamyK
- OODB Indexing by Class-Division (SR, PCK), pp. 139–150.
- ICALP-1994-KanellakisHM #analysis #re-engineering
- An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (PCK, GGH, HGM), pp. 83–105.
- PODS-1994-HillebrandK #database #functional #order #query #λ-calculus
- Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.
- PODS-1993-KanellakisRVV #constraints #modelling
- Indexing for Data Models with Constraints and Classes (PCK, SR, DEV, JSV), pp. 233–243.
- PODS-1991-HillebrandKMV #bound #datalog #tool support
- Tools for Datalog Boundedness (GGH, PCK, HGM, MYV), pp. 1–12.
- PODS-1990-AbiteboulKW
- Method Schemas (SA, PCK, EW), pp. 16–27.
- PODS-1990-KanellakisKR #constraints #query
- Constraint Query Languages (PCK, GMK, PZR), pp. 299–313.
- POPL-1989-KanellakisM #ml #polymorphism #type system #unification
- Polymorphic Unification and ML Typing (PCK, JCM), pp. 105–115.
- SIGMOD-1989-AbiteboulK #query
- Object Identity as a Query Language Primitive (SA, PCK), pp. 159–173.
- 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-1987-BeeriKBR #bound #logic programming #source code
- Bounds on the Propagation of Selection into Logic Programs (CB, PCK, FB, RR), pp. 214–226.
- SIGMOD-1987-AbiteboulKG #on the #query #representation #set
- On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.
- CADE-1986-DworkCKS #algorithm #parallel
- Parallel Algorithms for Term Matching (CD, PCK, LJS), pp. 416–430.
- 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.
- SIGMOD-1985-GoldmanGKZ #information management #interface #named #semantics
- ISIS: Interface for a Semantic Information System (KJG, SAG, PCK, SBZ), pp. 328–342.
- 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.
- STOC-1983-KanellakisCV #dependence #polynomial #problem
- Unary Inclusion Dependencies have Polynomial Time Inference Problems (PCK, SSC, MYV), pp. 264–277.
- PODS-1982-KanellakisP #distributed #question
- Is Distributed Locking Harder? (PCK, CHP), pp. 98–107.
- PODS-1982-PapadimitriouK #concurrent #multi #on the
- On Concurrency Control by Multiple Versions (CHP, PCK), pp. 76–82.