Ami Paz

Orcid: 0000-0002-6629-8335

According to our database¹, Ami Paz authored at least 49 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

The topology of local computing in networks.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Ami Paz

J. Appl. Comput. Topol., September, 2024

The Time Complexity of Consensus Under Oblivious Message Adversaries.

[BibT_eX]

[DOI]

Algorithmica, June, 2024

Playing Guess Who with your kids: Code-word strategy against adversaries.

[BibT_eX]

[DOI]

Ami Paz

Liat Peterfreund

Theor. Comput. Sci., 2024

Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Minh-Hang Nguyen

Ami Paz

CoRR, 2024

<i>k</i>-Center Clustering in Distributed Models.

[BibT_eX]

[DOI]

Leyla Biabani

Ami Paz

CoRR, 2024

Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Minh-Hang Nguyen

Ami Paz

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Brief Announcement: Solvability of Three-Process General Tasks.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Distributed Computing, 2024

k-Center Clustering in Distributed Models.

[BibT_eX]

[DOI]

Leyla Biabani

Ami Paz

Proceedings of the Structural Information and Communication Complexity, 2024

2023

Synchronous <i>t</i>-resilient consensus in arbitrary graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Topological Characterization of Consensus Solvability in Directed Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2023

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Sinkless Orientation Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries.

[BibT_eX]

[DOI]

CoRR, 2022

The augmentation-speed tradeoff for consistent network updates.

[BibT_eX]

[DOI]

Proceedings of the SOSR '22: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, October 19, 2022

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Ami Paz

Sergio Rajsbaum

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Playing Guess Who with Your Kids.

[BibT_eX]

[DOI]

Ami Paz

Liat Peterfreund

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs.

[BibT_eX]

[DOI]

Monika Henzinger

Ami Paz

A. R. Sricharan

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A topological perspective on distributed network algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Smaller Cuts, Higher Lower Bounds.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Input-Dynamic Distributed Algorithms for Communication Networks.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

Redundancy in distributed proofs.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Sinkless orientation is hard also in the supported LOCAL model.

[BibT_eX]

[DOI]

CoRR, 2021

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

On the Complexity of Load Balancing in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

On the Complexity of Weight-Dynamic Network Algorithms.

[BibT_eX]

[DOI]

Monika Henzinger

Ami Paz

Stefan Schmid

Proceedings of the IFIP Networking Conference, 2021

Distributed Quantum Proofs for Replicated Data.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

The sparsest additive spanner via multiple weighted BFS trees.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Ami Paz

Noam Ravid

Theor. Comput. Sci., 2020

Approximate proof-labeling schemes.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Ami Paz

Mor Perry

Theor. Comput. Sci., 2020

Input-dynamic distributed graph algorithms for congested networks.

[BibT_eX]

[DOI]

CoRR, 2020

Models of Smoothing in Dynamic Networks.

[BibT_eX]

[DOI]

Uri Meir

Ami Paz

Gregory Schwartzman

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Improved Hardness of Approximation of Diameter in the CONGEST Model.

[BibT_eX]

[DOI]

Ofer Grossman

Seri Khoury

Ami Paz

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Distributed Quantum Proofs for Replicated Data.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Fast Deterministic Algorithms for Highly-Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Simple and Fast Distributed Computation of Betweenness Centrality.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Pierre Fraigniaud

Ami Paz

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

2019

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model.

[BibT_eX]

[DOI]

Ami Paz

Gregory Schwartzman

ACM Trans. Algorithms, 2019

Bounds on the Step and Namespace Complexity of Renaming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Algebraic methods in the congested clique.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2019

Trade-Offs in Distributed Interactive Proofs.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Pierre Fraigniaud

Ami Paz

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Hardness of Distributed Optimization.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

Distributed construction of purely additive spanners.

[BibT_eX]

[DOI]

Distributed Comput., 2018

2017

Distributed Distance Computation and Related Topics.

[BibT_eX]

[DOI]

Ami Paz

PhD thesis, 2017

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Seri Khoury

Ami Paz

Proceedings of the 31st International Symposium on Distributed Computing, 2017

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model.

[BibT_eX]

[DOI]

Ami Paz

Gregory Schwartzman

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Counting-based impossibility proofs for set agreement and renaming.

[BibT_eX]

[DOI]

Hagit Attiya

Ami Paz

J. Parallel Distributed Comput., 2016

2013

Bremen workshop review.

[BibT_eX]

[DOI]

Ami Paz

SIGACT News, 2013

Upper bound on the complexity of solving hard renaming.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Counting-Based Impossibility Proofs for Renaming and Set Agreement.

[BibT_eX]

[DOI]

Hagit Attiya

Ami Paz

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Ami Paz

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...