Filter your results
- 28
- 16
- 26
- 12
- 3
- 2
- 1
- 43
- 1
- 1
- 4
- 6
- 5
- 8
- 6
- 5
- 9
- 44
- 28
- 6
- 6
- 6
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 44
- 9
- 7
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
Scalable Byzantine Reliable BroadcastDISC, Oct 2019, Budapest, Hungary
Conference papers
hal-03022562v1
|
|||
|
An Asynchronous Computability Theorem for Fair Adversaries2017
Preprints, Working Papers, ...
hal-01572257v4
|
||
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017SIGACT News, 2018, 49 (1), pp.81-90. ⟨10.1145/3197406.3197421⟩
Journal articles
hal-02287904v1
|
|||
|
Brief Announcement: On the Uncontended Complexity of Anonymous ConsensusDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan
Conference papers
hal-01207895v1
|
||
|
The weakest failure detector for eventual consistencyDistributed Computing, 2019, 32 (6), pp.479-492. ⟨10.1007/s00446-016-0292-9⟩
Journal articles
hal-02413314v1
|
||
Optimal Concurrency for List-Based SetsParallel Computing Technologies - 16th International Conference, Sep 2021, Kaliningrad, Russia
Conference papers
hal-03560232v1
|
|||
Revisiting Optimal Resilience of Fast Byzantine ConsensusPODC '21: ACM Symposium on Principles of Distributed Computing, Jul 2021, Virtual Event Italy, France. pp.343-353, ⟨10.1145/3465084.3467924⟩
Conference papers
hal-03559623v1
|
|||
On the uncontended complexity of anonymous agreementDistributed Computing, 2017, 30 (6), pp.459-468. ⟨10.1007/s00446-017-0297-z⟩
Journal articles
hal-02287767v1
|
|||
|
Non-interference and local correctness in transactional memoryTheor. Comput. Sci., 2017, 688, pp.103-116. ⟨10.1016/j.tcs.2016.06.021⟩
Journal articles
hal-02287768v1
|
||
AT2: Asynchronous Trustworthy TransfersCoRR, 2018, abs/1812.10844
Journal articles
hal-02288008v1
|
|||
|
On Helping and StacksThe International Conference on Networked Systems, May 2018, Essaouira, Morocco
Conference papers
hal-01888607v1
|
||
|
Brief Announcement: Performance Prediction for Coarse-Grained LockingPODC 2018 - ACM Symposium on Principles of Distributed Computing, Jul 2018, Egham, United Kingdom. ⟨10.1145/3212734.3212785⟩
Conference papers
hal-01887733v1
|
||
Reconfigurable Lattice Agreement and ApplicationsOPODIS, Dec 2019, Neuchatel, Switzerland
Conference papers
hal-03022570v1
|
|||
Perfect Failure Detection with Very Few Bits18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, Lyon, France
Conference papers
hal-01423637v1
|
|||
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020ACM SIGACT News, 2020, 51 (4), pp.82-84. ⟨10.1145/3444815.3444828⟩
Journal articles
hal-03559549v1
|
|||
|
Brief Announcement: Accountability and Reconfiguration -Self-Healing Lattice Agreement35th International Symposium on Distributed Computing (DISC 2021), Oct 2021, Freibourg, Germany. ⟨10.4230/LIPIcs.DISC.2021.54⟩
Conference papers
hal-03559551v1
|
||
Parallel Combining: Making Use of Free CyclesCoRR, 2017, abs/1710.07588
Journal articles
hal-02287770v1
|
|||
Progressive Transactional Memory in Time and SpacePaCT, Sep 2015, Petrozavodsk, Russia
Conference papers
hal-02287223v1
|
|||
Online Payments by Merely Broadcasting MessagesDSN, Jun 2020, Valencia, Spain
Conference papers
hal-03022579v1
|
|||
Brief Announcement: On Decidability of 2-Process Affine ModelsDISC, Oct 2020, VIRTUAL, France
Conference papers
hal-03022583v1
|
|||
|
Inherent limitations of hybrid transactional memoryDistributed Computing, 2018, 31 (3), pp.167-185. ⟨10.1007/s00446-017-0305-3⟩
Journal articles
hal-02364297v1
|
||
|
Reconfigurable Lattice Agreement and Applications[Research Report] Institut Polytechnique Paris; CEA List. 2019
Reports
cea-02321547v1
|
||
|
Complexité du consensus anonyme en l'absence de concurrenceALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Conference papers
hal-01304268v2
|
||
On the Uncontended Complexity of Anonymous Consensus19th International Conference on Principles of Distributed Systems - OPODIS 2015, Dec 2015, Rennes, France. ⟨10.4230/LIPIcs.OPODIS.2015.12⟩
Conference papers
hal-01411528v1
|
|||
|
A Concurrency-Optimal Binary Search Tree23rd International European Conference on Parallel and Distributed Computing - Euro-Par 2017, Aug 2017, Santiago de Compostella, Spain
Conference papers
hal-01664898v1
|
||
|
Progress-Space Tradeoffs in Single-Writer Memory Implementations21st International Conference on Principles of Distributed Systems (OPODIS 2017), Dec 2017, Lisbon, Portugal. ⟨10.4230/LIPIcs.OPODIS.2017.9⟩
Conference papers
hal-01787848v1
|
||
|
Perfect failure detection with very few bitsInformation and Computation, 2020, 275, pp.104604. ⟨10.1016/j.ic.2020.104604⟩
Journal articles
hal-03559548v1
|
||
|
Brief Announcement: A Concurrency-Optimal List-Based SetDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan
Conference papers
hal-01207872v1
|
||
Asynchronous Reconfiguration with Byzantine FailuresDISC, Oct 2020, VIRTUAL, France
Conference papers
hal-03022581v1
|
|||
Safety and Deferred Update in Transactional MemoryTransactional Memory. Foundations, Algorithms, Tools, and Applications - COST Action Euro-TM IC1001, pp.50-71, 2015, ⟨10.1007/978-3-319-14720-8_3⟩
Book sections
hal-02287873v1
|
- 1
- 2