Cosimo Laneve

2.5k total citations
59 papers, 624 citations indexed

About

Cosimo Laneve is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Cosimo Laneve has authored 59 papers receiving a total of 624 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Artificial Intelligence, 28 papers in Computational Theory and Mathematics and 16 papers in Computer Networks and Communications. Recurrent topics in Cosimo Laneve's work include Logic, programming, and type systems (29 papers), Logic, Reasoning, and Knowledge (17 papers) and Formal Methods in Verification (16 papers). Cosimo Laneve is often cited by papers focused on Logic, programming, and type systems (29 papers), Logic, Reasoning, and Knowledge (17 papers) and Formal Methods in Verification (16 papers). Cosimo Laneve collaborates with scholars based in Italy, France and United Kingdom. Cosimo Laneve's co-authors include Vincent Danos, Andrea Asperti, Luca Padovani, Luca Cardelli, Gérard Boudol, Björn Victor, Cédric Fournet, Michaël Lienhardt, Naoki Kobayashi and Roberto Gorrieri and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Computer Communications.

In The Last Decade

Cosimo Laneve

54 papers receiving 576 citations

Peers

Cosimo Laneve
Cosimo Laneve
Citations per year, relative to Cosimo Laneve Cosimo Laneve (= 1×) peers Andrea Maggiolo–Schettini

Countries citing papers authored by Cosimo Laneve

Since Specialization
Citations

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

Fields of papers citing papers by Cosimo Laneve

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Cosimo Laneve

This figure shows the co-authorship network connecting the top 25 collaborators of Cosimo Laneve. A scholar is included among the top collaborators of Cosimo Laneve 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 Cosimo Laneve. Cosimo Laneve 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.
Laneve, Cosimo, et al.. (2025). A stochastic analysis of the Gasper protocol. Computer Communications. 236. 108123–108123.
2.
Laneve, Cosimo, et al.. (2024). A Stochastic Analysis of the Gasper Protocol. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). abs/2009.04987. 518–523.
3.
Giallorenzo, Saverio, et al.. (2023). Serverless Scheduling Policies based on Cost Analysis. Electronic Proceedings in Theoretical Computer Science. 392. 40–52. 1 indexed citations
4.
Laneve, Cosimo, et al.. (2017). Static analysis of cloud elasticity. Science of Computer Programming. 147. 27–53. 6 indexed citations
5.
Kobayashi, Naoki & Cosimo Laneve. (2016). Deadlock analysis of unbounded process networks. Information and Computation. 252. 48–70. 13 indexed citations
6.
Laneve, Cosimo. (2014). Le due ali della scrittura. 11. 7–18. 1 indexed citations
7.
Boer, Frank de, et al.. (2014). Decidability Problems for Actor Systems. Logical Methods in Computer Science. Volume 10, Issue 4. 3 indexed citations
8.
Laneve, Cosimo & Jianwen Su. (2009). Proceedings of the 6th international conference on Web services and formal methods. 1 indexed citations
9.
Laneve, Cosimo, et al.. (2009). PiDuce — A project for experimenting Web services technologies. Science of Computer Programming. 74(10). 777–811. 10 indexed citations
10.
Credi, Alberto, et al.. (2008). nanoκ: A calculus for the modeling and simulation of nano devices. Theoretical Computer Science. 408(1). 17–30. 6 indexed citations
11.
Laneve, Cosimo & Luca Padovani. (2007). The must preorder revisited: an algebraic theory for web services contracts. Unicam Scientific Publications (University of Camerino). 21(4). 212–225. 17 indexed citations
12.
Credi, Alberto, et al.. (2007). Modelizations and Simulations of Nano Devices in nanok calculus. Lecture notes in computer science. 1 indexed citations
13.
Laneve, Cosimo. (2001). Inheritance in concurrent objects. Formal Methods. 326–353. 3 indexed citations
14.
Fournet, Cédric & Cosimo Laneve. (2001). Bisimulations in the join-calculus. Theoretical Computer Science. 266(1-2). 569–603. 12 indexed citations
15.
Boudol, Gérard & Cosimo Laneve. (2000). lambda-calculus, multiplicities, and the pi-calculus.. HAL (Le Centre pour la Communication Scientifique Directe). 68. 659–690. 3 indexed citations
16.
Laneve, Cosimo, et al.. (2000). Inheritance in the Join Calculus (Extended Abstract). 397–408. 1 indexed citations
17.
Boudol, Gérard & Cosimo Laneve. (1996). The Discriminating Power of Multiplicities in theλ-Calculus. Information and Computation. 126(1). 83–102. 17 indexed citations
18.
Gorrieri, Roberto & Cosimo Laneve. (1995). Split and ST Bisimulation Semantics. Information and Computation. 118(2). 272–288. 13 indexed citations
19.
Asperti, Andrea, Vincent Danos, Cosimo Laneve, & Laurent Régnier. (1994). Paths in the lambda-calculus. 426–436. 15 indexed citations
20.
Fantechi, Alessandro, Stefania Gnesi, & Cosimo Laneve. (1989). An Expressive Temporal Logic for Basic LOTOS. 261–276.

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