Daniel Hirschkoff

493 total citations
18 papers, 70 citations indexed

About

Daniel Hirschkoff is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Daniel Hirschkoff has authored 18 papers receiving a total of 70 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 12 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Daniel Hirschkoff's work include Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (7 papers). Daniel Hirschkoff is often cited by papers focused on Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (7 papers). Daniel Hirschkoff collaborates with scholars based in France, Italy and Switzerland. Daniel Hirschkoff's co-authors include Davide Sangiorgi, Arnaud Carayol, Romain Demangeon, Étienne Lozes and Damien Pous and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Information and Computation.

In The Last Decade

Daniel Hirschkoff

17 papers receiving 59 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel Hirschkoff France 5 60 47 25 5 4 18 70
Kaustuv Chaudhuri France 5 56 0.9× 37 0.8× 10 0.4× 2 0.4× 3 0.8× 10 58
Romain Demangeon France 3 36 0.6× 34 0.7× 16 0.6× 7 1.4× 9 2.3× 3 47
Friedrich Slivovsky Austria 6 39 0.7× 48 1.0× 23 0.9× 2 0.4× 6 1.5× 15 72
Étienne Lozes France 8 105 1.8× 93 2.0× 21 0.8× 4 0.8× 3 0.8× 28 119
Vitaly Lagoon Australia 5 52 0.9× 37 0.8× 35 1.4× 3 0.6× 4 1.0× 9 65
Samuel Mimram France 5 44 0.7× 47 1.0× 11 0.4× 10 2.0× 8 2.0× 18 87
Hans de Nivelle Germany 5 121 2.0× 66 1.4× 19 0.8× 4 0.8× 12 3.0× 16 127
William W. McCune United States 5 58 1.0× 32 0.7× 37 1.5× 2 0.4× 9 2.3× 9 82
Russell Harmer United Kingdom 3 73 1.2× 53 1.1× 7 0.3× 4 0.8× 4 1.0× 4 78
Christine Tasson France 6 77 1.3× 59 1.3× 20 0.8× 3 0.6× 4 1.0× 17 92

Countries citing papers authored by Daniel Hirschkoff

Since Specialization
Citations

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

Fields of papers citing papers by Daniel Hirschkoff

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel Hirschkoff

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

All Works

18 of 18 papers shown
1.
Hirschkoff, Daniel, et al.. (2022). Eager functions as processes. Theoretical Computer Science. 913. 8–42. 1 indexed citations
2.
Hirschkoff, Daniel, et al.. (2019). Divergence and unique solution of equations. Logical Methods in Computer Science. Volume 15, Issue 3. 2 indexed citations
3.
Hirschkoff, Daniel, et al.. (2019). Towards ‘up to context’ reasoning about higher-order processes. Theoretical Computer Science. 807. 154–168. 1 indexed citations
4.
Hirschkoff, Daniel, et al.. (2016). Name-passing calculi: From fusions to preorders and types. Information and Computation. 251. 335–360. 1 indexed citations
5.
Hirschkoff, Daniel, et al.. (2015). A behavioural theory for a π-calculus with preorders. Journal of Logical and Algebraic Methods in Programming. 84(6). 806–825. 1 indexed citations
6.
Hirschkoff, Daniel, et al.. (2015). Termination in a π-calculus with subtyping. Mathematical Structures in Computer Science. 26(8). 1395–1432. 1 indexed citations
7.
Hirschkoff, Daniel, et al.. (2011). Termination in a Pi-calculus with Subtyping. SHILAP Revista de lepidopterología. 64. 44–58. 1 indexed citations
8.
Demangeon, Romain, Daniel Hirschkoff, & Davide Sangiorgi. (2010). Termination in higher-order concurrent calculi. The Journal of Logic and Algebraic Programming. 79(7). 550–577. 6 indexed citations
9.
Hirschkoff, Daniel, et al.. (2009). Encapsulation and Dynamic Modularity in the π-calculus. Electronic Notes in Theoretical Computer Science. 241. 85–100. 1 indexed citations
10.
Hirschkoff, Daniel, Étienne Lozes, & Davide Sangiorgi. (2008). Separability in the Ambient Logic. Logical Methods in Computer Science. Volume 4, Issue 3. 6 indexed citations
11.
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
12.
Carayol, Arnaud, Daniel Hirschkoff, & Davide Sangiorgi. (2004). On the representation of McCarthy'sambin theπ-calculus. Theoretical Computer Science. 330(3). 439–473. 14 indexed citations
13.
Carayol, Arnaud, Daniel Hirschkoff, & Davide Sangiorgi. (2004). On the Representation of McCarthy's amb in the π-calculus. Electronic Notes in Theoretical Computer Science. 96. 73–89. 2 indexed citations
14.
Hirschkoff, Daniel, et al.. (2004). Using ambients to control resources. International Journal of Information Security. 2(3-4). 126–144. 3 indexed citations
15.
Hirschkoff, Daniel, et al.. (2003). A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis. Journal of Functional Programming. 13(2). 415–451. 15 indexed citations
16.
Hirschkoff, Daniel, et al.. (2001). Using Ambients to Control Resources. OpenGrey (Institut de l'Information Scientifique et Technique). 3 indexed citations
17.
Hirschkoff, Daniel. (2001). Bisimulation verification using the up to techniques. International Journal on Software Tools for Technology Transfer. 3(3). 271–285. 2 indexed citations
18.
Hirschkoff, Daniel. (1998). Automatically Proving Up–to Bisimulation. Electronic Notes in Theoretical Computer Science. 18. 75–89. 6 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