Prati
Ami Paz
Ami Paz
CNRS
Potvrđena adresa e-pošte na lisn.fr - Početna stranica
Naslov
Citirano
Citirano
Godina
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
1422015
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
782018
Quadratic and near-quadratic lower bounds for the CONGEST model
K Censor-Hillel, S Khoury, A Paz
arXiv preprint arXiv:1705.05646, 2017
532017
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
442019
Approximate proof-labeling schemes
K Censor-Hillel, A Paz, M Perry
Theoretical Computer Science 811, 112-124, 2020
432020
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
332021
Distributed construction of purely additive spanners
K Censor-Hillel, T Kavitha, A Paz, A Yehudayoff
Distributed Computing 31 (3), 167-185, 2018
302018
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
292021
Trade-offs in distributed interactive proofs
P Crescenzi, P Fraigniaud, A Paz
arXiv preprint arXiv:1908.03363, 2019
292019
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
Smaller cuts, higher lower bounds
A Abboud, K Censor-Hillel, S Khoury, A Paz
ACM Transactions on Algorithms (TALG) 17 (4), 1-40, 2021
242021
The topology of local computing in networks
P Fraigniaud, A Paz
arXiv preprint arXiv:2003.03255, 2020
112020
Improved hardness of approximation of diameter in the CONGEST model
O Grossman, S Khoury, A Paz
102020
Distributed quantum proofs for replicated data
P Fraigniaud, FL Gall, H Nishimura, A Paz
arXiv preprint arXiv:2002.10018, 2020
92020
Simple and fast distributed computation of betweenness centrality
P Crescenzi, P Fraigniaud, A Paz
IEEE INFOCOM 2020-IEEE Conference on Computer Communications, 337-346, 2020
82020
Synchronous t-Resilient Consensus in Arbitrary Graphs
A 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
72021
The time complexity of consensus under oblivious message adversaries
K Winkler, A Paz, HR Galeana, S Schmid, U Schmid
Algorithmica, 1-32, 2024
62024
On the complexity of load balancing in dynamic networks
S Gilbert, U Meir, A Paz, G Schwartzman
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
52021
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20