Paris C. Kanellakis

According to our database, Paris C. Kanellakis authored at least 67 papers between 1980 and 1998.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1998

Object Identity as a Query Language Primitive.

Serge Abiteboul, Paris C. Kanellakis

J. ACM, 1998

1996

Indexing for Data Models with Constraints and Classes.

Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter

J. Comput. Syst. Sci., 1996

Parallel Algorithms with Processor Failures and Delays.

Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman

J. Algorithms, 1996

Database Query Languages Embedded in the Typed Lambda Calculus.

Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson

Inf. Comput., 1996

Constraint Query Algebras.

Dina Q. Goldin, Paris C. Kanellakis

Constraints An Int. J., 1996

On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi.

Gerd G. Hillebrand, Paris C. Kanellakis

Proceedings of the Proceedings, 1996

1995

Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms.

Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman

Nord. J. Comput., 1995

Undecidable Boundedness Problems for Datalog Programs.

Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi

J. Log. Program., 1995

Constraint Query Languages.

Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz

J. Comput. Syst. Sci., 1995

Method Schemas.

Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller

J. Comput. Syst. Sci., 1995

OODB Indexing by Class-Division.

Sridhar Ramaswamy, Paris C. Kanellakis

Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995

Constraint Programming and Database Languages: A Tutorial.

Paris C. Kanellakis

Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

Data Mapping and Matching: Languages for Scientific Datasets.

Paris C. Kanellakis

Proceedings of the Database Programming Languages (DBPL-5), 1995

On Similarity Queries for Time-Series Data: Constraint Specification and Implementation.

Dina Q. Goldin, Paris C. Kanellakis

Proceedings of the Principles and Practice of Constraint Programming, 1995

1994

Database querying and constraint programming.

Paris C. Kanellakis

SIGACT News, 1994

Constraint Programming and Database Query Languages.

Paris C. Kanellakis, Dina Q. Goldin

Proceedings of the Theoretical Aspects of Computer Software, 1994

Functional Database Query Languages as Typed Lambda Calculi of Fixed Order.

Gerd G. Hillebrand, Paris C. Kanellakis

Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction.

Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations.

Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman

Proceedings of the CONCUR '94, 1994

1993

Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract).

Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Functional Programming Formalisms for OODBMS Methods.

Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy

Proceedings of the Advances in Object-Oriented Database Systems, 1993

1992

Efficient Parallel Algorithms can be Made Robust.

Paris C. Kanellakis, Alexander A. Shvartsman

Distributed Comput., 1992

Introduction to the Data Model.

Paris C. Kanellakis, Christophe Lécluse, Philippe Richard

Proceedings of the Building an Object-Oriented Database System, The Story of O2, 1992

Introduction to the Programming Environment.

Claude Delobel, Paris C. Kanellakis, Didier Plateau

Proceedings of the Building an Object-Oriented Database System, The Story of O2, 1992

Method Schemas.

Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller

Proceedings of the Building an Object-Oriented Database System, The Story of O2, 1992

Object Identity as a Query Language Primitive.

Serge Abiteboul, Paris C. Kanellakis

Proceedings of the Building an Object-Oriented Database System, The Story of O2, 1992

1991

On the Representation and Querying of Sets of Possible Worlds.

Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne

Theor. Comput. Sci., 1991

The Two Facets of Object-Oriented Data Models.

Serge Abiteboul, Paris C. Kanellakis

IEEE Data Eng. Bull., 1991

A Data Dtructure for Arc Insertion and Regular Path Finding.

Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter

Ann. Math. Artif. Intell., 1991

Tools for Datalog Boundedness.

Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi

Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

Efficient Parallel Algorithms on Restartable Fail-Stop Processors.

Paris C. Kanellakis, Alexander A. Shvartsman

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Unification and ML-Type Reconstruction.

Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell

Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990

CCS Expressions, Finite State Processes, and Three Problems of Equivalence

