1 citations · 2 across the 2 of their papers we have counts for
5 papers
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…
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 $α<1…
Pointer Chasing with Unlimited Interaction
Orr Fischer, Rotem Oshman, Adi Rosen +1
Pointer-chasing is a central problem in two-party communication complexity: given input size and a parameter , the two players Alice and Bob are given functions $N_A, N_B: […
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
Keren Censor-Hillel, Orr Fischer, Ran Gelles +1
We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction of adversarial crash faults. In particular, we show…
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
Orr Fischer, Merav Parter
Resilient computation in all-to-all-communication models has attracted tremendous attention over the years. Most of these works assume the classical faulty model which restricts th…