| 1996 | LICS | On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. | Gerd G. Hillebrand, Paris C. Kanellakis |
| 1995 | CP | On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. | Dina Q. Goldin, Paris C. Kanellakis |
| 1995 | PODS | Constraint Programming and Database Languages: A Tutorial. | Paris C. Kanellakis |
| 1995 | SIGMOD | OODB Indexing by Class-Division. | Sridhar Ramaswamy, Paris C. Kanellakis |
| 1994 | CONCUR | Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman |
| 1994 | ICALP | An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. | Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson |
| 1994 | PODS | Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. | Gerd G. Hillebrand, Paris C. Kanellakis |
| 1993 | LICS | Database Query Languages Embedded in the Typed Lambda Calculus | Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson |
| 1993 | PODS | Indexing for Data Models with Constraints and Classes. | Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter |
| 1991 | PODC | Efficient Parallel Algorithms on Restartable Fail-Stop Processors. | Paris C. Kanellakis, Alexander A. Shvartsman |
| 1991 | PODS | Tools for Datalog Boundedness. | Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi |
| 1990 | PODS | Method Schemas. | Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller |
| 1990 | PODS | Constraint Query Languages. | Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz |
| 1990 | SODA | A Data Structure for Arc Insertion and Regular Path Finding. | Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter |
| 1989 | ICLP | A Logical Database Query Language with Object Identity and Strong Typing. | Paris C. Kanellakis, Serge Abiteboul |
| 1989 | PODC | Efficient Parallel Algorithms Can Be Made Robust. | Paris C. Kanellakis, Alexander A. Shvartsman |
| 1989 | POPL | Polymorphic Unification and ML Typing. | Paris C. Kanellakis, John C. Mitchell |
| 1989 | SIGMOD | Object Identity as a Query Language Primitive. | Serge Abiteboul, Paris C. Kanellakis |
| 1988 | STOC | Decidable Optimization Problems for Database Logic Programs (Preliminary Report) | Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi |
| 1987 | PODS | Bounds on the Propagation of Selection into Logic Programs. | Catriel Beeri, Paris C. Kanellakis, Franois Bancilhon, Raghu Ramakrishnan |
| 1987 | SIGMOD | On the Representation and Querying of Sets of Possible Worlds. | Serge Abiteboul, Paris C. Kanellakis, Gsta Grahne |
| 1986 | CADE | Parallel Algorithms for Term Matching. | Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer |
| 1986 | ICDT | Logic Programming and Parallel Complexity. | Paris C. Kanellakis |
| 1986 | PODS | Parallel Evaluation of Recursive Rule Queries. | Stavros S. Cosmadakis, Paris C. Kanellakis |
| 1986 | XP | Pushing Selections into Logic Programs. | Franois Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan |
| 1985 | PODC | On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. | Paris C. Kanellakis, Scott A. Smolka |
| 1985 | PODS | Partition Semantics for Relations. | Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos |
| 1985 | SIGMOD | ISIS: Interface for a Semantic Information System. | Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik |
| 1985 | STOC | Equational Theories and Database Constraints | Stavros S. Cosmadakis, Paris C. Kanellakis |
| 1984 | PODS | Functional and Inclusion Dependencies: A Graph Theoretic Approach. | Stavros S. Cosmadakis, Paris C. Kanellakis |
| 1983 | ICALP | Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). | Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou |
| 1983 | PODC | CCS Expressions, Finite State Processes, and THree Problems of Equivalence. | Paris C. Kanellakis, Scott A. Smolka |
| 1983 | STOC | Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) | Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi |
| 1983 | XP | Functional and Inclusion Dependencies. | Stavros S. Cosmadakis, Paris C. Kanellakis |
| 1982 | PODS | Is Distributed Locking Harder? | Paris C. Kanellakis, Christos H. Papadimitriou |
| 1982 | PODS | On Concurrency Control by Multiple Versions. | Christos H. Papadimitriou, Paris C. Kanellakis |
| 1981 | FOCS | The Complexity of Distributed Concurrency Control | Paris C. Kanellakis, Christos H. Papadimitriou |