Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParis C. Kanellakis
Person information
- Dec. 3, 1953 - Dec. 20, 1995
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j33]Serge Abiteboul, Paris C. Kanellakis:
Object Identity as a Query Language Primitive. J. ACM 45(5): 798-842 (1998)- 1996
- [j32]Dina Q. Goldin, Paris C. Kanellakis:
Constraint Query Algebras. Constraints An Int. J. 1(1/2): 45-83 (1996) - [j31]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) - [j30]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) - [j29]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) - [c44]Gerd G. Hillebrand, Paris C. Kanellakis:
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. LICS 1996: 253-263 - 1995
- [j28]Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages. J. Comput. Syst. Sci. 51(1): 26-52 (1995) - [j27]Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller:
Method Schemas. J. Comput. Syst. Sci. 51(3): 433-455 (1995) - [j26]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) - [j25]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) - [c43]Dina Q. Goldin, Paris C. Kanellakis:
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. CP 1995: 137-153 - [c42]Paris C. Kanellakis:
Data Mapping and Matching: Languages for Scientific Datasets. DBPL 1995: 2 - [c41]Paris C. Kanellakis:
Constraint Programming and Database Languages: A Tutorial. PODS 1995: 46-53 - [c40]Sridhar Ramaswamy, Paris C. Kanellakis:
OODB Indexing by Class-Division. SIGMOD Conference 1995: 139-150 - 1994
- [j24]Paris C. Kanellakis:
Database querying and constraint programming. SIGACT News 25(4): 22-87 (1994) - [c39]Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman:
Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. CONCUR 1994: 242-266 - [c38]Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson:
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. ICALP 1994: 83-105 - [c37]Gerd G. Hillebrand, Paris C. Kanellakis:
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. PODS 1994: 222-231 - [c36]Paris C. Kanellakis, Dina Q. Goldin:
Constraint Programming and Database Query Languages. TACS 1994: 96-120 - 1993
- [c35]Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson:
Database Query Languages Embedded in the Typed Lambda Calculus. LICS 1993: 332-343 - [c34]Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy:
Functional Programming Formalisms for OODBMS Methods. NATO ASI OODBS 1993: 73-99 - [c33]Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter:
Indexing for Data Models with Constraints and Classes. PODS 1993: 233-243 - [c32]Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman:
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). WDAG 1993: 99-114 - 1992
- [j23]Paris C. Kanellakis, Alexander A. Shvartsman:
Efficient Parallel Algorithms can be Made Robust. Distributed Comput. 5(4): 201-217 (1992) - [p6]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 - [p5]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 - [p4]Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller:
Method Schemas. Building an Object-Oriented Database System, The Story of O2 1992: 128-147 - [p3]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 - [e4]François Bancilhon, Claude Delobel, Paris C. Kanellakis:
Building an Object-Oriented Database System, The Story of O2. Morgan Kaufmann 1992, ISBN 1-55860-169-4 [contents] - [e3]Moshe Y. Vardi, Paris C. Kanellakis:
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California, USA. ACM Press 1992, ISBN 0-89791-519-4 [contents] - 1991
- [j22]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) - [j21]Serge Abiteboul, Paris C. Kanellakis:
The Two Facets of Object-Oriented Data Models. IEEE Data Eng. Bull. 14(2): 3-7 (1991) - [j20]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) - [c31]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 - [c30]Paris C. Kanellakis, Alexander A. Shvartsman:
Efficient Parallel Algorithms on Restartable Fail-Stop Processors. PODC 1991: 23-36 - [c29]Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi:
Tools for Datalog Boundedness. PODS 1991: 1-12 - [e2]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, ISBN 1-55860-242-9 [contents] - 1990
- [j19]Paris C. Kanellakis, Scott A. Smolka:
CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Inf. Comput. 86(1): 43-68 (1990) - [j18]Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi:
Polynomial-Time Implication Problems for Unary Inclusion Dependencies. J. ACM 37(1): 15-46 (1990) - [j17]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) - [j16]Serge Abiteboul, Paris C. Kanellakis:
Database Theory Column: Query Languages for Complex Object Databases. SIGACT News 21(3): 9-18 (1990) - [j15]Serge 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 Rec. 19(4): 41-48 (1990) - [c28]Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller:
Method Schemas. PODS 1990: 16-27 - [c27]Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages. PODS 1990: 299-313 - [c26]Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter:
A Data Structure for Arc Insertion and Regular Path Finding. SODA 1990: 22-31 - [p2]Paris C. Kanellakis:
Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1073-1156 - [e1]Serge Abiteboul, Paris C. Kanellakis:
ICDT'90, Third International Conference on Database Theory, Paris, France, December 12-14, 1990, Proceedings. Lecture Notes in Computer Science 470, Springer 1990, ISBN 3-540-53507-1 [contents]
1980 – 1989
- 1989
- [j14]Paris C. Kanellakis, Peter Z. Revesz:
On the Relationship of Congruence Closure and Unification. J. Symb. Comput. 7(3/4): 427-444 (1989) - [j13]Paris C. Kanellakis, Serge Abiteboul:
Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. SIGACT News 20(4): 17-23 (1989) - [c25]Paris C. Kanellakis, Serge Abiteboul:
A Logical Database Query Language with Object Identity and Strong Typing. ICLP 1989: 675-692 - [c24]Paris C. Kanellakis, Alexander A. Shvartsman:
Efficient Parallel Algorithms Can Be Made Robust. PODC 1989: 211-219 - [c23]Paris C. Kanellakis, John C. Mitchell:
Polymorphic Unification and ML Typing. POPL 1989: 105-115 - [c22]Serge Abiteboul, Paris C. Kanellakis:
Object Identity as a Query Language Primitive. SIGMOD Conference 1989: 159-173 - 1988
- [j12]Paris C. Kanellakis, Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Algorithmica 3: 421-450 (1988) - [j11]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. SIAM J. Comput. 17(4): 711-731 (1988) - [c21]Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi:
Decidable Optimization Problems for Database Logic Programs (Preliminary Report). STOC 1988: 477-490 - [p1]Paris C. Kanellakis:
Logic Programming and Parallel Complexity. Foundations of Deductive Databases and Logic Programming. 1988: 547-585 - 1987
- [j10]Paris C. Kanellakis:
Report on the 6th Symposium on Principles of Database Systems. SIGMOD Rec. 16(2): 15-17 (1987) - [c20]Paris C. Kanellakis, Peter Z. Revesz:
On the Relationship of Congruence Closure and Unification. DBPL 1987: 23-41 - [c19]Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan:
Bounds on the Propagation of Selection into Logic Programs. PODS 1987: 214-226 - [c18]Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne:
On the Representation and Querying of Sets of Possible Worlds. SIGMOD Conference 1987: 34-48 - 1986
- [j9]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies. Adv. Comput. Res. 3: 163-184 (1986) - [j8]Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233 (1986) - [c17]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. CADE 1986: 416-430 - [c16]Paris C. Kanellakis:
Logic Programming and Parallel Complexity. ICDT 1986: 1-30 - [c15]Stavros S. Cosmadakis, Paris C. Kanellakis:
Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293 - [c14]François Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan:
Pushing Selections into Logic Programs. XP7.52 Workshop on Database Theory 1986 - 1985
- [j7]Paris C. Kanellakis, Christos H. Papadimitriou:
The Complexity of Distributed Concurrency Control. SIAM J. Comput. 14(1): 52-74 (1985) - [c13]Paris C. Kanellakis, Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. PODC 1985: 23-38 - [c12]Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
Partition Semantics for Relations. PODS 1985: 261-275 - [c11]Stavros S. Cosmadakis, Paris C. Kanellakis:
Two Applications of Equational Theories to Database Theory. RTA 1985: 107-123 - [c10]Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik:
ISIS: Interface for a Semantic Information System. SIGMOD Conference 1985: 328-342 - [c9]Stavros S. Cosmadakis, Paris C. Kanellakis:
Equational Theories and Database Constraints. STOC 1985: 273-284 - 1984
- [j6]Paris C. Kanellakis, Christos H. Papadimitriou:
Is Distributed Locking Harder? J. Comput. Syst. Sci. 28(1): 103-120 (1984) - [j5]Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell:
On the Sequential Nature of Unification. J. Log. Program. 1(1): 35-50 (1984) - [j4]Christos H. Papadimitriou, Paris C. Kanellakis:
On Concurrency Control by Multiple Versions. ACM Trans. Database Syst. 9(1): 89-99 (1984) - [c8]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies: A Graph Theoretic Approach. PODS 1984: 29-37 - 1983
- [c7]Mihalis 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 - [c6]Paris C. Kanellakis, Scott A. Smolka:
CCS Expressions, Finite State Processes, and THree Problems of Equivalence. PODC 1983: 228-240 - [c5]Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi:
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract). STOC 1983: 264-277 - [c4]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies. XP4.5 Workshop on Database Theory 1983 - 1982
- [c3]Christos H. Papadimitriou, Paris C. Kanellakis:
On Concurrency Control by Multiple Versions. PODS 1982: 76-82 - [c2]Paris C. Kanellakis, Christos H. Papadimitriou:
Is Distributed Locking Harder? PODS 1982: 98-107 - 1981
- [c1]Paris C. Kanellakis, Christos H. Papadimitriou:
The Complexity of Distributed Concurrency Control. FOCS 1981: 185-197 - 1980
- [j3]Paris C. Kanellakis, Christos H. Papadimitriou:
Local Search for the Asymmetric Traveling Salesman Problem. Oper. Res. 28(5): 1086-1099 (1980) - [j2]Paris C. Kanellakis:
On the Computational Complexity of Cardinality Constraints in Relational Databases. Inf. Process. Lett. 11(2): 98-101 (1980) - [j1]Christos H. Papadimitriou, Paris C. Kanellakis:
Flowshop scheduling with limited temporary storage. J. ACM 27(3): 533-549 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
