Damien Pous

1.1k total citations
27 papers, 118 citations indexed

About

Damien Pous is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Damien Pous has authored 27 papers receiving a total of 118 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Artificial Intelligence, 20 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Damien Pous's work include Logic, programming, and type systems (19 papers), Formal Methods in Verification (13 papers) and semigroups and automata theory (11 papers). Damien Pous is often cited by papers focused on Logic, programming, and type systems (19 papers), Formal Methods in Verification (13 papers) and semigroups and automata theory (11 papers). Damien Pous collaborates with scholars based in France, Netherlands and Italy. Damien Pous's co-authors include Filippo Bonchi, Fabienne Boyer, Olivier Gruber, Jurriaan Rot, Davide Sangiorgi, Daniel Hirschkoff, Marcello Bonsangue, Jan Rutten, Alexandra Silva and Peter Höfner and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Theoretical Computer Science.

In The Last Decade

Damien Pous

25 papers receiving 112 citations

Peers

Damien Pous

AI

CTM

CNC

SOFTW

IS

Silvia Ghilezan Serbia

Witold Charatonik Poland

Kurt Sieber Germany

Matthieu Sozeau France

Paula Severi United Kingdom

Vasileios Koutavas Ireland

Naoki Nishida Japan

Shoji Yuen Japan

Benedikt Bollig France

Pierre-Alain Reynier France

Silvia Ghilezan Serbia

Damien Pous

138 ×1.4

AI

97 ×1.3

CTM

34 ×1.1

CNC

11 ×0.8

SOFTW

10 ×0.8

IS

Citations per year, relative to Damien Pous Damien Pous (= 1×) peers Silvia Ghilezan

Countries citing papers authored by Damien Pous

Since Specialization

Citations

This map shows the geographic impact of Damien Pous'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 Damien Pous with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Damien Pous more than expected).

Fields of papers citing papers by Damien Pous

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Damien Pous. 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 Damien Pous. The network helps show where Damien Pous may publish in the future.

Co-authorship network of co-authors of Damien Pous

This figure shows the co-authorship network connecting the top 25 collaborators of Damien Pous. A scholar is included among the top collaborators of Damien Pous 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 Damien Pous. Damien Pous is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Pous, Damien, et al.. (2024). On Tools for Completeness of Kleene Algebra with Hypotheses (extended version). SPIRE - Sciences Po Institutional REpository.

2.

Pous, Damien, et al.. (2024). Completeness Theorems for Kleene algebra with tests and top. Logical Methods in Computer Science. Volume 20, Issue 3.

3.

Pous, Damien, et al.. (2021). Cyclic proofs, system t, and the power of contraction. Proceedings of the ACM on Programming Languages. 5(POPL). 1–28. 3 indexed citations

4.

Höfner, Peter, Damien Pous, & Georg Struth. (2019). Relational and algebraic methods in computer science. Journal of Logical and Algebraic Methods in Programming. 106. 198–199. 2 indexed citations

5.

Pous, Damien & Davide Sangiorgi. (2019). Bisimulation and Coinduction Enhancements: A Historical Perspective. Formal Aspects of Computing. 31(6). 733–749. 3 indexed citations

6.

Pous, Damien, et al.. (2018). Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. EPiC series in computing. 57. 271–251. 3 indexed citations

7.

Struth, Georg, et al.. (2017). Relational and Algebraic Methods in Computer Science. Lecture notes in computer science. 2 indexed citations

8.

Boyer, Fabienne, Olivier Gruber, & Damien Pous. (2017). A robust reconfiguration protocol for the dynamic update of component‐based software systems. Software Practice and Experience. 47(11). 1729–1753. 5 indexed citations

9.

Bonchi, Filippo, et al.. (2016). A general account of coinduction up-to. Acta Informatica. 54(2). 127–190. 13 indexed citations

10.

Brunet, Paul & Damien Pous. (2015). Algorithms for Kleene algebra with converse. Journal of Logical and Algebraic Methods in Programming. 85(4). 574–594. 1 indexed citations

11.

Rot, Jurriaan, Filippo Bonchi, Marcello Bonsangue, et al.. (2015). Enhanced coalgebraic bisimulation. Mathematical Structures in Computer Science. 27(7). 1236–1264. 10 indexed citations

12.

Bonchi, Filippo & Damien Pous. (2015). Hacking nondeterminism with induction and coinduction. Communications of the ACM. 58(2). 87–95. 10 indexed citations

13.

Pous, Damien. (2014). Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. arXiv (Cornell University). 357–368. 6 indexed citations

14.

Pous, Damien. (2012). Untyping Typed Algebras and Colouring Cyclic Linear Logic. Logical Methods in Computer Science. Volume 8, Issue 2. 2 indexed citations

15.

Pous, Damien, et al.. (2012). Deciding Kleene Algebras in Coq. Logical Methods in Computer Science. Volume 8, Issue 1. 9 indexed citations

16.

Pous, Damien, et al.. (2011). Innocent strategies as presheaves and interactive equivalences for CCS. SHILAP Revista de lepidopterología. 59. 2–24. 1 indexed citations

17.

Pous, Damien, et al.. (2010). Rewriting Modulo Associativity and Commutativity in Coq. 1 indexed citations

18.

Pous, Damien, et al.. (2009). A Tactic for Deciding Kleene Algebras. 1 indexed citations

19.

Pous, Damien, et al.. (2008). A Distribution Law for CCS and a New Congruence Result for the pi-calculus. Logical Methods in Computer Science. Volume 4, Issue 2. 5 indexed citations

20.

Hirschkoff, Daniel, Damien Pous, & Davide Sangiorgi. (2007). An efficient abstract machine for Safe Ambients. The Journal of Logic and Algebraic Programming. 71(2). 114–149. 4 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