Search Results - Milani, Alessia

Refine Results
  1. 1
    Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory

    Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory by Attiya, Hagit, Hillel, Eshcar, Milani, Alessia

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Long-lived counters with polylogarithmic amortized step complexity

    Long-lived counters with polylogarithmic amortized step complexity by Baig, Mirza Ahad, Hendler, Danny, Milani, Alessia, Travers, Corentin

    Published in Distributed computing
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  3. 3
    On the complexity of basic abstractions to implement consensus

    On the complexity of basic abstractions to implement consensus by Capdevielle, Claire, Johnen, Colette, Milani, Alessia

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  4. 4
    Transactional scheduling for read-dominated workloads

    Transactional scheduling for read-dominated workloads by Attiya, Hagit, Milani, Alessia

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Byzantine Auditable Atomic Register with Optimal Resilience

    Byzantine Auditable Atomic Register with Optimal Resilience by Del Pozzo, Antonella, Milani, Alessia, Rapetti, Alexandre

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  6. 6
    A Faster Exact-Counting Protocol for Anonymous Dynamic Networks

    A Faster Exact-Counting Protocol for Anonymous Dynamic Networks by Chakraborty, Maitri, Milani, Alessia, Mosteiro, Miguel A.

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Upper and Lower Bounds for Deterministic Approximate Objects

    Upper and Lower Bounds for Deterministic Approximate Objects by Hendler, Danny, Khattabi, Adnane, Milani, Alessia, Travers, Corentin

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  8. 8
    On the uncontended complexity of anonymous agreement

    On the uncontended complexity of anonymous agreement by Capdevielle, Claire, Johnen, Colette, Kuznetsov, Petr, Milani, Alessia

    Published in Distributed computing
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    Universal constructions that ensure disjoint-access parallelism and wait-freedom

    Universal constructions that ensure disjoint-access parallelism and wait-freedom by Ellen, Faith, Fatourou, Panagiota, Kosmas, Eleftherios, Milani, Alessia, Travers, Corentin

    Published in Distributed computing
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    Anonymous graph exploration without collision by mobile robots

    Anonymous graph exploration without collision by mobile robots by Baldoni, Roberto, Bonnet, François, Milani, Alessia, Raynal, Michel

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 11
    Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

    Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony by Fernández Anta, Antonio, Milani, Alessia, Mosteiro, Miguel A., Zaks, Shmuel

    Published in Distributed computing
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  12. 12
    Optimal propagation-based protocols implementing causal memories

    Optimal propagation-based protocols implementing causal memories by Baldoni, Roberto, Milani, Alessia, Piergiovanni, Sara Tucci

    Published in Distributed computing
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  13. 13
    Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers

    Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers by Johnen, Colette, Adnane Khattabi, Milani, Alessia, Welch, Jennifer L

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    WTTM 2012, the fourth workshop on the theory of transactional memory

    WTTM 2012, the fourth workshop on the theory of transactional memory by Gramoli, Vincent, Milani, Alessia

    Published in SIGACT news
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  15. 15
    The Synchronization Power of Auditable Registers

    The Synchronization Power of Auditable Registers by Attiya, Hagit, Antonella Del Pozzo, Milani, Alessia, Ulysse Pavloff, Rapetti, Alexandre

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Upper and Lower Bounds for Deterministic Approximate Objects

    Upper and Lower Bounds for Deterministic Approximate Objects by Hendler, Danny, Adnane Khattabi, Milani, Alessia, Travers, Corentin

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    About the Efficiency of Partial Replication to Implement Distributed Shared Memory

    About the Efficiency of Partial Replication to Implement Distributed Shared Memory by Helary, J.-M., Milani, A.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  18. 18
    A Faster Counting Protocol for Anonymous Dynamic Networks

    A Faster Counting Protocol for Anonymous Dynamic Networks by Milani, Alessia, Mosteiro, Miguel A

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Counting in Practical Anonymous Dynamic Networks is Polynomial

    Counting in Practical Anonymous Dynamic Networks is Polynomial by Chakraborty, Maitri, Milani, Alessia, Mosteiro, Miguel A

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism

    Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism by Farach-Colton, Martin, Antonio Fernandez Anta, Milani, Alessia, Mosteiro, Miguel A, Zaks, Shmuel

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: