The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paris C. Kanellakis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Serge Abiteboul, Paris C. Kanellakis
    Object Identity as a Query Language Primitive. [Citation Graph (119, 35)][DBLP]
    SIGMOD Conference, 1989, pp:159-173 [Conf]
  2. Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
    Constraint Query Languages. [Citation Graph (62, 25)][DBLP]
    PODS, 1990, pp:299-313 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. Kenneth J. Goldman, Sally A. Goldman, Paris C. Kanellakis, Stanley B. Zdonik
    ISIS: Interface for a Semantic Information System. [Citation Graph (25, 17)][DBLP]
    SIGMOD Conference, 1985, pp:328-342 [Conf]
  7. Stavros S. Cosmadakis, Paris C. Kanellakis
    Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP]
    PODS, 1986, pp:280-293 [Conf]
  8. 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]
  9. Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller
    Method Schemas. [Citation Graph (15, 15)][DBLP]
    PODS, 1990, pp:16-27 [Conf]
  10. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne
    On the Representation and Querying of Sets of Possible Worlds. [Citation Graph (14, 15)][DBLP]
    SIGMOD Conference, 1987, pp:34-48 [Conf]
  11. Christos H. Papadimitriou, Paris C. Kanellakis
    On Concurrency Control by Multiple Versions. [Citation Graph (14, 12)][DBLP]
    ACM Trans. Database Syst., 1984, v:9, n:1, pp:89-99 [Journal]
  12. Christos H. Papadimitriou, Paris C. Kanellakis
    On Concurrency Control by Multiple Versions. [Citation Graph (12, 12)][DBLP]
    PODS, 1982, pp:76-82 [Conf]
  13. Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
    Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) [Citation Graph (11, 0)][DBLP]
    STOC, 1983, pp:264-277 [Conf]
  14. Serge Abiteboul, Paris C. Kanellakis
    Database Theory Column: Query Languages for Complex Object Databases. [Citation Graph (10, 0)][DBLP]
    SIGACT News, 1990, v:21, n:3, pp:9-18 [Journal]
  15. Paris C. Kanellakis, Christos H. Papadimitriou
    The Complexity of Distributed Concurrency Control [Citation Graph (9, 0)][DBLP]
    FOCS, 1981, pp:185-197 [Conf]
  16. Paris C. Kanellakis
    Constraint Programming and Database Languages: A Tutorial. [Citation Graph (9, 58)][DBLP]
    PODS, 1995, pp:46-53 [Conf]
  17. 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]
  18. 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]
  19. Sridhar Ramaswamy, Paris C. Kanellakis
    OODB Indexing by Class-Division. [Citation Graph (8, 23)][DBLP]
    SIGMOD Conference, 1995, pp:139-150 [Conf]
  20. Paris C. Kanellakis, Dina Q. Goldin
    Constraint Programming and Database Query Languages. [Citation Graph (8, 0)][DBLP]
    TACS, 1994, pp:96-120 [Conf]
  21. Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
    Partition Semantics for Relations. [Citation Graph (8, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:2, pp:203-233 [Journal]
  22. Dina Q. Goldin, Paris C. Kanellakis
    On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. [Citation Graph (7, 0)][DBLP]
    CP, 1995, pp:137-153 [Conf]
  23. Paris C. Kanellakis
    Logic Programming and Parallel Complexity. [Citation Graph (6, 60)][DBLP]
    ICDT, 1986, pp:1-30 [Conf]
  24. 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]
  25. Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
    Partition Semantics for Relations. [Citation Graph (6, 7)][DBLP]
    PODS, 1985, pp:261-275 [Conf]
  26. Stavros S. Cosmadakis, Paris C. Kanellakis
    Equational Theories and Database Constraints [Citation Graph (6, 0)][DBLP]
    STOC, 1985, pp:273-284 [Conf]
  27. Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi
    Polynomial-Time Implication Problems for Unary Inclusion Dependencies [Citation Graph (6, 0)][DBLP]
    J. ACM, 1990, v:37, n:1, pp:15-46 [Journal]
  28. 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]
  29. Stavros S. Cosmadakis, Paris C. Kanellakis
    Functional and Inclusion Dependencies: A Graph Theoretic Approach. [Citation Graph (5, 13)][DBLP]
    PODS, 1984, pp:29-37 [Conf]
  30. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne
    On the Representation and Querying of Sets of Possible Worlds. [Citation Graph (5, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:1, pp:158-187 [Journal]
  31. 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]
  32. 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]
  33. Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter
    Indexing for Data Models with Constraints and Classes. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:589-612 [Journal]
  34. 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]
  35. Paris C. Kanellakis, Christos H. Papadimitriou
    Is Distributed Locking Harder? [Citation Graph (3, 15)][DBLP]
    PODS, 1982, pp:98-107 [Conf]
  36. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter
    A Data Structure for Arc Insertion and Regular Path Finding. [Citation Graph (3, 0)][DBLP]
    SODA, 1990, pp:22-31 [Conf]
  37. Stavros S. Cosmadakis, Paris C. Kanellakis
    Functional and Inclusion Dependencies. [Citation Graph (3, 0)][DBLP]
    Advances in Computing Research, 1986, v:3, n:, pp:163-184 [Journal]
  38. 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]
  39. 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]
  40. 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]
  41. Paris C. Kanellakis, Christos H. Papadimitriou
    Is Distributed Locking Harder? [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:1, pp:103-120 [Journal]
  42. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
    Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP]
    CADE, 1986, pp:416-430 [Conf]
  43. 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]
  44. Paris C. Kanellakis
    On the Computational Complexity of Cardinality Constraints in Relational Databases. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:2, pp:98-101 [Journal]
  45. Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
    Bounds on the Propagation of Selection into Logic Programs. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:2, pp:157-180 [Journal]
  46. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
    Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:711-731 [Journal]
  47. 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]
  48. 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]
  49. Paris C. Kanellakis, Peter Z. Revesz
    On the Relationship of Congruence Closure and Unification. [Citation Graph (1, 19)][DBLP]
    DBPL, 1987, pp:23-41 [Conf]
  50. 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]
  51. 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]
  52. 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]
  53. Paris C. Kanellakis, John C. Mitchell
    Polymorphic Unification and ML Typing. [Citation Graph (1, 0)][DBLP]
    POPL, 1989, pp:105-115 [Conf]
  54. 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]
  55. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter
    A Data Dtructure for Arc Insertion and Regular Path Finding. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:2-4, pp:187-210 [Journal]
  56. 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]
  57. 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]
  58. Paris C. Kanellakis
    Data Mapping and Matching: Languages for Scientific Datasets. [Citation Graph (0, 0)][DBLP]
    DBPL, 1995, pp:2- [Conf]
  59. Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
    Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:712-722 [Conf]
  60. Paris C. Kanellakis, Serge Abiteboul
    A Logical Database Query Language with Object Identity and Strong Typing. [Citation Graph (0, 0)][DBLP]
    ICLP, 1989, pp:675-692 [Conf]
  61. Paris C. Kanellakis, Scott A. Smolka
    CCS Expressions, Finite State Processes, and THree Problems of Equivalence. [Citation Graph (0, 0)][DBLP]
    PODC, 1983, pp:228-240 [Conf]
  62. Paris C. Kanellakis, Scott A. Smolka
    On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:23-38 [Conf]
  63. Paris C. Kanellakis, Alexander A. Shvartsman
    Efficient Parallel Algorithms Can Be Made Robust. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:211-219 [Conf]
  64. Stavros S. Cosmadakis, Paris C. Kanellakis
    Two Applications of Equational Theories to Database Theory. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:107-123 [Conf]
  65. François Bancilhon, Catriel Beeri, Paris C. Kanellakis, Raghu Ramakrishnan
    Pushing Selections into Logic Programs. [Citation Graph (0, 0)][DBLP]
    XP7.52 Workshop on Database Theory, 1986, pp:- [Conf]
  66. Stavros S. Cosmadakis, Paris C. Kanellakis
    Functional and Inclusion Dependencies. [Citation Graph (0, 0)][DBLP]
    XP4.5 Workshop on Database Theory, 1983, pp:- [Conf]
  67. Paris C. Kanellakis, Scott A. Smolka
    On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:421-450 [Journal]
  68. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
    Database Query Languages Embedded in the Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:127, n:2, pp:117-144 [Journal]
  69. Paris C. Kanellakis, Scott A. Smolka
    CCS Expressions, Finite State Processes, and Three Problems of Equivalence [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:1, pp:43-68 [Journal]
  70. Christos H. Papadimitriou, Paris C. Kanellakis
    Flowshop scheduling with limited temporary storage. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:533-549 [Journal]
  71. Paris C. Kanellakis, Peter Z. Revesz
    On the Relationship of Congruence Closure and Unification. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:3/4, pp:427-444 [Journal]
  72. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
    Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:2, pp:146-180 [Journal]
  73. Paris C. Kanellakis, Christos H. Papadimitriou
    The Complexity of Distributed Concurrency Control. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:52-74 [Journal]
  74. 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. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 1990, v:19, n:4, pp:41-48 [Journal]
  75. Paris C. Kanellakis
    Report on the 6th Symposium on Principles of Database Systems. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 1987, v:16, n:2, pp:15-17 [Journal]

Search in 1.112secs, Finished in 1.117secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002