default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessia Milani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Colette Johnen
, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. SIROCCO 2024: 318-335- [i6]Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. CoRR abs/2402.14120 (2024) - 2023
- [j12]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-lived counters with polylogarithmic amortized step complexity. Distributed Comput. 36(1): 29-43 (2023) - [c30]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. OPODIS 2023: 4:1-4:23 - [i5]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. CoRR abs/2308.16600 (2023) - 2022
- [c29]Colette Johnen, Adnane Khattabi, Alessia Milani:
Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers. OPODIS 2022: 4:1-4:19 - [c28]Antonella Del Pozzo, Alessia Milani, Alexandre Rapetti:
Byzantine Auditable Atomic Register with Optimal Resilience. SRDS 2022: 121-132 - [e2]Quentin Bramas, Vincent Gramoli, Alessia Milani:
25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. LIPIcs 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-219-8 [contents] - [e1]Alessia Milani, Philipp Woelfel:
PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM 2022, ISBN 978-1-4503-9262-4 [contents] - 2021
- [c27]Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers:
Upper and Lower Bounds for Deterministic Approximate Objects. ICDCS 2021: 438-448 - [i4]Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers:
Upper and Lower Bounds for Deterministic Approximate Objects. CoRR abs/2104.09902 (2021) - 2020
- [c26]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. PODC 2020: 31-40
2010 – 2019
- 2019
- [c25]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC 2019: 3:1-3:16 - 2018
- [j11]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80(11): 3023-3049 (2018) - [j10]Claire Capdevielle, Colette Johnen, Alessia Milani:
On the complexity of basic abstractions to implement consensus. Theor. Comput. Sci. 715: 86-96 (2018) - 2017
- [j9]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the uncontended complexity of anonymous agreement. Distributed Comput. 30(6): 459-468 (2017) - 2016
- [j8]Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29(4): 251-277 (2016) - [c24]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
Counting in Practical Anonymous Dynamic Networks is Polynomial. NETYS 2016: 131-136 - [i3]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
Counting in Practical Anonymous Dynamic Networks is Polynomial. CoRR abs/1603.05459 (2016) - 2015
- [c23]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the Uncontended Complexity of Anonymous Consensus. OPODIS 2015: 12:1-12:16 - [c22]Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. OPODIS 2015: 28:1-28:13 - [p1]Hagit Attiya, Vincent Gramoli, Alessia Milani:
Directory Protocols for Distributed Transactional Memory. Transactional Memory 2015: 367-391 - [i2]Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. CoRR abs/1509.02140 (2015) - 2014
- [c21]Claire Capdevielle, Colette Johnen, Alessia Milani:
Solo-Fast Universal Constructions for Deterministic Abortable Objects. DISC 2014: 288-302 - 2012
- [j7]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25(4): 279-296 (2012) - [j6]Hagit Attiya, Alessia Milani:
Transactional scheduling for read-dominated workloads. J. Parallel Distributed Comput. 72(10): 1386-1396 (2012) - [j5]Vincent Gramoli, Alessia Milani:
WTTM 2012, the fourth workshop on the theory of transactional memory. SIGACT News 43(4): 116-122 (2012) - [c20]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314 - [c19]Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC 2012: 115-124 - 2011
- [j4]Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49(4): 698-719 (2011) - [j3]Roberto Baldoni, Antonio Fernández Anta, Kleoni Ioannidou, Alessia Milani:
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost. Theor. Comput. Sci. 412(12-14): 1066-1080 (2011) - [c18]François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. OPODIS 2011: 251-265 - [c17]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204 - [i1]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR abs/1105.6151 (2011) - 2010
- [c16]Hagit Attiya, Vincent Gramoli, Alessia Milani:
Brief announcement: combine -- an improved directory-based consistency protocol. SPAA 2010: 72-73 - [c15]Hagit Attiya, Vincent Gramoli, Alessia Milani:
A Provably Starvation-Free Distributed Directory Protocol. SSS 2010: 405-419 - [c14]Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Exclusive Perpetual Ring Exploration without Chirality. DISC 2010: 312-327 - [c13]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. DISC 2010: 374-388
2000 – 2009
- 2009
- [c12]Hagit Attiya, Alessia Milani:
Transactional Scheduling for Read-Dominated Workloads. OPODIS 2009: 3-17 - [c11]Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent limitations on disjoint-access parallel implementations of transactional memory. SPAA 2009: 69-78 - [c10]Hagit Attiya, Alessia Milani:
Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. DISC 2009: 108-110 - 2008
- [j2]Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109(2): 98-103 (2008) - [c9]Antonio Fernández Anta, Alessia Milani:
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks. OPODIS 2008: 164-183 - [c8]Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. OPODIS 2008: 428-445 - [c7]Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. DISC 2008: 496-497 - 2007
- [c6]Kleoni Ioannidou, Alessia Milani:
Distributed aerial scanning in mobile ad-hoc networks. Autonomics 2007: 12 - [c5]Roberto Baldoni, Kleoni Ioannidou, Alessia Milani:
Solvability of geocasting in mobile ad-hoc networks. PODC 2007: 386-387 - [c4]Roberto Baldoni, Kleoni Ioannidou, Alessia Milani:
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks. DISC 2007: 48-62 - 2006
- [j1]Roberto Baldoni, Alessia Milani, Sara Tucci Piergiovanni:
Optimal propagation-based protocols implementing causal memories. Distributed Comput. 18(6): 461-474 (2006) - [c3]Jean-Michel Hélary, Alessia Milani:
About the Efficiency of Partial Replication to Implement Distributed Shared Memory. ICPP 2006: 263-270 - [c2]Roberto Baldoni, Miroslaw Malek, Alessia Milani, Sara Tucci Piergiovanni:
Weakly-Persistent Causal Objects in Dynamic Distributed Systems. SRDS 2006: 165-174 - 2004
- [c1]Roberto Baldoni, Alessia Milani, Sara Tucci Piergiovanni:
An Optimal Protocol for Causally Consistent Distributed Shared Memory Systems. IPDPS 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
