Paris C. Kanellakis

87 papers A* 27A 4B 2Journal 33Unranked 13

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