Paris C. Kanellakis :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Moshe Y. Vardi :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Moshe Y. Vardi cite Paris C. Kanellakis Ordered by citing publication [Change the order to 'ordered by cited' ]
Surajit Chaudhuri , Moshe Y. Vardi On the Equivalence of Recursive and Nonrecursive Datalog Programs. [Citation Graph (16, 31)][DBLP ] PODS, 1992, pp:55-66 [Conf ] Cites:
Stavros S. Cosmadakis , Paris C. Kanellakis Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP ] PODS, 1986, pp:280-293 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson , Moshe Y. Vardi Tools for Datalog Boundedness. [Citation Graph (8, 18)][DBLP ] PODS, 1991, pp:1-12 [Conf ]
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] STOC, 1988, pp:477-490 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson , Moshe Y. Vardi Undecidable Boundedness Problems for Datalog Programs. [Citation Graph (4, 0)][DBLP ] J. Log. Program., 1995, v:25, n:2, pp:163-190 [Journal ]
Paris C. Kanellakis , Serge Abiteboul Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. [Citation Graph (9, 0)][DBLP ] SIGACT News, 1989, v:20, n:4, pp:17-23 [Journal ]
Surajit Chaudhuri , Moshe Y. Vardi On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs. [Citation Graph (2, 23)][DBLP ] PODS, 1994, pp:107-116 [Conf ] Cites:
Stavros S. Cosmadakis , Paris C. Kanellakis Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP ] PODS, 1986, pp:280-293 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson , Moshe Y. Vardi Tools for Datalog Boundedness. [Citation Graph (8, 18)][DBLP ] PODS, 1991, pp:1-12 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson , Moshe Y. Vardi Tools for Datalog Boundedness. [Citation Graph (8, 18)][DBLP ] PODS, 1991, pp:1-12 [Conf ] Cites:
Stavros S. Cosmadakis , Paris C. Kanellakis Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP ] PODS, 1986, pp:280-293 [Conf ]
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] STOC, 1988, pp:477-490 [Conf ]
Yehoshua Sagiv , Moshe Y. Vardi Safety of Datalog Queries over Infinite Databases. [Citation Graph (8, 20)][DBLP ] PODS, 1989, pp:160-171 [Conf ] Cites:
Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman , Moshe Y. Vardi Proof-Tree Transformation Theorems and Their Applications. [Citation Graph (14, 12)][DBLP ] PODS, 1989, pp:172-181 [Conf ] Cites:
Moshe Y. Vardi On the Integrity of Databases with Incomplete Information. [Citation Graph (1, 23)][DBLP ] PODS, 1986, pp:252-266 [Conf ] Cites:
Moshe Y. Vardi Decidability and Undecidability Results for Boundedness of Linear Recursive Queries. [Citation Graph (22, 23)][DBLP ] PODS, 1988, pp:341-351 [Conf ] Cites:
Stavros S. Cosmadakis , Paris C. Kanellakis Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP ] PODS, 1986, pp:280-293 [Conf ]
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] STOC, 1988, pp:477-490 [Conf ]
Moshe Y. Vardi Automata Theory for Database Theoreticans. [Citation Graph (7, 21)][DBLP ] PODS, 1989, pp:83-92 [Conf ] Cites:
Catriel Beeri , Paris C. Kanellakis , François Bancilhon , Raghu Ramakrishnan Bounds on the Propagation of Selection into Logic Programs. [Citation Graph (31, 19)][DBLP ] PODS, 1987, pp:214-226 [Conf ]
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] STOC, 1988, pp:477-490 [Conf ]
Serge Abiteboul , Gabriel M. Kuper , Harry G. Mairson , Alexander A. Shvartsman , Moshe Y. Vardi In Memoriam Paris C. Kanellakis. [Citation Graph (0, 32)][DBLP ] ACM Comput. Surv., 1996, v:28, n:1, pp:3-15 [Journal ] Cites:
Paris C. Kanellakis , Harry G. Mairson , John C. Mitchell Unification and ML-Type Reconstruction. [Citation Graph (1, 0)][DBLP ] Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:444-478 [Conf ]
Paris C. Kanellakis , Dimitrios Michailidis , Alexander A. Shvartsman Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. [Citation Graph (1, 0)][DBLP ] CONCUR, 1994, pp:242-266 [Conf ]
Paris C. Kanellakis , Gerd G. Hillebrand , Harry G. Mairson An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. [Citation Graph (1, 0)][DBLP ] ICALP, 1994, pp:83-105 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. [Citation Graph (1, 0)][DBLP ] LICS, 1996, pp:253-263 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson Database Query Languages Embedded in the Typed Lambda Calculus [Citation Graph (6, 0)][DBLP ] LICS, 1993, pp:332-343 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis , Sridhar Ramaswamy Functional Programming Formalisms for OODBMS Methods. [Citation Graph (2, 0)][DBLP ] NATO ASI OODBS, 1993, pp:73-99 [Conf ]
Paris C. Kanellakis , Alexander A. Shvartsman Efficient Parallel Algorithms on Restartable Fail-Stop Processors. [Citation Graph (1, 0)][DBLP ] PODC, 1991, pp:23-36 [Conf ]
Stavros S. Cosmadakis , Paris C. Kanellakis Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP ] PODS, 1986, pp:280-293 [Conf ]
Gerd G. Hillebrand , Paris C. Kanellakis Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. [Citation Graph (4, 30)][DBLP ] PODS, 1994, pp:222-231 [Conf ]
Paris C. Kanellakis , Sridhar Ramaswamy , Darren Erik Vengroff , Jeffrey Scott Vitter Indexing for Data Models with Constraints and Classes. [Citation Graph (28, 12)][DBLP ] PODS, 1993, pp:233-243 [Conf ]
Paris C. Kanellakis , John C. Mitchell Polymorphic Unification and ML Typing. [Citation Graph (1, 0)][DBLP ] POPL, 1989, pp:105-115 [Conf ]
Sridhar Ramaswamy , Paris C. Kanellakis OODB Indexing by Class-Division. [Citation Graph (8, 23)][DBLP ] SIGMOD Conference, 1995, pp:139-150 [Conf ]
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] STOC, 1988, pp:477-490 [Conf ]
Paris C. Kanellakis , Dina Q. Goldin Constraint Programming and Database Query Languages. [Citation Graph (8, 0)][DBLP ] TACS, 1994, pp:96-120 [Conf ]
Paris C. Kanellakis , Dimitrios Michailidis , Alexander A. Shvartsman Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). [Citation Graph (1, 0)][DBLP ] WDAG, 1993, pp:99-114 [Conf ]
Dina Q. Goldin , Paris C. Kanellakis Constraint Query Algebras. [Citation Graph (3, 0)][DBLP ] Constraints, 1996, v:1, n:1/2, pp:45-83 [Journal ]
Paris C. Kanellakis , Alexander A. Shvartsman Efficient Parallel Algorithms can be Made Robust. [Citation Graph (1, 0)][DBLP ] Distributed Computing, 1992, v:5, n:4, pp:201-217 [Journal ]
Serge Abiteboul , Paris C. Kanellakis The Two Facets of Object-Oriented Data Models. [Citation Graph (4, 9)][DBLP ] IEEE Data Eng. Bull., 1991, v:14, n:2, pp:3-7 [Journal ]
Serge Abiteboul , Paris C. Kanellakis Object Identity as a Query Language Primitive. [Citation Graph (3, 0)][DBLP ] J. ACM, 1998, v:45, n:5, pp:798-842 [Journal ]
Jonathan F. Buss , Paris C. Kanellakis , Prabhakar Ragde , Alexander A. Shvartsman Parallel Algorithms with Processor Failures and Delays. [Citation Graph (1, 0)][DBLP ] J. Algorithms, 1996, v:20, n:1, pp:45-86 [Journal ]
Serge Abiteboul , Paris C. Kanellakis , Sridhar Ramaswamy , Emmanuel Waller Method Schemas. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:51, n:3, pp:433-455 [Journal ]
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz Constraint Query Languages. [Citation Graph (37, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:51, n:1, pp:26-52 [Journal ]
Cynthia Dwork , Paris C. Kanellakis , John C. Mitchell On the Sequential Nature of Unification. [Citation Graph (6, 0)][DBLP ] J. Log. Program., 1984, v:1, n:1, pp:35-50 [Journal ]
Gerd G. Hillebrand , Paris C. Kanellakis , Harry G. Mairson , Moshe Y. Vardi Undecidable Boundedness Problems for Datalog Programs. [Citation Graph (4, 0)][DBLP ] J. Log. Program., 1995, v:25, n:2, pp:163-190 [Journal ]
Paris C. Kanellakis , Serge Abiteboul Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. [Citation Graph (9, 0)][DBLP ] SIGACT News, 1989, v:20, n:4, pp:17-23 [Journal ]
Kenneth A. Ross , Surajit Chaudhuri , Gösta Grahne , H. V. Jagadish , Jan Van den Bussche , Moshe Y. Vardi Reminiscences on Influential Papers. [Citation Graph (0, 5)][DBLP ] SIGMOD Record, 1999, v:28, n:4, pp:39-41 [Journal ] Cites:
Gabriel M. Kuper , Moshe Y. Vardi The Logical Data Model. [Citation Graph (6, 38)][DBLP ] ACM Trans. Database Syst., 1993, v:18, n:3, pp:379-413 [Journal ] Cites: