What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Database
His scientific interests lie mostly in Theoretical computer science, Programming language, Discrete mathematics, Recursion and Constraint satisfaction.
His Theoretical computer science research focuses on Database theory and how it connects with Relational model, Relational calculus and Conjunctive query.
His work deals with themes such as Query language and Query optimization, which intersect with Programming language.
His Query optimization course of study focuses on View and Database model.
Paris C. Kanellakis studied Discrete mathematics and Matching that intersect with Combinatorics.
His Constraint satisfaction study combines topics from a wide range of disciplines, such as Fifth-generation programming language and Constraint programming.
His most cited work include:
- Constraint query languages (601 citations)
- CCS expressions finite state processes, and three problems of equivalence (487 citations)
- Object identity as a query language primitive (357 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Theoretical computer science, Discrete mathematics, Programming language, Combinatorics and Query language.
His biological study spans a wide range of topics, including Time complexity, PSPACE, Database theory and Shared memory.
The various areas that Paris C. Kanellakis examines in his Discrete mathematics study include Functional dependency and Turing machine.
His Programming language research is multidisciplinary, relying on both Optimization problem and Constraint programming.
He has researched Constraint programming in several fields, including Constraint satisfaction and Data structure.
The Query language study combines topics in areas such as Object, Data model and Query optimization.
He most often published in these fields:
- Theoretical computer science (29.41%)
- Discrete mathematics (24.51%)
- Programming language (20.59%)
What were the highlights of his more recent work (between 1994-2003)?
- Shared memory (8.82%)
- Theoretical computer science (29.41%)
- Parallel computing (8.82%)
In recent papers he was focusing on the following fields of study:
Paris C. Kanellakis spends much of his time researching Shared memory, Theoretical computer science, Parallel computing, Fault tolerance and Computation.
His Shared memory research includes elements of Algorithm and Overhead.
His research in Theoretical computer science intersects with topics in Constraint satisfaction, Constraint programming, Constraint logic programming, Query language and Query optimization.
His study in Query language is interdisciplinary in nature, drawing from both Datalog, Fifth-generation programming language and Data model.
The study incorporates disciplines such as Object, View and Database theory in addition to Query optimization.
When carried out as part of a general Parallel computing research project, his work on Parallel algorithm and Multiprocessing is frequently linked to work in Timestamp-based concurrency control, therefore connecting diverse disciplines of study.
Between 1994 and 2003, his most popular works were:
- Constraint query languages (601 citations)
- On Similarity Queries for Time-Series Data: Constraint Specification and Implementation (279 citations)
- Fault-Tolerant Parallel Computation (105 citations)
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