Paris C. Kanellakis, Scott A. Smolka

Inf. Comput., May, 1990

Polynomial-Time Implication Problems for Unary Inclusion Dependencies

Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi

J. ACM, January, 1990

New Hope on Data Models and Types: Report of an NSF-INRIA Workshop.

Serge Abiteboul, Peter Buneman, Claude Delobel, Richard Hull, Paris C. Kanellakis, Victor Vianu

SIGMOD Rec., 1990

Database Theory Column: Query Languages for Complex Object Databases.

Serge Abiteboul, Paris C. Kanellakis

SIGACT News, 1990

Bounds on the Propagation of Selection into Logic Programs.

Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan

J. Comput. Syst. Sci., 1990

A Data Structure for Arc Insertion and Regular Path Finding.

Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Method Schemas.

Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

Elements of Relational Database Theory.

Paris C. Kanellakis

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Database Theory Column: Deciding Bounded Recursion in Database Logic Programs.

Paris C. Kanellakis, Serge Abiteboul

SIGACT News, 1989

On the Relationship of Congruence Closure and Unification.

Paris C. Kanellakis, Peter Z. Revesz

J. Symb. Comput., 1989

Polymorphic Unification and ML Typing.

Paris C. Kanellakis, John C. Mitchell

Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

A Logical Database Query Language with Object Identity and Strong Typing.

Paris C. Kanellakis, Serge Abiteboul

Proceedings of the Logic Programming, 1989

1988

Parallel Algorithms for Term Matching.

Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer

SIAM J. Comput., 1988

On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.

Paris C. Kanellakis, Scott A. Smolka

Algorithmica, 1988

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)

Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Logic Programming and Parallel Complexity

Paris C. Kanellakis

Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1987

Report on the 6th Symposium on Principles of Database Systems.

Paris C. Kanellakis

SIGMOD Rec., 1987

1986

Partition Semantics for Relations.

Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos

J. Comput. Syst. Sci., 1986

Functional and Inclusion Dependencies.

Stavros S. Cosmadakis, Paris C. Kanellakis

Adv. Comput. Res., 1986

Pushing Selections into Logic Programs.

François Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan

Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

Parallel Evaluation of Recursive Rule Queries.

Stavros S. Cosmadakis, Paris C. Kanellakis

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Logic Programming and Parallel Complexity.

Paris C. Kanellakis

Proceedings of the ICDT'86, 1986

1985

The Complexity of Distributed Concurrency Control.

Paris C. Kanellakis, Christos H. Papadimitriou

SIAM J. Comput., 1985

Equational Theories and Database Constraints

Stavros S. Cosmadakis, Paris C. Kanellakis

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

ISIS: Interface for a Semantic Information System.

Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik

Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, 1985

Two Applications of Equational Theories to Database Theory.

Stavros S. Cosmadakis, Paris C. Kanellakis

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984

On Concurrency Control by Multiple Versions.

Christos H. Papadimitriou, Paris C. Kanellakis

ACM Trans. Database Syst., 1984

On the Sequential Nature of Unification.

Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell

J. Log. Program., 1984

Is Distributed Locking Harder?

Paris C. Kanellakis, Christos H. Papadimitriou

J. Comput. Syst. Sci., 1984

Functional and Inclusion Dependencies: A Graph Theoretic Approach.

Stavros S. Cosmadakis, Paris C. Kanellakis

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983

Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)

Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract).

Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou

Proceedings of the Automata, 1983

1980

Flowshop scheduling with limited temporary storage.

Christos H. Papadimitriou, Paris C. Kanellakis

J. ACM, 1980

On the Computational Complexity of Cardinality Constraints in Relational Databases.

Paris C. Kanellakis

Inf. Process. Lett., 1980

Local Search for the Asymmetric Traveling Salesman Problem.

Paris C. Kanellakis, Christos H. Papadimitriou

Oper. Res., 1980