Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 139 | 2015 |

A (2+ ε)-approximation for maximum weight matching in the semi-streaming model A Paz, G Schwartzman ACM Transactions on Algorithms (TALG) 15 (2), 1-15, 2018 | 76 | 2018 |

Quadratic and near-quadratic lower bounds for the CONGEST model K Censor-Hillel, S Khoury, A Paz arXiv preprint arXiv:1705.05646, 2017 | 53 | 2017 |

Approximate proof-labeling schemes K Censor-Hillel, A Paz, M Perry Theoretical Computer Science 811, 112-124, 2020 | 43 | 2020 |

Hardness of distributed optimization N Bacrach, K Censor-Hillel, M Dory, Y Efron, D Leitersdorf, A Paz Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 43 | 2019 |

Counting-based impossibility proofs for set agreement and renaming H Attiya, A Paz Journal of Parallel and Distributed Computing 87, 1-12, 2016 | 35* | 2016 |

Redundancy in distributed proofs L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry Distributed Computing 34, 113-132, 2021 | 31 | 2021 |

Distributed construction of purely additive spanners K Censor-Hillel, T Kavitha, A Paz, A Yehudayoff Distributed Computing 31 (3), 167-185, 2018 | 31 | 2018 |

A topological perspective on distributed network algorithms A Castaņeda, P Fraigniaud, A Paz, S Rajsbaum, M Roy, C Travers Theoretical Computer Science 849, 121-137, 2021 | 29 | 2021 |

Bounds on the step and namespace complexity of renaming H Attiya, A Castaņeda, M Herlihy, A Paz SIAM Journal on Computing 48 (1), 1-32, 2019 | 28* | 2019 |

Trade-offs in distributed interactive proofs P Crescenzi, P Fraigniaud, A Paz arXiv preprint arXiv:1908.03363, 2019 | 27 | 2019 |

Smaller cuts, higher lower bounds A Abboud, K Censor-Hillel, S Khoury, A Paz ACM Transactions on Algorithms (TALG) 17 (4), 1-40, 2021 | 23 | 2021 |

The topology of local computing in networks P Fraigniaud, A Paz arXiv preprint arXiv:2003.03255, 2020 | 11 | 2020 |

Improved hardness of approximation of diameter in the CONGEST model O Grossman, S Khoury, A Paz | 10 | 2020 |

Synchronous *t*-Resilient Consensus in Arbitrary GraphsA Castaņeda, P Fraigniaud, A Paz, S Rajsbaum, M Roy, C Travers Stabilization, Safety, and Security of Distributed Systems: 21st …, 2019 | 8* | 2019 |

On the complexity of weight-dynamic network algorithms M Henzinger, A Paz, S Schmid 2021 IFIP Networking Conference (IFIP Networking), 1-9, 2021 | 7 | 2021 |

Distributed quantum proofs for replicated data P Fraigniaud, FL Gall, H Nishimura, A Paz arXiv preprint arXiv:2002.10018, 2020 | 7 | 2020 |

The time complexity of consensus under oblivious message adversaries K Winkler, A Paz, HR Galeana, S Schmid, U Schmid Algorithmica, 1-32, 2024 | 6 | 2024 |

Input-dynamic distributed algorithms for communication networks KT Foerster, JH Korhonen, A Paz, J Rybicki, S Schmid Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (1 …, 2021 | 5 | 2021 |

The sparsest additive spanner via multiple weighted BFS trees K Censor-Hillel, A Paz, N Ravid Theoretical Computer Science 840, 33-44, 2020 | 5 | 2020 |