| What is a “good” encoding of guarded choice? U Nestmann Information and computation 156 (1-2), 287-319, 2000 | 146 | 2000 |
| Decoding choice encodings U Nestmann, BC Pierce International Conference on Concurrency Theory, 179-194, 1996 | 131 | 1996 |
| Decoding choice encodings U Nestmann, BC Pierce Information and Computation 163 (1), 1-59, 2000 | 112 | 2000 |
| Symbolic bisimulation in the spi calculus J Borgström, S Briais, U Nestmann International Conference on Concurrency Theory, 161-176, 2004 | 69 | 2004 |
| On Bisimulations for the Spi Calculus* J Borgström, U Nestmann International Conference on Algebraic Methodology and Software Technology …, 2002 | 63 | 2002 |
| Modeling consensus in a process calculus U Nestmann, R Fuzzati, M Merro International Conference on Concurrency Theory, 399-414, 2003 | 59 | 2003 |
| Full abstraction for expressiveness: History, myths and facts D Gorla, U Nestmann Mathematical Structures in Computer Science 26 (4), 639-654, 2016 | 39 | 2016 |
| On distributability in process calculi K Peters, U Nestmann, U Goltz European Symposium on Programming, 310-329, 2013 | 32 | 2013 |
| A formal semantics for protocol narrations S Briais, U Nestmann Theoretical Computer Science 389 (3), 484-511, 2007 | 32 | 2007 |
| Verifying a structured peer-to-peer overlay network: The static case J Borgström, U Nestmann, L Onana, D Gurov International Workshop on Global Computing, 250-265, 2004 | 30 | 2004 |
| On determinacy and nondeterminacy in concurrent programming U Nestmann Inst. für Math. Maschinen und Datenverarbeitung (Informatik), 1996 | 30 | 1996 |
| Formal verification of distributed algorithms P Küfner, U Nestmann, C Rickmann IFIP International Conference on Theoretical Computer Science, 209-224, 2012 | 29 | 2012 |
| Mobile objects as mobile processes M Merro, J Kleist, U Nestmann Information and Computation 177 (2), 195-241, 2002 | 27 | 2002 |
| Is it a “good” encoding of mixed choice? K Peters, U Nestmann International Conference on Foundations of Software Science and …, 2012 | 26 | 2012 |
| Welcome to the jungle: A subjective guide to mobile process calculi U Nestmann International Conference on Concurrency Theory, 52-63, 2006 | 26 | 2006 |
| On the expressive power of joint input U Nestmann Electronic Notes in Theoretical Computer Science 16 (2), 145-152, 1998 | 25 | 1998 |
| Typing confluence U Nestmann, M Steffen In Second International ERCIM Workshop on Formal Methods in Industrial …, 1997 | 24 | 1997 |
| Synchrony vs causality in the asynchronous pi-calculus K Peters, JW Schicke, U Nestmann arXiv preprint arXiv:1108.4469, 2011 | 22 | 2011 |
| Unreliable failure detectors via operational semantics U Nestmann, R Fuzzati Annual Asian Computing Science Conference, 54-71, 2003 | 20 | 2003 |
| Dynamic causality in event structures Y Arbach, D Karcher, K Peters, U Nestmann International Conference on Formal Techniques for Distributed Objects …, 2015 | 19 | 2015 |
Massimo MerroProfessor of Computer Science, Verona University - ItalyBestätigte E-Mail-Adresse bei univr.it
