Folgen
Ami Paz
Ami Paz
CNRS
Bestätigte E-Mail-Adresse bei lisn.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1242019
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
592018
Quadratic and near-quadratic lower bounds for the CONGEST model
K Censor-Hillel, S Khoury, A Paz
arXiv preprint arXiv:1705.05646, 2017
502017
Approximate proof-labeling schemes
K Censor-Hillel, A Paz, M Perry
Theoretical Computer Science 811, 112-124, 2020
322020
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
312019
Counting-based impossibility proofs for set agreement and renaming
H Attiya, A Paz
Journal of Parallel and Distributed Computing 87, 1-12, 2016
30*2016
Distributed construction of purely additive spanners
K Censor-Hillel, T Kavitha, A Paz, A Yehudayoff
Distributed Computing 31 (3), 167-185, 2018
282018
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
23*2019
Redundancy in distributed proofs
L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry
Distributed Computing 34 (2), 113-132, 2021
202021
Trade-offs in distributed interactive proofs
P Crescenzi, P Fraigniaud, A Paz
arXiv preprint arXiv:1908.03363, 2019
162019
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
152021
Smaller cuts, higher lower bounds
A Abboud, K Censor-Hillel, S Khoury, A Paz
ACM Transactions on Algorithms (TALG) 17 (4), 1-40, 2021
142021
The topology of local computing in networks
P Fraigniaud, A Paz
arXiv preprint arXiv:2003.03255, 2020
92020
Fast deterministic algorithms for highly-dynamic networks
K Censor-Hillel, N Dafni, VI Kolobov, A Paz, G Schwartzman
arXiv preprint arXiv:1901.04008, 2019
92019
Improved hardness of approximation of diameter in the CONGEST model
O Grossman, S Khoury, A Paz
62020
The sparsest additive spanner via multiple weighted BFS trees
K Censor-Hillel, A Paz, N Ravid
Theoretical Computer Science 840, 33-44, 2020
52020
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
42021
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
42020
Synchronous t-Resilient Consensus in Arbitrary Graphs
A Castañeda, P Fraigniaud, A Paz, S Rajsbaum, M Roy, C Travers
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2019
32019
Models of smoothing in dynamic networks
U Meir, A Paz, G Schwartzman
arXiv preprint arXiv:2009.13006, 2020
22020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20