Paris C. Kanellakis

According to our database1, Paris C. Kanellakis authored at least 68 papers between 1980 and 1996.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

1996
Parallel Algorithms with Processor Failures and Delays.
J. Algorithms, 1996

Database Query Languages Embedded in the Typed Lambda Calculus.
Inf. Comput., 1996

Constraint Query Algebras.
Constraints, 1996

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

1995
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms.
Nord. J. Comput., 1995

Undecidable Boundedness Problems for Datalog Programs.
J. Log. Program., 1995

Method Schemas.
J. Comput. Syst. Sci., 1995

OODB Indexing by Class-Division.
Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995

Constraint Programming and Database Languages: A Tutorial.
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

Data Mapping and Matching: Languages for Scientific Datasets.
Proceedings of the Database Programming Languages (DBPL-5), 1995

On Similarity Queries for Time-Series Data: Constraint Specification and Implementation.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Database querying and constraint programming.
SIGACT News, 1994

Constraint Programming and Database Query Languages.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Functional Database Query Languages as Typed Lambda Calculi of Fixed Order.
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.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations.
Proceedings of the CONCUR '94, 1994

1993
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Indexing for Data Models with Constraints and Classes.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Functional Programming Formalisms for OODBMS Methods.
Proceedings of the Advances in Object-Oriented Database Systems, 1993

Database Query Languages Embedded in the Typed Lambda Calculus
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992
Introduction to the Data Model.
Building an Object-Oriented Database System, The Story of O2, 1992

Introduction to the Programming Environment.
Building an Object-Oriented Database System, The Story of O2, 1992

1991
The Two Facets of Object-Oriented Data Models.
IEEE Data Eng. Bull., 1991

A Data Dtructure for Arc Insertion and Regular Path Finding.
Ann. Math. Artif. Intell., 1991

Tools for Datalog Boundedness.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

Efficient Parallel Algorithms on Restartable Fail-Stop Processors.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Unification and ML-Type Reconstruction.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
CCS Expressions, Finite State Processes, and Three Problems of Equivalence
Inf. Comput., May, 1990

Polynomial-Time Implication Problems for Unary Inclusion Dependencies
J. ACM, January, 1990

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

Database Theory Column: Query Languages for Complex Object Databases.
SIGACT News, 1990

A Data Structure for Arc Insertion and Regular Path Finding.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

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

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

Elements of Relational Database Theory.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
Database Theory Column: Deciding Bounded Recursion in Database Logic Programs.
SIGACT News, 1989

Object Identity as a Query Language Primitive.
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, USA, May 31, 1989

Polymorphic Unification and ML Typing.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Efficient Parallel Algorithms Can Be Made Robust.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

A Logical Database Query Language with Object Identity and Strong Typing.
Proceedings of the Logic Programming, 1989

1988
Decidable Optimization Problems for Database Logic Programs (Preliminary Report)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

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

1987
Report on the 6th Symposium on Principles of Database Systems.
SIGMOD Record, 1987

On the Representation and Querying of Sets of Possible Worlds.
Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference, 1987

Bounds on the Propagation of Selection into Logic Programs.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

On the Relationship of Congruence Closure and Unification.
Proceedings of the Advances in Database Programming Languages, 1987

1986
Pushing Selections into Logic Programs.
Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

Parallel Evaluation of Recursive Rule Queries.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Logic Programming and Parallel Complexity.
Proceedings of the ICDT'86, 1986

Parallel Algorithms for Term Matching.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
The Complexity of Distributed Concurrency Control.
SIAM J. Comput., 1985

Equational Theories and Database Constraints
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

ISIS: Interface for a Semantic Information System.
Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, 1985

Two Applications of Equational Theories to Database Theory.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Partition Semantics for Relations.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984
On the Sequential Nature of Unification.
J. Log. Program., 1984

Functional and Inclusion Dependencies: A Graph Theoretic Approach.
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983
Functional and Inclusion Dependencies.
Proceedings of the XP4.5 Workshop on Database Theory, 1983 Palo Alto, California, USA, 1983

Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

CCS Expressions, Finite State Processes, and THree Problems of Equivalence.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract).
Proceedings of the Automata, 1983

1982
On Concurrency Control by Multiple Versions.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Is Distributed Locking Harder?
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

1981
The Complexity of Distributed Concurrency Control
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Flowshop scheduling with limited temporary storage.
J. ACM, 1980

On the Computational Complexity of Cardinality Constraints in Relational Databases.
Inf. Process. Lett., 1980

Local Search for the Asymmetric Traveling Salesman Problem.
Operations Research, 1980


  Loading...