World's Best Scientists 2026 revealed!
Paris C. Kanellakis

Paris C. Kanellakis

D-Index & Metrics

Computer Science

D-Index
40
Citations
9570
World Ranking
9130
National Ranking
3883

Research.com Recognitions

  • 1987 - Fellow of Alfred P. Sloan Foundation

Overview

Paris C. Kanellakis was affiliated with Brown University in the United States. Their academic career included work recognized by an award from the Alfred P. Sloan Foundation, which granted them a fellowship in 1987.

Kanellakis's research contributions are positioned within academic environments tied to Brown University, although specific fields of study, subfields, topics of research, frequent co-authors, and venues of publication have not been documented in available records. There are also no known books or comprehensive lists of papers associated with their name in accessible databases.

The fellowship from the Alfred P. Sloan Foundation in 1987 suggests recognition within the scientific community for potential or ongoing research activities during that period. This distinction has been awarded to researchers across various disciplines for promising early-career work.

Limited data restricts a deeper exploration of Kanellakis's specific areas of expertise or scholarly output. Their academic legacy, therefore, primarily rests on their association with Brown University and the acknowledged fellowship they received during their career.

Best Publications

  • CCS expressions finite state processes, and three problems of equivalence

    Paris C. Kanellakis;Scott A. Smolka

  • Constraint query languages

    Paris C. Kanellakis;Gabriel M. Kuper;Peter Z. Revesz

  • Object identity as a query language primitive

    Serge Abiteboul;Paris C. Kanellakis

  • Elements of Relational Database Theory

    Paris C. Kanellakis

  • Building an object-oriented database system: the story of 0 2

    François Bancilhon;Claude Delobel;Paris Kanellakis

  • On Similarity Queries for Time-Series Data: Constraint Specification and Implementation

    Dina Q. Goldin;Paris C. Kanellakis

  • Flowshop scheduling with limited temporary storage

    Christos H. Papadimitriou;Paris C. Kanellakis

  • On the sequential nature of unification

    Cynthia Dwork;Paris C. Kanellakis;John C. Mitchell

  • On the representation and querying of sets of possible worlds

    Serge Abiteboul;Paris Kanellakis;Gösta Grahne

  • On the representation and querying of sets of possible worlds

    Serge Abiteboul;Paris Kanellakis;Gosta Grahne

  • Constraint query languages (preliminary report)

    Paris C. Kanellakis;Gabriel M. Kuper;Peter Z. Revesz

  • Efficient parallel algorithms can be made robust

    Paris C. Kanellakis;Alex A. Shvartsman

  • Decidable optimization problems for database logic programs

    Stavros Cosmadakis;Haim Gaifman;Paris Kanellakis;Moshe Vardi

  • On Concurrency Control by Multiple Versions

    Christos H. Papadimitriou;Paris C. Kanellakis

  • Indexing for Data Models with Constraints and Classes

    Paris Kanellakis;Sridhar Ramaswamy;Darren E. Vengroff;Jeffrey Scott Vitter

  • ISIS: interface for a semantic information system

    Kenneth J. Goldman;Sally A. Goldman;Paris C. Kanellakis;Stanley B. Zdonik

  • Local Search for the Asymmetric Traveling Salesman Problem

    Paris C. Kanellakis;Christos H. Papadimitriou

  • Constraint Programming and Database Query Languages

    Paris C. Kanellakis;Dina Q. Goldin

  • Polynomial-time implication problems for unary inclusion dependencies

    Stavros S. Cosmadakis;Paris C. Kanellakis;Moshe Y. Vardi

  • Fault-Tolerant Parallel Computation

    Paris Christos Kanellakis;Alex A. Shvartsman

  • Object identity as a query-language primitive

    Serge Abiteboul;Paris C. Kanellakis

Frequent Co-Authors

Serge Abiteboul
Serge Abiteboul École Normale Supérieure
Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Moshe Y. Vardi
Moshe Y. Vardi Rice University
Jeffrey Scott Vitter
Jeffrey Scott Vitter University of Mississippi
Scott A. Smolka
Scott A. Smolka Stony Brook University
Cynthia Dwork
Cynthia Dwork Harvard University
Catriel Beeri
Catriel Beeri Hebrew University of Jerusalem
John C. Mitchell
John C. Mitchell Stanford University
Raghu Ramakrishnan
Raghu Ramakrishnan Microsoft (United States)
Victor Vianu
Victor Vianu University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science opens doors to a variety of online programs and career pathways. For those interested in the fundamentals of science and technology, consider pursuing online physics degrees that combine flexibility with affordability.

Data-driven fields are also growing rapidly. If you want a specialized skill set, review the cheapest data science masters in usa to find budget-friendly options while upskilling for a future-proof career.

Another attractive route is electrical engineering, which shares a strong foundation with computer science. Learn about electrical engineering online tuition costs to compare program investment and potential earnings.

For those seeking a faster track, explore short certificate programs that pay well. These certifications offer entry into technology and engineering careers without the extended time commitment of a full degree.

Best Scientists Citing Paris C. Kanellakis