| PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 | 0 | 0.34 | 2022 |
| Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity | 0 | 0.34 | 2020 |
| Long-Lived Counters with Polylogarithmic Amortized Step Complexity. | 0 | 0.34 | 2019 |
| A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. | 0 | 0.34 | 2018 |
| On the complexity of basic abstractions to implement consensus. | 0 | 0.34 | 2018 |
| On the uncontended complexity of anonymous agreement. | 1 | 0.36 | 2017 |
| Counting in Practical Anonymous Dynamic Networks is Polynomial. | 1 | 0.36 | 2016 |
| A Faster Counting Protocol for Anonymous Dynamic Networks | 1 | 0.36 | 2015 |
| On the Uncontended Complexity of Anonymous Consensus. | 1 | 0.36 | 2015 |
| Directory Protocols for Distributed Transactional Memory | 2 | 0.35 | 2015 |
| Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony | 15 | 0.80 | 2012 |
| Transactional scheduling for read-dominated workloads | 27 | 0.89 | 2012 |
| WTTM 2012, the fourth workshop on the theory of transactional memory | 0 | 0.34 | 2012 |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom | 11 | 0.53 | 2012 |
| Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism | 1 | 0.36 | 2012 |
| Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory | 34 | 1.19 | 2011 |
| Opportunistic Information | 0 | 0.34 | 2011 |
| Asynchronous exclusive perpetual grid exploration without sense of direction | 7 | 0.57 | 2011 |
| Brief announcement: opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism | 0 | 0.34 | 2011 |
| A provably starvation-free distributed directory protocol | 17 | 0.68 | 2010 |
| Exclusive perpetual ring exploration without chirality | 26 | 1.04 | 2010 |
| Brief announcement: combine -- an improved directory-based consistency protocol | 0 | 0.34 | 2010 |
| Brief announcement: transactional scheduling for read-dominated workloads | 1 | 0.36 | 2009 |
| Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks | 3 | 0.39 | 2008 |
| On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots | 10 | 0.73 | 2008 |
| Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots | 0 | 0.34 | 2008 |
| Anonymous graph exploration without collision by mobile robots | 10 | 0.69 | 2008 |
| Distributed aerial scanning in mobile ad-hoc networks | 1 | 0.39 | 2007 |
| Solvability of geocasting in mobile ad-hoc networks | 0 | 0.34 | 2007 |
| Mobility versus the cost of geocasting in mobile ad-hoc networks | 5 | 0.46 | 2007 |
| Optimal propagation-based protocols implementing causal memories | 12 | 0.64 | 2006 |
| An Optimal Protocol for Causally Consistent Distributed Shared Memory Systems | 1 | 0.34 | 2004 |
