Paris C. Kanellakis

Publication Activity (10 Years)

Years Active: 1980-1998
Publications (10 Years): 0

Publications

Serge Abiteboul, Paris C. Kanellakis
Object Identity as a Query Language Primitive. J. ACM 45 (5) (1998)
Gerd G. Hillebrand, Paris C. Kanellakis
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. LICS (1996)
Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter
Indexing for Data Models with Constraints and Classes. J. Comput. Syst. Sci. 52 (3) (1996)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Database Query Languages Embedded in the Typed Lambda Calculus. Inf. Comput. 127 (2) (1996)
Dina Q. Goldin, Paris C. Kanellakis
Constraint Query Algebras. Constraints An Int. J. 1 (1/2) (1996)
Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20 (1) (1996)
Paris C. Kanellakis
Constraint Programming and Database Languages: A Tutorial. PODS (1995)
Sridhar Ramaswamy, Paris C. Kanellakis
OODB Indexing by Class-Division. SIGMOD Conference (1995)
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
Constraint Query Languages. J. Comput. Syst. Sci. 51 (1) (1995)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Undecidable Boundedness Problems for Datalog Programs. J. Log. Program. 25 (2) (1995)
Dina Q. Goldin, Paris C. Kanellakis
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. CP (1995)
Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller
Method Schemas. J. Comput. Syst. Sci. 51 (3) (1995)
Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Nord. J. Comput. 2 (2) (1995)
Paris C. Kanellakis
Data Mapping and Matching: Languages for Scientific Datasets. DBPL (1995)
Paris C. Kanellakis
Database querying and constraint programming. SIGACT News 25 (4) (1994)
Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. CONCUR (1994)
Gerd G. Hillebrand, Paris C. Kanellakis
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. PODS (1994)
Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. ICALP (1994)
Paris C. Kanellakis, Dina Q. Goldin
Constraint Programming and Database Query Languages. TACS (1994)
Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter
Indexing for Data Models with Constraints and Classes. PODS (1993)
Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). WDAG (1993)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Database Query Languages Embedded in the Typed Lambda Calculus LICS (1993)
Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy
Functional Programming Formalisms for OODBMS Methods. NATO ASI OODBS (1993)
Paris C. Kanellakis, Alexander A. Shvartsman
Efficient Parallel Algorithms can be Made Robust. Distributed Comput. 5 (4) (1992)
Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
Unification and ML-Type Reconstruction. Computational Logic - Essays in Honor of Alan Robinson (1991)
Paris C. Kanellakis, Alexander A. Shvartsman
Efficient Parallel Algorithms on Restartable Fail-Stop Processors. PODC (1991)
Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter
A Data Dtructure for Arc Insertion and Regular Path Finding. Ann. Math. Artif. Intell. 3 (2-4) (1991)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Tools for Datalog Boundedness. PODS (1991)
Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne
On the Representation and Querying of Sets of Possible Worlds. Theor. Comput. Sci. 78 (1) (1991)
Serge Abiteboul, Paris C. Kanellakis
The Two Facets of Object-Oriented Data Models. IEEE Data Eng. Bull. 14 (2) (1991)
Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
Bounds on the Propagation of Selection into Logic Programs. J. Comput. Syst. Sci. 41 (2) (1990)
Paris C. Kanellakis, Scott A. Smolka
CCS Expressions, Finite State Processes, and Three Problems of Equivalence Inf. Comput. 86 (1) (1990)
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
Constraint Query Languages. PODS (1990)
Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi
Polynomial-Time Implication Problems for Unary Inclusion Dependencies J. ACM 37 (1) (1990)
Serge Abiteboul, Peter Buneman, Claude Delobel, Richard Hull, Paris C. Kanellakis, Victor Vianu
New Hope on Data Models and Types: Report of an NSF-INRIA Workshop. SIGMOD Rec. 19 (4) (1990)
Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller
Method Schemas. PODS (1990)
Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter
A Data Structure for Arc Insertion and Regular Path Finding. SODA (1990)
Serge Abiteboul, Paris C. Kanellakis
Database Theory Column: Query Languages for Complex Object Databases. SIGACT News 21 (3) (1990)
Paris C. Kanellakis, Serge Abiteboul
Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. SIGACT News 20 (4) (1989)
Paris C. Kanellakis, Serge Abiteboul
A Logical Database Query Language with Object Identity and Strong Typing. ICLP (1989)
Paris C. Kanellakis, Alexander A. Shvartsman
Efficient Parallel Algorithms Can Be Made Robust. PODC (1989)
Serge Abiteboul, Paris C. Kanellakis
Object Identity as a Query Language Primitive. SIGMOD Conference (1989)
Paris C. Kanellakis, John C. Mitchell
Polymorphic Unification and ML Typing. POPL (1989)
Paris C. Kanellakis, Peter Z. Revesz
On the Relationship of Congruence Closure and Unification. J. Symb. Comput. 7 (3/4) (1989)
Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi
Decidable Optimization Problems for Database Logic Programs (Preliminary Report) STOC (1988)
Paris C. Kanellakis, Scott A. Smolka
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Algorithmica 3 (1988)
Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
Parallel Algorithms for Term Matching. SIAM J. Comput. 17 (4) (1988)
Paris C. Kanellakis, Peter Z. Revesz
On the Relationship of Congruence Closure and Unification. DBPL (1987)
Paris C. Kanellakis
Report on the 6th Symposium on Principles of Database Systems. SIGMOD Rec. 16 (2) (1987)
Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
Bounds on the Propagation of Selection into Logic Programs. PODS (1987)
Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne
On the Representation and Querying of Sets of Possible Worlds. SIGMOD Conference (1987)
Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
Parallel Algorithms for Term Matching. CADE (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis
Parallel Evaluation of Recursive Rule Queries. PODS (1986)
Paris C. Kanellakis
Logic Programming and Parallel Complexity. ICDT (1986)
François Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan
Pushing Selections into Logic Programs. XP7.52 Workshop on Database Theory (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies. Adv. Comput. Res. 3 (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
Partition Semantics for Relations. J. Comput. Syst. Sci. 33 (2) (1986)
Stavros S. Cosmadakis, Paris C. Kanellakis
Two Applications of Equational Theories to Database Theory. RTA (1985)
Stavros S. Cosmadakis, Paris C. Kanellakis
Equational Theories and Database Constraints STOC (1985)
Paris C. Kanellakis, Scott A. Smolka
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. PODC (1985)
Paris C. Kanellakis, Christos H. Papadimitriou
The Complexity of Distributed Concurrency Control. SIAM J. Comput. 14 (1) (1985)
Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik
ISIS: Interface for a Semantic Information System. SIGMOD Conference (1985)
Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
Partition Semantics for Relations. PODS (1985)
Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell
On the Sequential Nature of Unification. J. Log. Program. 1 (1) (1984)
Christos H. Papadimitriou, Paris C. Kanellakis
On Concurrency Control by Multiple Versions. ACM Trans. Database Syst. 9 (1) (1984)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies: A Graph Theoretic Approach. PODS (1984)
Paris C. Kanellakis, Christos H. Papadimitriou
Is Distributed Locking Harder? J. Comput. Syst. Sci. 28 (1) (1984)
Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) STOC (1983)
Stavros S. Cosmadakis, Paris C. Kanellakis
Functional and Inclusion Dependencies. XP4.5 Workshop on Database Theory (1983)
Paris C. Kanellakis, Scott A. Smolka
CCS Expressions, Finite State Processes, and THree Problems of Equivalence. PODC (1983)
Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). ICALP (1983)
Paris C. Kanellakis, Christos H. Papadimitriou
Is Distributed Locking Harder? PODS (1982)
Christos H. Papadimitriou, Paris C. Kanellakis
On Concurrency Control by Multiple Versions. PODS (1982)
Paris C. Kanellakis, Christos H. Papadimitriou
The Complexity of Distributed Concurrency Control FOCS (1981)
Paris C. Kanellakis, Christos H. Papadimitriou
Local Search for the Asymmetric Traveling Salesman Problem. Oper. Res. 28 (5) (1980)
Christos H. Papadimitriou, Paris C. Kanellakis
Flowshop scheduling with limited temporary storage. J. ACM 27 (3) (1980)
Paris C. Kanellakis
On the Computational Complexity of Cardinality Constraints in Relational Databases. Inf. Process. Lett. 11 (2) (1980)