Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Distributed Computing 32 (6), 461-478, 2019 | 90 | 2019 |

A (2+∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model A Paz, G Schwartzman Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 33 | 2017 |

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

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

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

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

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

Redundancy in distributed proofs L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry arXiv preprint arXiv:1803.03031, 2018 | 12 | 2018 |

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 | 8 | 2019 |

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

A topological perspective on distributed network algorithms A Castañeda, P Fraigniaud, A Paz, S Rajsbaum, M Roy, C Travers International Colloquium on Structural Information and Communication …, 2019 | 5 | 2019 |

Smaller cuts, higher lower bounds A Abboud, K Censor-Hillel, S Khoury, A Paz arXiv preprint arXiv:1901.01630, 2019 | 4 | 2019 |

The sparsest additive spanner via multiple weighted bfs trees K Censor-Hillel, A Paz, N Ravid Theoretical Computer Science, 2020 | 3 | 2020 |

Fast and simple deterministic algorithms for highly-dynamic networks K Censor-Hillel, N Dafni, VI Kolobov, A Paz, G Schwartzman arXiv preprint arXiv:1901.04008, 2019 | 2 | 2019 |

The Topology of Local Computing in Networks P Fraigniaud, A Paz arXiv preprint arXiv:2003.03255, 2020 | 1 | 2020 |

Simple and Fast Distributed Computation of Betweenness Centrality P Crescenzi, P Fraigniaud, A Paz arXiv preprint arXiv:2001.08108, 2020 | 1 | 2020 |

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 | 1 | 2018 |

Counting-based impossibility proofs for distributed tasks A Paz, H Attiya Computer Science Department, Technion, 2013 | 1 | 2013 |

Calcul distribué simple et efficace de la betweenness P Crescenzi, P Fraigniaud, A Paz ALGOTEL 2020–22èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2020 | | 2020 |

Input-dynamic distributed graph algorithms for congested networks KT Foerster, JH Korhonen, A Paz, J Rybicki, S Schmid arXiv preprint arXiv:2005.07637, 2020 | | 2020 |