94 results on '"Alessia Milani"'
Search Results
2. The Synchronization Power of Auditable Registers.
3. Long-lived counters with polylogarithmic amortized step complexity.
4. Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers.
5. Byzantine Auditable Atomic Register with Optimal Resilience.
6. Upper and Lower Bounds for Deterministic Approximate Objects.
7. Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.
8. The Synchronization Power of Auditable Registers
9. Long-Lived Counters with Polylogarithmic Amortized Step Complexity.
10. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.
11. On the complexity of basic abstractions to implement consensus.
12. Counting in Practical Anonymous Dynamic Networks is Polynomial.
13. On the uncontended complexity of anonymous agreement.
14. A Faster Counting Protocol for Anonymous Dynamic Networks.
15. On the Uncontended Complexity of Anonymous Consensus.
16. Directory Protocols for Distributed Transactional Memory.
17. Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers
18. Universal constructions that ensure disjoint-access parallelism and wait-freedom.
19. Solo-Fast Universal Constructions for Deterministic Abortable Objects.
20. Universal constructions that ensure disjoint-access parallelism and wait-freedom.
21. Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
22. Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction.
23. Exclusive Perpetual Ring Exploration without Chirality.
24. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
25. A Provably Starvation-Free Distributed Directory Protocol.
26. Inherent limitations on disjoint-access parallel implementations of transactional memory.
27. Transactional Scheduling for Read-Dominated Workloads.
28. Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks.
29. On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
30. Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks.
31. About the Efficiency of Partial Replication to Implement Distributed Shared Memory.
32. Weakly-Persistent Causal Objects in Dynamic Distributed Systems.
33. Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
34. Transactional scheduling for read-dominated workloads.
35. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
36. WTTM 2012, the fourth workshop on the theory of transactional memory.
37. LIPIcs, Volume 217, OPODIS 2021, Complete Volume
38. Front Matter, Table of Contents, Preface, Conference Organization
39. The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost.
40. Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory.
41. Brief Announcement: Transactional Scheduling for Read-Dominated Workloads.
42. Anonymous graph exploration without collision by mobile robots.
43. Optimal propagation-based protocols implementing causal memories.
44. An Optimal Protocol for Causally Consistent Distributed Shared Memory Systems.
45. Upper and Lower Bounds for Deterministic Approximate Objects
46. Brief announcement: combine -- an improved directory-based consistency protocol.
47. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
48. Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
49. Solvability of geocasting in mobile ad-hoc networks.
50. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.