Alessia Milani

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Long-lived counters with polylogarithmic amortized step complexity Distributed Computing	2023-03-14	Paper
Long-lived counters with polylogarithmic amortized step complexity	2023-02-03	Paper
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity Proceedings of the 39th Symposium on Principles of Distributed Computing	2021-03-15	Paper
A faster exact-counting protocol for anonymous dynamic networks Algorithmica	2019-01-11	Paper
On the complexity of basic abstractions to implement consensus Theoretical Computer Science	2018-02-09	Paper
On the uncontended complexity of anonymous agreement Distributed Computing	2017-11-29	Paper
On the uncontended complexity of anonymous consensus	2017-09-29	Paper
A faster counting protocol for anonymous dynamic networks (available as arXiv preprint)	2017-09-29	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Distributed Computing	2016-10-17	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Proceedings of the 2012 ACM symposium on Principles of distributed computing	2014-12-05	Paper
Solvability of geocasting in mobile ad-hoc networks Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing	2014-03-13	Paper
Optimal propagation-based protocols implementing causal memories Distributed Computing	2013-06-13	Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony Distributed Computing	2013-02-04	Paper
Inherent limitations on disjoint-access parallel implementations of transactional memory Theory of Computing Systems	2012-12-10	Paper
Transactional scheduling for read-dominated workloads Journal of Parallel and Distributed Computing	2012-10-23	Paper
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism LATIN 2012: Theoretical Informatics	2012-06-29	Paper
The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost Theoretical Computer Science	2011-03-14	Paper
Exclusive perpetual ring exploration without chirality Lecture Notes in Computer Science	2010-09-10	Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony Lecture Notes in Computer Science	2010-09-10	Paper
Anonymous graph exploration without collision by mobile robots Information Processing Letters	2010-06-09	Paper
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks Lecture Notes in Computer Science	2008-09-02	Paper

Research outcomes over time

This page was built for person: Alessia Milani