Paris C. Kanellakis

6.4k total citations
80 papers, 3.1k citations indexed

About

Paris C. Kanellakis is a scholar working on Computer Networks and Communications, Artificial Intelligence and Signal Processing. According to data from OpenAlex, Paris C. Kanellakis has authored 80 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computer Networks and Communications, 47 papers in Artificial Intelligence and 28 papers in Signal Processing. Recurrent topics in Paris C. Kanellakis's work include Advanced Database Systems and Queries (47 papers), Data Management and Algorithms (28 papers) and Logic, Reasoning, and Knowledge (23 papers). Paris C. Kanellakis is often cited by papers focused on Advanced Database Systems and Queries (47 papers), Data Management and Algorithms (28 papers) and Logic, Reasoning, and Knowledge (23 papers). Paris C. Kanellakis collaborates with scholars based in United States, France and Greece. Paris C. Kanellakis's co-authors include Serge Abiteboul, Scott A. Smolka, Péter Révész, Gabriel M. Kuper, Stavros S. Cosmadakis, Gösta Grahne, Christos H. Papadimitriou, Alex A. Shvartsman, François Bancilhon and Christos H. Papadimitriou and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Paris C. Kanellakis

78 papers receiving 2.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Paris C. Kanellakis United States 29 2.1k 1.8k 1.1k 731 327 80 3.1k
Joxan Jaffar Singapore 18 1.1k 0.5× 1.9k 1.1× 321 0.3× 1.0k 1.4× 277 0.8× 66 2.8k
François Bancilhon France 19 1.9k 0.9× 1.9k 1.1× 1.0k 0.9× 416 0.6× 419 1.3× 46 2.6k
Philip M. Merlin United States 11 1.0k 0.5× 693 0.4× 373 0.3× 981 1.3× 201 0.6× 18 2.1k
Kapali P. Eswaran United States 12 2.7k 1.3× 756 0.4× 745 0.7× 281 0.4× 443 1.4× 14 2.8k
Raymond A. Lorie United States 21 5.0k 2.4× 1.7k 1.0× 2.0k 1.8× 214 0.3× 1.1k 3.3× 44 5.4k
Catriel Beeri Israel 31 3.0k 1.4× 2.6k 1.5× 1.8k 1.6× 674 0.9× 608 1.9× 85 4.1k
Ian P. Gent United Kingdom 24 1.1k 0.5× 902 0.5× 342 0.3× 532 0.7× 110 0.3× 70 1.8k
Fabrizio Luccio Italy 19 559 0.3× 586 0.3× 379 0.3× 580 0.8× 148 0.5× 102 1.7k
Foto Afrati Greece 20 1.1k 0.5× 709 0.4× 558 0.5× 278 0.4× 519 1.6× 85 1.7k
Narain Gehani United States 22 1.1k 0.5× 708 0.4× 299 0.3× 217 0.3× 411 1.3× 75 1.6k

Countries citing papers authored by Paris C. Kanellakis

Since Specialization
Citations

This map shows the geographic impact of Paris C. Kanellakis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Paris C. Kanellakis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paris C. Kanellakis more than expected).

Fields of papers citing papers by Paris C. Kanellakis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paris C. Kanellakis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Paris C. Kanellakis. The network helps show where Paris C. Kanellakis may publish in the future.

Co-authorship network of co-authors of Paris C. Kanellakis

This figure shows the co-authorship network connecting the top 25 collaborators of Paris C. Kanellakis. A scholar is included among the top collaborators of Paris C. Kanellakis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paris C. Kanellakis. Paris C. Kanellakis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kanellakis, Paris C., Sridhar Ramaswamy, Darren Erik Vengroff, & Jeffrey Scott Vitter. (1996). Indexing for Data Models with Constraints and Classes. Journal of Computer and System Sciences. 52(3). 589–612. 36 indexed citations
2.
Hillebrand, Gerd G. & Paris C. Kanellakis. (1995). Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. 222–231. 5 indexed citations
3.
Kanellakis, Paris C., et al.. (1995). Controlling memory access concurrency in efficient fault-tolerant parallel algorithms. Nordic journal of computing. 2(2). 146–180. 3 indexed citations
4.
Kanellakis, Paris C.. (1995). Constraint programming and database languages. 46–53. 16 indexed citations
5.
Hillebrand, Gerd G., Paris C. Kanellakis, Harry G. Mairson, & Moshe Y. Vardi. (1995). Undecidable boundedness problems for datalog programs. The Journal of Logic Programming. 25(2). 163–190. 31 indexed citations
6.
Kanellakis, Paris C., Christophe Lécluse, & Philippe Richard. (1992). Introduction to the data model. Morgan Kaufmann Publishers Inc. eBooks. 61–76. 6 indexed citations
7.
Bancilhon, François, Claude Delobel, & Paris C. Kanellakis. (1992). Building an object-oriented database system: the story of 0 2. Morgan Kaufmann Publishers Inc. eBooks. 179 indexed citations
8.
Kanellakis, Paris C. & Joachim W. Schmidt. (1992). Database programming languages : bulk types & presistent data : the Third International Workshop, August 27-30, 1991, Nafplion, Greece. 2 indexed citations
9.
Vardi, Moshe Y. & Paris C. Kanellakis. (1992). Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. International Conference on Management of Data. 4 indexed citations
10.
Abiteboul, Serge & Paris C. Kanellakis. (1991). The two facets of object-oriented data models. IEEE Data(base) Engineering Bulletin. 14(2). 3–7. 3 indexed citations
11.
Kanellakis, Paris C., Harry G. Mairson, & John C. Mitchell. (1991). Unification and ML-Type Reconstruction.. 45. 444–478. 24 indexed citations
12.
Buchsbaum, Adam L., Paris C. Kanellakis, & Jeffrey Scott Vitter. (1990). A data structure for arc insertion and regular path finding. Symposium on Discrete Algorithms. 22–31. 10 indexed citations
13.
Abiteboul, Serge & Paris C. Kanellakis. (1990). Database Theory Column: Query Languages for Complex Object Databases.. 21. 9–18. 13 indexed citations
14.
Kanellakis, Paris C. & Scott A. Smolka. (1990). CCS expressions, finite state processes, and three problems of equivalence. Information and Computation. 86(1). 43–68. 246 indexed citations
15.
Kanellakis, Paris C. & Serge Abiteboul. (1989). A Logical Database Query Language with Object Identity and Strong Typing.. International Conference on Lightning Protection. 675–692. 1 indexed citations
16.
Kanellakis, Paris C. & Péter Révész. (1989). On the relationship of congruence closureand unification. Journal of Symbolic Computation. 7(3-4). 427–444. 2 indexed citations
17.
Kanellakis, Paris C. & Alex A. Shvartsman. (1989). Efficient parallel algorithms can be made robust. 211–219. 39 indexed citations
18.
Cosmadakis, Stavros S., Haim Gaifman, Paris C. Kanellakis, & Moshe Y. Vardi. (1988). Decidable Optimization Problems for Database Logic Programs (Preliminary Report). 477–490. 17 indexed citations
19.
Dwork, Cynthia, Paris C. Kanellakis, & John C. Mitchell. (1984). On the sequential nature of unification. The Journal of Logic Programming. 1(1). 35–50. 122 indexed citations
20.
Papadimitriou, Christos H. & Paris C. Kanellakis. (1980). Flowshop scheduling with limited temporary storage. Journal of the ACM. 27(3). 533–549. 176 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026