2 citations · 2 across the 4 of their papers we have counts for
6 papers
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
Colette Johnen, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of a shared object is a way to obtain an implementation with better performance compared to implementing the original specification. We apply…
The Synchronization Power of Auditable Registers
Hagit Attiya, Antonella Del Pozzo, Alessia Milani +2
Auditability allows to track all the read operations performed on a register. It abstracts the need of data owners to control access to their data, tracking who read which informat…
Upper and Lower Bounds for Deterministic Approximate Objects
Danny Hendler, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step…
Counting in Practical Anonymous Dynamic Networks is Polynomial
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is…
A Faster Counting Protocol for Anonymous Dynamic Networks
Alessia Milani, Miguel A. Mosteiro
We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network to…
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism
Martin Farach-Colton, Antonio Fernandez Anta, Alessia Milani +2
In this paper the problem of information dissemination in Mobile Ad-hoc Networks (MANET) is studied. The problem is to disseminate a piece of information, initially held by a disti…