Counting-Based Impossibility Proofs for Renaming and Set Agreement. - Hagit Attiya; Ami Paz (DISC, 2012)

Upper bound on the complexity of solving hard renaming. - Hagit Attiya; Armando Castañeda; Maurice Herlihy; Ami Paz (PODC, 2013)

Bremen workshop review. - Ami Paz (SIGACT News, 2013)

Counting-based impossibility proofs for set agreement and renaming. - Hagit Attiya; Ami Paz (J. Parallel Distributed Comput., 2016)

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. - Ami Paz; Gregory Schwartzman (SODA, 2017)

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. - Keren Censor-Hillel; Seri Khoury; Ami Paz (DISC, 2017)

Distributed Distance Computation and Related Topics. - Ami Paz (2017)

Distributed construction of purely additive spanners. - Keren Censor-Hillel; Telikepalli Kavitha; Ami Paz; Amir Yehudayoff (Distributed Comput., 2018)

Hardness of Distributed Optimization. - Nir Bachrach; Keren Censor-Hillel; Michal Dory; Yuval Efron; Dean Leitersdorf; Ami Paz (PODC, 2019)

Synchronous t-Resilient Consensus in Arbitrary Graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (SSS, 2019)

Trade-Offs in Distributed Interactive Proofs. - Pierluigi Crescenzi; Pierre Fraigniaud; Ami Paz (DISC, 2019)

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (CoRR, 2019)

Algebraic methods in the congested clique. - Keren Censor-Hillel; Petteri Kaski; Janne H. Korhonen; Christoph Lenzen 001; Ami Paz; Jukka Suomela (Distributed Comput., 2019)

Bounds on the Step and Namespace Complexity of Renaming. - Hagit Attiya; Armando Castañeda; Maurice Herlihy; Ami Paz (SIAM J. Comput., 2019)

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. - Ami Paz; Gregory Schwartzman (ACM Trans. Algorithms, 2019)

Simple and Fast Distributed Computation of Betweenness Centrality. - Pierluigi Crescenzi; Pierre Fraigniaud; Ami Paz (INFOCOM, 2020)

Fast Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (OPODIS, 2020)

Brief Announcement: Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (DISC, 2020)

Improved Hardness of Approximation of Diameter in the CONGEST Model. - Ofer Grossman; Seri Khoury; Ami Paz (DISC, 2020)

Models of Smoothing in Dynamic Networks. - Uri Meir; Ami Paz; Gregory Schwartzman (DISC, 2020)

Input-dynamic distributed graph algorithms for congested networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (CoRR, 2020)

Approximate proof-labeling schemes. - Keren Censor-Hillel; Ami Paz; Mor Perry (Theor. Comput. Sci., 2020)

The sparsest additive spanner via multiple weighted BFS trees. - Keren Censor-Hillel; Ami Paz; Noam Ravid (Theor. Comput. Sci., 2020)

Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (ITCS, 2021)

On the Complexity of Weight-Dynamic Network Algorithms. - Monika Henzinger; Ami Paz; Stefan Schmid 001 (Networking, 2021)

On the Complexity of Load Balancing in Dynamic Networks. - Seth Gilbert; Uri Meir; Ami Paz; Gregory Schwartzman (SPAA, 2021)

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (DISC, 2021)

Sinkless orientation is hard also in the supported LOCAL model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (CoRR, 2021)

Redundancy in distributed proofs. - Laurent Feuilloley; Pierre Fraigniaud; Juho Hirvonen; Ami Paz; Mor Perry (Distributed Comput., 2021)

Input-Dynamic Distributed Algorithms for Communication Networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Smaller Cuts, Higher Lower Bounds. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Ami Paz (ACM Trans. Algorithms, 2021)

A topological perspective on distributed network algorithms. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Theor. Comput. Sci., 2021)

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. - Monika Henzinger; Ami Paz; A. R. Sricharan (ESA, 2022)

Playing Guess Who with Your Kids. - Ami Paz; Liat Peterfreund (FUN, 2022)

The augmentation-speed tradeoff for consistent network updates. - Monika Henzinger; Ami Paz; Arash Pourdamghani; Stefan Schmid 001 (SOSR, 2022)

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. - Ami Paz; Hugo Rincon Galeana; Stefan Schmid 001; Ulrich Schmid 001; Kyrill Winkler (CoRR, 2022)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. - Hagit Attiya; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum (DISC, 2023)

Topological Characterization of Consensus Solvability in Directed Dynamic Networks. - Hugo Rincon Galeana; Ulrich Schmid 001; Kyrill Winkler; Ami Paz; Stefan Schmid 001 (CoRR, 2023)

Synchronous t-resilient consensus in arbitrary graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Inf. Comput., 2023)

k-Center Clustering in Distributed Models. - Leyla Biabani; Ami Paz (SIROCCO, 2024)

Brief Announcement: Solvability of Three-Process General Tasks. - Hagit Attiya; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum (DISC, 2024)

Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. - Pierre Fraigniaud; Minh-Hang Nguyen; Ami Paz (DISC, 2024)

k-Center Clustering in Distributed Models. - Leyla Biabani; Ami Paz (CoRR, 2024)

Playing Guess Who with your kids: Code-word strategy against adversaries. - Ami Paz; Liat Peterfreund (Theor. Comput. Sci., 2024)

The Time Complexity of Consensus Under Oblivious Message Adversaries. - Kyrill Winkler; Ami Paz; Hugo Rincon Galeana; Stefan Schmid 001; Ulrich Schmid 001 (Algorithmica, 2024)

The topology of local computing in networks. - Pierre Fraigniaud; Ami Paz (J. Appl. Comput. Topol., 2024)

Solvability Characterization for General Three-Process Tasks. - Hagit Attiya; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum (PODC, 2025)

On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. - Hagit Attiya; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum (SIROCCO, 2025)

A Simple Lower Bound for Set Agreement in Dynamic Networks. - Pierre Fraigniaud; Minh-Hang Nguyen; Ami Paz (SOSA, 2025)

Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. - Pierre Fraigniaud; Minh-Hang Nguyen; Ami Paz (STACS, 2025)

Distributed Non-Interactive Zero-Knowledge Proofs. - Alex B. Grilo; Ami Paz; Mor Perry (IACR Cryptol. ePrint Arch., 2025)

Smoothed Analysis of Dynamic Graph Algorithms. - Uri Meir; Ami Paz (CoRR, 2025)

Semi-Streaming Algorithms for Graph Property Certification. - Avinandan Das; Pierre Fraigniaud; Ami Paz; Adi Rosén (CoRR, 2025)

A speedup theorem for asynchronous computation with applications to consensus and approximate agreement. - Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum (Distributed Comput., 2025)