Alessia Milani

According to our database1, Alessia Milani authored at least 39 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers.
CoRR, 2024

2023
Long-lived counters with polylogarithmic amortized step complexity.
Distributed Comput., March, 2023

The Synchronization Power of Auditable Registers.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022
Byzantine Auditable Atomic Register with Optimal Resilience.
Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022

Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021
Upper and Lower Bounds for Deterministic Approximate Objects.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2018
On the complexity of basic abstractions to implement consensus.
Theor. Comput. Sci., 2018

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.
Algorithmica, 2018

2017
On the uncontended complexity of anonymous agreement.
Distributed Comput., 2017

2016
Universal constructions that ensure disjoint-access parallelism and wait-freedom.
Distributed Comput., 2016

Counting in Practical Anonymous Dynamic Networks is Polynomial.
Proceedings of the Networked Systems - 4th International Conference, 2016

2015
A Faster Counting Protocol for Anonymous Dynamic Networks.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

On the Uncontended Complexity of Anonymous Consensus.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Directory Protocols for Distributed Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014
Solo-Fast Universal Constructions for Deterministic Abortable Objects.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

2012
WTTM 2012, the fourth workshop on the theory of transactional memory.
SIGACT News, 2012

Transactional scheduling for read-dominated workloads.
J. Parallel Distributed Comput., 2012

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
Distributed Comput., 2012

Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost.
Theor. Comput. Sci., 2011

Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory.
Theory Comput. Syst., 2011

Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010
Exclusive Perpetual Ring Exploration without Chirality.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

A Provably Starvation-Free Distributed Directory Protocol.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: combine -- an improved directory-based consistency protocol.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009
Brief Announcement: Transactional Scheduling for Read-Dominated Workloads.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
Anonymous graph exploration without collision by mobile robots.
Inf. Process. Lett., 2008

Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Solvability of geocasting in mobile ad-hoc networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed aerial scanning in mobile ad-hoc networks.
Proceedings of the 1st International Conference on Autonomic Computing and Communication Systems, 2007

2006
Optimal propagation-based protocols implementing causal memories.
Distributed Comput., 2006

Weakly-Persistent Causal Objects in Dynamic Distributed Systems.
Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), 2006

About the Efficiency of Partial Replication to Implement Distributed Shared Memory.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

2004
An Optimal Protocol for Causally Consistent Distributed Shared Memory Systems.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004


  Loading...