Paris Kanellakis
#51,840
Most Influential Person Now
Greek database researcher
Paris Kanellakis's AcademicInfluence.com Rankings
Paris Kanellakiscomputer-science Degrees
Computer Science
#2749
World Rank
#2877
Historical Rank
Database
#3614
World Rank
#3765
Historical Rank
Download Badge
Computer Science
Why Is Paris Kanellakis Influential?
(Suggest an Edit or Addition)According to Wikipedia, Paris Christos Kanellakis was a Greek American computer scientist. Life and academic path Kanellakis was born on December 3, 1953, in Athens as the only child of General Eleftherios and Mrs. Argyroula Kanellakis.
Paris Kanellakis's Published Works
Published Works
- CCS expressions, finite state processes, and three problems of equivalence (1983) (710)
- Building an Object-Oriented Database System, The Story of O2 (1992) (591)
- Object identity as a query language primitive (1989) (537)
- On the representation and querying of sets of possible worlds (1987) (478)
- On Similarity Queries for Time-Series Data: Constraint Specification and Implementation (1995) (371)
- Elements of Relational Database Theory (1991) (279)
- Flowshop scheduling with limited temporary storage (1980) (242)
- On the Sequential Nature of Unification (1984) (228)
- Indexing for Data Models with Constraints and Classes (1996) (174)
- Decidable optimization problems for database logic programs (1988) (172)
- On Concurrency Control by Multiple Versions (1982) (153)
- Constraint query languages (preliminary report) (1990) (152)
- ISIS: interface for a semantic information system (1985) (136)
- Local Search for the Asymmetric Traveling Salesman Problem (1980) (135)
- Efficient parallel algorithms can be made robust (1989) (128)
- Constraint Programming and Database Query Languages (1994) (110)
- Fault-Tolerant Parallel Computation (1997) (104)
- Polynomial-time implication problems for unary inclusion dependencies (1990) (97)
- Parallel evaluation of recursive rule queries (1985) (87)
- Logic Programming and Parallel Complexity (1986) (79)
- Bounds on the propagation of selection into logic programs (1987) (75)
- Partition semantics for relations (1985) (74)
- Unification and ML-Type Reconstruction (1991) (71)
- Parallel Algorithms with Processor Failures and Delays (1996) (66)
- Indexing for data models with constraints and classes (extended abstract) (1993) (61)
- Undecidable Boundedness Problems for Datalog Programs (1995) (61)
- Decidable Optimization Problems for Database Logic Programs (Preliminary Report) (1988) (60)
- Object identity as a query language primitive (1998) (60)
- Polymorphic unification and ML typing (1989) (59)
- Functional and inclusion dependencies a graph theoretic approach (1984) (57)
- OODB indexing by class-division (1995) (54)
- Parallel Algorithms for Term Matching (1986) (52)
- Method schemas (1990) (49)
- A data structure for arc insertion and regular path finding (1991) (40)
- Unary inclusion dependencies have polynomial time inference problems (1983) (40)
- Database theory column (1989) (35)
- Efficient parallel algorithms on restartable fail-stop processors (1991) (35)
- Tools for Datalog boundedness (1991) (34)
- Constraint query algebras (2004) (33)
- Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) (1983) (33)
- Database query languages embedded in the typed lambda calculus (1993) (33)
- Database Theory Column: Query Languages for Complex Object Databases. (1990) (32)
- Equational theories and database constraints (1985) (30)
- Constraint programming and database languages: a tutorial (1995) (29)
- Advances in Computing Research: The Theory of Databases (1986) (29)
- The complexity of distributed concurrency control (1981) (25)
- On the expressive power of simply typed and let-polymorphic lambda calculi (1996) (25)
- On the Computational Complexity of Cardinality Constraints in Relational Databases (1980) (24)
- Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (1993) (20)
- On the analysis of cooperation and antagonism in networks of communicating processes (1985) (18)
- Functional database query languages as typed lambda calculi of fixed order (extended abstract) (1994) (17)
- Introduction to the Data Model (1992) (16)
- Functional and Inclusion Dependencies (1986) (15)
- On the Relationship of Congruence Closure and Unification (1989) (14)
- Is distributed locking harder? (1982) (14)
- The Two Facets of Object-Oriented Data Models (1991) (13)
- Database theory column (1989) (11)
- Two Applications of Equational Theories to Database Theory (1985) (9)
- An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (1994) (8)
- Fault-Tolerance and Efficiency in Massively Parallel Algorithms (1994) (7)
- Functional Programming Formalisms for OODBMS Methods (1994) (7)
- Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations (1994) (5)
- PCK50 : principles of computing & knowledge : Paris C. Kanellakis Memorial Workshop on the occasion of his 50th birthday : San Diego, California, USA, June 8th, 2003 (2003) (5)
- New hope on data models and types: report of an NSF-INRIA workshop (1990) (4)
- Proceedings of the Third International Conference on Database Theory (1990) (4)
- On concurrency control by multiple versions (1982) (4)
- Database Programming Languages: Bulk Types and Persistent Data. 3rd International Workshop, August 27-30, 1991, Nafplion, Greece, Proceedings (1991) (3)
- A Logical Database Query Language with Object Identity and Strong Typing (1989) (3)
- Database programming languages : bulk types & presistent data : the Third International Workshop, August 27-30, 1991, Nafplion, Greece (1992) (3)
- Models for Robust Computation (1997) (1)
- Functional Programming Formalisms for Oodb Methods Functional Programming Formalisms for Oodb Methods (1994) (1)
- Multiparadigm Design Environments (1992) (1)
- Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem. (1978) (1)
- Proceedings of the third international conference on database theory on Database theory (1990) (1)
- The Write-All Problem: Algorithms (1997) (0)
- Shared Memory Randomized Algorithms and Distributed Models and Algorithms (1997) (0)
- Report on the 6th Symposium on Principles of Database Systems (1987) (0)
- Method Schemas Method Schemas (1992) (0)
- Controlling Memory Access Concurrency in Eecient Fault-tolerant Parallel Algorithms Controlling Memory Access Concurrency in Eecient Fault-tolerant Parallel Algorithms (1993) (0)
- Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California, USA (1992) (0)
- Database querying and constraint programming (1994) (0)
- {41 () Constraint Query Algebras (1996) (0)
- New Hope on Types and Data Models: report of an NSF-INRIA workshop (1990) (0)
- ICDT '90 : Third International Conference on Database Theory, Paris, France, December 12-14, 1990 : proceedings (1990) (0)
- Parallel algorithms with processor failures and delays. Technical report (1991) (0)
- Lower Bounds, Snapshots and Approximation (1997) (0)
- THE COl\'IPI.JEXll~Y OF DIS)'I~lBUTED CONC'URRENCYCONTI{OL* (1981) (0)
- Pushing Selections into Logic Programs (1986) (0)
- Data Mapping and Matching: Languages for Scientific Datasets (1995) (0)
- Introduction to the Programming Environment (1992) (0)
- Undecidable Boundedness Problem For Datalog Program (1992) (0)
- Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data (1992) (0)
- Fault-Tolerant Simulations (1997) (0)
This paper list is powered by the following services:
Other Resources About Paris Kanellakis
What Schools Are Affiliated With Paris Kanellakis?
Paris Kanellakis is affiliated with the following schools: