Paris C. Kanellakis

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
1998
82Object Identity as a Query Language Primitive. Serge Abiteboul, Paris C. Kanellakis. J. ACM (45): 798-842 (1998). Cited by 639Web SearchBibTeXDownload
1996
81Constraint Query Algebras. Dina Q. Goldin, Paris C. Kanellakis. Constraints (1): 45-83 (1996). Web SearchBibTeXDownload
80Database Query Languages Embedded in the Typed Lambda Calculus. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson. Inf. Comput. (127): 117-144 (1996). Web SearchBibTeXDownload
79Parallel Algorithms with Processor Failures and Delays. Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman. J. Algorithms (20): 45-86 (1996). Web SearchBibTeXDownload
78Indexing for Data Models with Constraints and Classes. Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter. J. Comput. Syst. Sci. (52): 589-612 (1996). Web SearchBibTeXDownload
77On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. Gerd G. Hillebrand, Paris C. Kanellakis. LICS 1996, 253-263. Web SearchBibTeXDownload
1995
76On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. Dina Q. Goldin, Paris C. Kanellakis. CP 1995, 137-153. Web SearchBibTeXDownload
75Data Mapping and Matching: Languages for Scientific Datasets. Paris C. Kanellakis. DBPL 1995, 2. Web SearchBibTeX
74Constraint Query Languages. Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. J. Comput. Syst. Sci. (51): 26-52 (1995). Web SearchBibTeXDownload
73Method Schemas. Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller. J. Comput. Syst. Sci. (51): 433-455 (1995). Cited by 68Web SearchBibTeXDownload
72Undecidable Boundedness Problems for Datalog Programs. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi. J. Log. Program. (25): 163-190 (1995). Cited by 32Web SearchBibTeXDownload
71Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. Nord. J. Comput. (2): 146-180 (1995). Web SearchBibTeX
70Constraint Programming and Database Languages: A Tutorial. Paris C. Kanellakis. PODS 1995, 46-53. Web SearchBibTeXDownload
69OODB Indexing by Class-Division. Sridhar Ramaswamy, Paris C. Kanellakis. SIGMOD Conference 1995, 139-150. Web SearchBibTeX
1994
68Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. CONCUR 1994, 242-266. Web SearchBibTeXDownload
67An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson. ICALP 1994, 83-105. Web SearchBibTeXDownload
66Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. Gerd G. Hillebrand, Paris C. Kanellakis. PODS 1994, 222-231. Web SearchBibTeX
65Database querying and constraint programming. Paris C. Kanellakis. SIGACT News (25): 22-87 (1994). Web SearchBibTeXDownload
64Constraint Programming and Database Query Languages. Paris C. Kanellakis, Dina Q. Goldin. TACS 1994, 96-120. Web SearchBibTeXDownload
1993
63Database Query Languages Embedded in the Typed Lambda Calculus. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson. LICS 1993, 332-343. Web SearchBibTeXDownload
62Functional Programming Formalisms for OODBMS Methods. Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy. NATO ASI OODBS 1993, 73-99. Web SearchBibTeX
61Indexing for Data Models with Constraints and Classes. Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter. PODS 1993, 233-243. Web SearchBibTeX
60Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. WDAG 1993, 99-114. Web SearchBibTeXDownload
1992
59Introduction to the Programming Environment. Claude Delobel, Paris C. Kanellakis, Didier Plateau. Building an Object-Oriented Database System, The Story of O2 1992, 489-495. Web SearchBibTeX
58Object Identity as a Query Language Primitive. Serge Abiteboul, Paris C. Kanellakis. Building an Object-Oriented Database System, The Story of O2 1992, 97-127. Cited by 639Web SearchBibTeX
57Introduction to the Data Model. Paris C. Kanellakis, Christophe Lécluse, Philippe Richard. Building an Object-Oriented Database System, The Story of O2 1992, 61-76. Web SearchBibTeX
56Method Schemas. Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller. Building an Object-Oriented Database System, The Story of O2 1992, 128-147. Cited by 68Web SearchBibTeX
55Efficient Parallel Algorithms can be Made Robust. Paris C. Kanellakis, Alexander A. Shvartsman. Distributed Computing (5): 201-217 (1992). Web SearchBibTeXDownload
1991
54A Data Dtructure for Arc Insertion and Regular Path Finding. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter. Ann. Math. Artif. Intell. (3): 187-210 (1991). Web SearchBibTeXDownload
53Unification and ML-Type Reconstruction. Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell. Computational Logic - Essays in Honor of Alan Robinson 1991, 444-478. Web SearchBibTeX
52The Two Facets of Object-Oriented Data Models. Serge Abiteboul, Paris C. Kanellakis. IEEE Data Eng. Bull. (14): 3-7 (1991). Cited by 14Web SearchBibTeXDownload
51Efficient Parallel Algorithms on Restartable Fail-Stop Processors. Paris C. Kanellakis, Alexander A. Shvartsman. PODC 1991, 23-36. Web SearchBibTeX
50Tools for Datalog Boundedness. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi. PODS 1991, 1-12. Cited by 22Web SearchBibTeX
49On the Representation and Querying of Sets of Possible Worlds. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne. Theor. Comput. Sci. (78): 158-187 (1991). Cited by 177Web SearchBibTeXDownload
1990
48Elements of Relational Database Theory. Paris C. Kanellakis. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990, 1073-1156. Web SearchBibTeX
47CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Paris C. Kanellakis, Scott A. Smolka. Inf. Comput. (86): 43-68 (1990). Web SearchBibTeXDownload
46Polynomial-Time Implication Problems for Unary Inclusion Dependencies. Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi. J. ACM (37): 15-46 (1990). Cited by 56Web SearchBibTeXDownload
45Bounds on the Propagation of Selection into Logic Programs. Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan. J. Comput. Syst. Sci. (41): 157-180 (1990). Cited by 65Web SearchBibTeXDownload
44Method Schemas. Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller. PODS 1990, 16-27. Cited by 68Web SearchBibTeX
43Constraint Query Languages. Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. PODS 1990, 299-313. Web SearchBibTeX
42Database Theory Column: Query Languages for Complex Object Databases. Serge Abiteboul, Paris C. Kanellakis. SIGACT News (21): 9-18 (1990). Web SearchBibTeXDownload
41New 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 Record (19): 41-48 (1990). Cited by 6Web SearchBibTeXDownload
40A Data Structure for Arc Insertion and Regular Path Finding. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter. SODA 1990, 22-31. Web SearchBibTeXDownload
1989
39A Logical Database Query Language with Object Identity and Strong Typing. Paris C. Kanellakis, Serge Abiteboul. ICLP 1989, 675-692. Web SearchBibTeX
38On the Relationship of Congruence Closure and Unification. Paris C. Kanellakis, Peter Z. Revesz. J. Symb. Comput. (7): 427-444 (1989). Web SearchBibTeXDownload
37Efficient Parallel Algorithms Can Be Made Robust. Paris C. Kanellakis, Alexander A. Shvartsman. PODC 1989, 211-219. Web SearchBibTeX
36Polymorphic Unification and ML Typing. Paris C. Kanellakis, John C. Mitchell. POPL 1989, 105-115. Web SearchBibTeXDownload
35Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. Paris C. Kanellakis, Serge Abiteboul. SIGACT News (20): 17-23 (1989). Web SearchBibTeXDownload
34Object Identity as a Query Language Primitive. Serge Abiteboul, Paris C. Kanellakis. SIGMOD Conference 1989, 159-173. Cited by 639Web SearchBibTeX
1988
33On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Paris C. Kanellakis, Scott A. Smolka. Algorithmica (3): 421-450 (1988). Web SearchBibTeXDownload
32Logic Programming and Parallel Complexity. Paris C. Kanellakis. Foundations of Deductive Databases and Logic Programming. 1988, 547-585. Web SearchBibTeX
31Parallel Algorithms for Term Matching. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer. SIAM J. Comput. (17): 711-731 (1988). Web SearchBibTeXDownload
30Decidable Optimization Problems for Database Logic Programs (Preliminary Report). Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi. STOC 1988, 477-490. Cited by 88Web SearchBibTeXDownload
1987
29On the Relationship of Congruence Closure and Unification. Paris C. Kanellakis, Peter Z. Revesz. DBPL 1987, 23-41. Web SearchBibTeX
28Bounds on the Propagation of Selection into Logic Programs. Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan. PODS 1987, 214-226. Cited by 65Web SearchBibTeX
27On the Representation and Querying of Sets of Possible Worlds. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne. SIGMOD Conference 1987, 34-48. Cited by 177Web SearchBibTeX
26Report on the 6th Symposium on Principles of Database Systems. Paris C. Kanellakis. SIGMOD Record (16): 15-17 (1987). Web SearchBibTeX
1986
25Functional and Inclusion Dependencies. Stavros S. Cosmadakis, Paris C. Kanellakis. Advances in Computing Research (3): 163-184 (1986). Web SearchBibTeX
24Parallel Algorithms for Term Matching. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer. CADE 1986, 416-430. Web SearchBibTeXDownload
23Logic Programming and Parallel Complexity. Paris C. Kanellakis. ICDT 1986, 1-30. Web SearchBibTeXDownload
22Partition Semantics for Relations. Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos. J. Comput. Syst. Sci. (33): 203-233 (1986). Web SearchBibTeXDownload
21Parallel Evaluation of Recursive Rule Queries. Stavros S. Cosmadakis, Paris C. Kanellakis. PODS 1986, 280-293. Web SearchBibTeX
20Pushing Selections into Logic Programs. François Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan. XP7.52 Workshop on Database Theory 1986. Web SearchBibTeX
1985
19On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Paris C. Kanellakis, Scott A. Smolka. PODC 1985, 23-38. Web SearchBibTeX
18Partition Semantics for Relations. Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos. PODS 1985, 261-275. Web SearchBibTeX
17Two Applications of Equational Theories to Database Theory. Stavros S. Cosmadakis, Paris C. Kanellakis. RTA 1985, 107-123. Web SearchBibTeXDownload
16The Complexity of Distributed Concurrency Control. Paris C. Kanellakis, Christos H. Papadimitriou. SIAM J. Comput. (14): 52-74 (1985). Web SearchBibTeXDownload
15ISIS: Interface for a Semantic Information System. Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik. SIGMOD Conference 1985, 328-342. Web SearchBibTeX
14Equational Theories and Database Constraints. Stavros S. Cosmadakis, Paris C. Kanellakis. STOC 1985, 273-284. Web SearchBibTeXDownload
1984
13On Concurrency Control by Multiple Versions. Christos H. Papadimitriou, Paris C. Kanellakis. ACM Trans. Database Syst. (9): 89-99 (1984). Web SearchBibTeXDownload
12Is Distributed Locking Harder?. Paris C. Kanellakis, Christos H. Papadimitriou. J. Comput. Syst. Sci. (28): 103-120 (1984). Web SearchBibTeXDownload
11On the Sequential Nature of Unification. Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell. J. Log. Program. (1): 35-50 (1984). Web SearchBibTeXDownload
10Functional and Inclusion Dependencies: A Graph Theoretic Approach. Stavros S. Cosmadakis, Paris C. Kanellakis. PODS 1984, 29-37. Web SearchBibTeX
1983
9Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou. ICALP 1983, 712-722. Web SearchBibTeXDownload
8CCS Expressions, Finite State Processes, and THree Problems of Equivalence. Paris C. Kanellakis, Scott A. Smolka. PODC 1983, 228-240. Web SearchBibTeX
7Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract). Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi. STOC 1983, 264-277. Cited by 38Web SearchBibTeXDownload
6Functional and Inclusion Dependencies. Stavros S. Cosmadakis, Paris C. Kanellakis. XP4.5 Workshop on Database Theory 1983. Web SearchBibTeX
1982
5On Concurrency Control by Multiple Versions. Christos H. Papadimitriou, Paris C. Kanellakis. PODS 1982, 76-82. Web SearchBibTeX
4Is Distributed Locking Harder?. Paris C. Kanellakis, Christos H. Papadimitriou. PODS 1982, 98-107. Web SearchBibTeX
1981
3The Complexity of Distributed Concurrency Control. Paris C. Kanellakis, Christos H. Papadimitriou. FOCS 1981, 185-197. Web SearchBibTeXDownload
1980
2On the Computational Complexity of Cardinality Constraints in Relational Databases. Paris C. Kanellakis. Inf. Process. Lett. (11): 98-101 (1980). Web SearchBibTeXDownload
1Flowshop scheduling with limited temporary storage. Christos H. Papadimitriou, Paris C. Kanellakis. J. ACM (27): 533-549 (1980). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research