8 citations · 21 across the 13 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.CC2025
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: […
cs.DS2025
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…
cs.DS2025
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…