Ariel Sapir

According to our database, Ariel Sapir authored at least 7 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs.

Liam Roditty, Ariel Sapir

CoRR, April, 2026

2025

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms.

Liam Roditty, Ariel Sapir

Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

2021

Nonstationary vs. stationary iterative processes.

Luba Sapir, Tamara Kogan, Ariel Sapir, Amir Sapir

Numer. Algorithms, 2021

Is 2NF a Stable Normal Form?

Amir Sapir, Ariel Sapir

CoRR, 2021

A Tight Negative Example for MMS Fair Allocations.

Uriel Feige, Ariel Sapir, Laliv Tauber

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2019

Nonstationary iterative processes.

Luba Sapir, Tamara Kogan, Ariel Sapir, Amir Sapir

CoRR, 2019

2017

To the question of efficiency of iterative methods.

Tamara Kogan, Luba Sapir, Amir Sapir, Ariel Sapir

Appl. Math. Lett., 2017