Ami Paz
20
Documents
Publications
The Time Complexity of Consensus Under Oblivious Message AdversariesITCS23, Jan 2023, Cambridge, United States. ⟨10.4230/LIPIcs.ITCS.2023.100⟩
Communication dans un congrès
hal-04288670v1
|
|
Sinkless Orientation Made SimpleSOSA'23, Jan 2023, Firenze (Florence), Italy. pp.175-191, ⟨10.1137/1.9781611977585.ch17⟩
Communication dans un congrès
hal-04288751v1
|
|
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless TasksDISC23, Oct 2023, L'aquila, Italy. ⟨10.4230/LIPIcs.DISC.2023.4⟩
Communication dans un congrès
hal-04286627v1
|
|
|
Playing Guess Who with Your KidsFUN'22 - 11th International Conference on Fun with Algorithms, May 2022, Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.23⟩
Communication dans un congrès
hal-04288778v1
|
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate AgreementPODC '22: ACM Symposium on Principles of Distributed Computing, 2022, Salerno Italy, Italy. pp.460-470, ⟨10.1145/3519270.3538422⟩
Communication dans un congrès
hal-03872310v1
|
|
The augmentation-speed tradeoff for consistent network updatesSOSR '22: The ACM SIGCOMM Symposium on SDN Research, Oct 2022, Virtual Event, Unknown Region. pp.67-80, ⟨10.1145/3563647.3563655⟩
Communication dans un congrès
hal-04288766v1
|
|
Fine-Grained Complexity Lower Bounds for Families of Dynamic GraphsESA'22, Sep 2022, Berlin, Germany. ⟨10.4230/LIPIcs.ESA.2022.65⟩
Communication dans un congrès
hal-04288782v1
|
|
Distributed Quantum Proofs for Replicated Data12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Virtuel, France
Communication dans un congrès
hal-03872343v1
|
|
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL ModelDISC'21, Oct 2021, Freiburg, Germany. ⟨10.4230/LIPIcs.DISC.2021.58⟩
Communication dans un congrès
hal-04288790v1
|
|
|
Calcul distribué simple et efficace de la betweennessALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Communication dans un congrès
hal-02860493v1
|
Simple and Fast Distributed Computation of Betweenness CentralityIEEE INFOCOM 2020 - International Conference on Computer Communications, Apr 2020, Pekin / Virtual, China
Communication dans un congrès
hal-02433541v1
|
|
A Topological Perspective on Distributed Network Algorithms26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_1⟩
Communication dans un congrès
hal-02433511v1
|
|
Synchronous t-Resilient Consensus in Arbitrary Graphs21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pisa, Italy. ⟨10.1007/978-3-030-34992-9_5⟩
Communication dans un congrès
hal-02433524v1
|
|
Trade-Offs in Distributed Interactive ProofsDISC 2019 - 33rd International Symposium on Distributed Computing, Oct 2019, Budapest, Hungary
Communication dans un congrès
hal-02433529v1
|
|
|
Vérification de preuves distribuées : compromis temps-espaceALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02118043v1
|
|
Redundancy in Distributed Proofs32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩
Communication dans un congrès
hal-01964771v1
|
Topological Characterization of Consensus Solvability in Directed Dynamic Networks2023
Pré-publication, Document de travail
hal-04288873v1
|
Redundancy in distributed proofsDistributed Computing, 2021, 34 (2), pp.113-132. ⟨10.1007/s00446-020-00386-z⟩
Article dans une revue
hal-03872299v1
|
|
A topological perspective on distributed network algorithmsTheoretical Computer Science, 2021, 849, pp.121-137. ⟨10.1016/j.tcs.2020.10.012⟩
Article dans une revue
hal-03100217v1
|
|
Redundancy in distributed proofsDistributed Computing, 2021, 34 (2), pp.113-132. ⟨10.1007/s00446-020-00386-z⟩
Article dans une revue
hal-03871467v1
|