8 citations · 21 across the 13 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
How to Walk a Dog in Parallel: On Parallel Computation of the Discrete Frechet Distance
Leonid Barenboim, Arnold Filtser, Omrit Filtser +1
The Fréchet distance (also known as the dog-leash distance) is a well-studied and prevalent distance measure for polygonal curves. In this paper we present parallel algorithms for…
cs.DS2026★ 1 cited
Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
Arnold Filtser, Orr Fischer
In the -Proof Labeling Scheme model (-PLS model), our goal is to certify that a network of nodes satisfies a given property . A prover assigns a label to each node, and ea…
cs.DC2026★ 1 cited
The Task Completion Problem and its Application to Crash-Resilient Computation
Orr Fischer, Ran Gelles
We study the Task Completion problem, in which abstract tasks must be completed by a network of crash-prone nodes, where up to nodes may crash for some constant .…