!!Davide Sangiorgi

Davide Sangiorgi holds the rank 35 in the most cited authors in "Algorithms and Theory" in last 10
years: [http://academic.research.microsoft.com/RankList?entitytype=2&domainID=1&last=10&start=1&end=100].
\\ \\
No. 1617 among the Most Cited Computer Science Authors; Publish or Perish: 6078 citations, h-index=35, g-index=77
\\ \\
(1) Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii: Environmental bisimulations
for higher-order languages. ACM
Trans. Program. Lang. Syst. 33(1): 5 (2011)
\\ \\
(2) Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi: Termination
in Impure Concurrent Languages. Proc. CONCUR 2010: 328-342, LNCS, Springer
Varlag, 2010.
\\ \\
(3) Naoki Kobayashi, Davide Sangiorgi: A hybrid type system for lock-freedom
of mobile processes. ACM Trans. Program. Lang. Syst. 32(5): (2010)
\\ \\
(4) Etienne Lozes, Daniel Hirschkoff, Davide Sangiorgi: Separability in the
Ambient Logic. Logical Methods in Computer Science 4(3): (2008)
\\ \\
(5) Benjamin C. Pierce, Davide Sangiorgi: Behavioral equivalence in the
polymorphic pi-calculus. J. ACM 47(3): 531-584 (2000)
\\ \\
(6) Davide Sangiorgi: On the bisimulation proof method. J. MSCS, 8:447-479,
1998.
\\ \\
(7) Benjamin C. Pierce, Davide Sangiorgi: Typing and Subtyping for Mobile
Processes. Mathematical Structures in Computer Science 6(5): 409-453 (1996)
\\ \\
(8) Robin Milner, Davide Sangiorgi: Barbed Bisimulation. ICALP 1992: 685-695,
LNCS, Springer Varlag, 1992.
\\ \\
(9) Reference book in concurrency theory: Davide Sangiorgi and David Walker:
The pi-calculus: a Theory of Mobile Processes, Cambridge University Press,
2001.