dblp.uni-trier.dewww.uni-trier.de

Paris C. Kanellakis Vis

Dec. 3, 1953 - Dec. 20, 1995

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page - Biographical Citations

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

Coauthor Index

1Serge Abiteboul [27] [34] [36] [39] [40] [41] [48] [49] [50] [51] [58] [61] [73] [84]
2François Bancilhon [22] [28] [42] [62]
3Catriel Beeri [22] [28] [42]
4Adam L. Buchsbaum [46] [52]
5Peter Buneman [40]
6Jonathan F. Buss [80]
7Stavros S. Cosmadakis [6] [7] [9] [13] [15] [17] [18] [20] [21] [23] [33] [43]
8Claude Delobel [40] [60] [62]
9Cynthia Dwork [10] [25] [30]
10Haim Gaifman [33]
11Dina Q. Goldin [67] [78] [82]
12Kenneth J. Goldman [16]
13Sally A. Goldman [16]
14Gösta Grahne [27] [50]
15Gerd G. Hillebrand [53] [65] [66] [68] [69] [72] [81] [83]
16Richard Hull [40]
17Gabriel M. Kuper [47] [74]
18Christophe Lécluse [59]
19Harry G. Mairson [53] [55] [66] [69] [72] [81]
20Dimitrios Michailidis [63] [70] [71]
21John C. Mitchell [10] [37] [55]
22Christos H. Papadimitriou [1] [3] [4] [5] [9] [11] [12] [14]
23Didier Plateau [60]
24Prabhakar Ragde [80]
25Raghu Ramakrishnan [22] [28] [42]
26Sridhar Ramaswamy [64] [65] [73] [75] [79]
27Peter Z. Revesz [29] [35] [47] [74]
28Philippe Richard [59]
29Joachim W. Schmidt [56]
30Alexander A. Shvartsman [38] [54] [57] [63] [70] [71] [80]
31Scott A. Smolka [8] [19] [31] [44]
32Nicolas Spyratos [18] [20]
33Larry J. Stockmeyer [25] [30]
34Moshe Y. Vardi [7] [33] [43] [53] [72]
35Darren Erik Vengroff [64] [79]
36Victor Vianu [40]
37Jeffrey Scott Vitter [46] [52] [64] [79]
38Emmanuel Waller [48] [61] [73]
39Mihalis Yannakakis [9]
40Stanley B. Zdonik [16]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)