Ami Paz
Publications
Publications
|
|
Distributed Non-Interactive Zero-Knowledge Proofs2025 |
|
|
Smoothed Analysis of Dynamic Graph Algorithms2025 |
|
|
Semi-Streaming Algorithms for Graph Property Certification2025 |
|
|
Topological Characterization of Consensus Solvability in Directed Dynamic Networks2023 |
|
|
On the Existence of Extension-Based Proofs of Impossibility for Set-AgreementSIROCCO 2025 - Structural Information and Communication Complexity, Jun 2025, Delphi, Greece. pp.56-73, ⟨10.1007/978-3-031-91736-3_4⟩ |
|
|
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. ⟨10.4230/LIPIcs.STACS.2025.34⟩ |
|
|
Solvability Characterization for General Three-Process TasksPODC '25: ACM Symposium on Principles of Distributed Computing, Jun 2025, Huatulco, Mexico. pp.488-498, ⟨10.1145/3732772.3733548⟩ |
|
|
A Simple Lower Bound for Set Agreement in Dynamic Networks2025 Symposium on Simplicity in Algorithms (SOSA), Jan 2025, New Orleans, United States. pp.253-262, ⟨10.1137/1.9781611978315.20⟩ |
|
|
k-Center Clustering in Distributed ModelsSIROCCO 2024, May 2024, Vietri sul Mare, Italy. pp.83-100, ⟨10.1007/978-3-031-60603-8_5⟩ |
|
|
Brief Announcement: Solvability of Three-Process General TasksDISC 2024, Oct 2024, Madrid, Spain. ⟨10.4230/LIPIcs.DISC.2024.42⟩ |
|
|
Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary StructuresDISC 2024, Oct 2024, Madrid, Spain. ⟨10.4230/LIPIcs.DISC.2024.47⟩ |
|
|
Sinkless Orientation Made SimpleSOSA'23, Jan 2023, Firenze (Florence), Italy. pp.175-191, ⟨10.1137/1.9781611977585.ch17⟩ |
|
|
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⟩ |
|
|
The Time Complexity of Consensus Under Oblivious Message Adversaries14th Innovations in Theoretical Computer Science (ITCS 2023), Jan 2023, Cambridge, United States. ⟨10.4230/LIPIcs.ITCS.2023.100⟩ |
|
|
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate AgreementPODC '22: ACM Symposium on Principles of Distributed Computing, 2022, Salerno, Italy. pp.460-470, ⟨10.1145/3519270.3538422⟩ |
|
|
Playing Guess Who with Your KidsFUN'22 - 11th International Conference on Fun with Algorithms, May 2022, Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.23⟩ |
|
|
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⟩ |
|
|
Fine-Grained Complexity Lower Bounds for Families of Dynamic GraphsESA'22, Sep 2022, Berlin, Germany. ⟨10.4230/LIPIcs.ESA.2022.65⟩ |
Distributed Quantum Proofs for Replicated Data12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Virtuel, France |
|
|
|
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL ModelDISC'21, Oct 2021, Freiburg, Germany. ⟨10.4230/LIPIcs.DISC.2021.58⟩ |
Simple and Fast Distributed Computation of Betweenness CentralityIEEE INFOCOM 2020 - International Conference on Computer Communications, Apr 2020, Pekin / Virtual, China |
|
|
|
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 |
|
|
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 |
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⟩ |
|
|
|
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⟩ |
Trade-Offs in Distributed Interactive ProofsDISC 2019 - 33rd International Symposium on Distributed Computing, Oct 2019, Budapest, Hungary |
|
|
|
Redundancy in Distributed Proofs32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩ |