The following pages link to Alessia Milani (Q324626):
Displaying 15 items.
- Transactional scheduling for read-dominated workloads (Q456006) (← links)
- (Q631766) (redirect page) (← links)
- The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost (Q631767) (← links)
- On the complexity of basic abstractions to implement consensus (Q683759) (← links)
- Inherent limitations on disjoint-access parallel implementations of transactional memory (Q693754) (← links)
- Anonymous graph exploration without collision by mobile robots (Q975538) (← links)
- On the uncontended complexity of anonymous agreement (Q1682223) (← links)
- A faster exact-counting protocol for anonymous dynamic networks (Q1755728) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- Optimal propagation-based protocols implementing causal memories (Q2375309) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Q2894474) (← links)
- On the Uncontended Complexity of Anonymous Consensus (Q5363803) (← links)
- (Q5363819) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q6487520) (← links)
