Ami Paz

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 68

Top Topics

Dynamic Networks

Betweenness Centrality

Space Complexity

Top Venues

Theor. Comput. Sci.

Publications

Leyla Biabani, Ami Paz
k-Center Clustering in Distributed Models. SIROCCO (2024)
Leyla Biabani, Ami Paz
-Center Clustering in Distributed Models. CoRR (2024)
Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86 (6) (2024)
Ami Paz, Liat Peterfreund
Playing Guess Who with your kids: Code-word strategy against adversaries. Theor. Comput. Sci. 1016 (2024)
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto
Sinkless Orientation Made Simple. SOSA (2023)
Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid
The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS (2023)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
-resilient consensus in arbitrary graphs. Inf. Comput. 292 (2023)
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR (2023)
Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler, Ami Paz, Stefan Schmid
Topological Characterization of Consensus Solvability in Directed Dynamic Networks. CoRR (2023)
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC (2023)
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR (2022)
Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid, Kyrill Winkler
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. CoRR (2022)
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. CoRR (2022)
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
The augmentation-speed tradeoff for consistent network updates. SOSR (2022)
Ami Paz, Liat Peterfreund
Playing Guess Who with Your Kids. FUN (2022)
Monika Henzinger, Ami Paz, A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. ESA (2022)
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. PODC (2022)
Monika Henzinger, Ami Paz, A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. CoRR (2022)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in distributed proofs. Distributed Comput. 34 (2) (2021)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849 (2021)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. ITCS (2021)
Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman
On the Complexity of Load Balancing in Dynamic Networks. CoRR (2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC (2021)
Monika Henzinger, Ami Paz, Stefan Schmid
On the Complexity of Weight-Dynamic Network Algorithms. CoRR (2021)
Monika Henzinger, Ami Paz, Stefan Schmid
On the Complexity of Weight-Dynamic Network Algorithms. Networking (2021)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
Smaller Cuts, Higher Lower Bounds. ACM Trans. Algorithms 17 (4) (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. Proc. ACM Meas. Anal. Comput. Syst. 5 (1) (2021)
Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman
On the Complexity of Load Balancing in Dynamic Networks. SPAA (2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Sinkless orientation is hard also in the supported LOCAL model. CoRR (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) (2021)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR (2020)
Uri Meir, Ami Paz, Gregory Schwartzman
Models of Smoothing in Dynamic Networks. DISC (2020)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-dynamic distributed graph algorithms for congested networks. CoRR (2020)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. CoRR (2020)
Ofer Grossman, Seri Khoury, Ami Paz
Improved Hardness of Approximation of Diameter in the CONGEST Model. DISC (2020)
Keren Censor-Hillel, Ami Paz, Mor Perry
Approximate proof-labeling schemes. Theor. Comput. Sci. 811 (2020)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM (2020)
Uri Meir, Ami Paz, Gregory Schwartzman
Models of Smoothing in Dynamic Networks. CoRR (2020)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC (2020)
Pierre Fraigniaud, Ami Paz
The Topology of Local Computing in Networks. ICALP (2020)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The sparsest additive spanner via multiple weighted BFS trees. Theor. Comput. Sci. 840 (2020)
Pierre Fraigniaud, Ami Paz
The Topology of Local Computing in Networks. CoRR (2020)
Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS (2020)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic methods in the congested clique. Distributed Comput. 32 (6) (2019)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48 (1) (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. PODC (2019)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
Smaller Cuts, Higher Lower Bounds. CoRR (2019)
Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. CoRR (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-offs in Distributed Interactive Proofs. CoRR (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. SIROCCO (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-Offs in Distributed Interactive Proofs. DISC (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. CoRR (2019)
Ami Paz, Gregory Schwartzman
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Trans. Algorithms 15 (2) (2019)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in Distributed Proofs. DISC (2018)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed construction of purely additive spanners. Distributed Comput. 31 (3) (2018)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in Distributed Proofs. CoRR (2018)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. OPODIS (2018)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. CoRR (2018)
Keren Censor-Hillel, Seri Khoury, Ami Paz
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC (2017)
Keren Censor-Hillel, Seri Khoury, Ami Paz
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. CoRR (2017)
Ami Paz, Gregory Schwartzman
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. CoRR (2017)
Keren Censor-Hillel, Ami Paz, Mor Perry
Approximate Proof-Labeling Schemes. SIROCCO (2017)
Ami Paz, Gregory Schwartzman
A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. SODA (2017)
Hagit Attiya, Ami Paz
Counting-based impossibility proofs for set agreement and renaming. J. Parallel Distributed Comput. 87 (2016)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed Construction of Purely Additive Spanners. DISC (2016)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed Construction of Purely Additive Spanners. CoRR (2016)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. PODC (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. CoRR (2015)
Ami Paz
Bremen workshop review. SIGACT News 44 (4) (2013)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Upper bound on the complexity of solving hard renaming. PODC (2013)
Hagit Attiya, Ami Paz
Counting-Based Impossibility Proofs for Renaming and Set Agreement. DISC (2012)