8 citations · 21 across the 13 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023★ 1 cited
Distributed CONGEST Algorithms against Mobile Adversaries
Orr Fischer, Merav Parter
In their seminal PODC 1991 paper, Ostrovsky and Yung introduced the study of distributed computation in the presence of mobile adversaries which can dynamically appear throughout t…
cs.DS2023
Massively Parallel Computation in a Heterogeneous Regime
Orr Fischer, Adi Horowitz, Rotem Oshman
Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear…
cs.LG2023
Tree Learning: Optimal Algorithms and Sample Complexity
Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein +3
We study the problem of learning a hierarchical tree representation of data from labeled samples, taken from an arbitrary (and possibly adversarial) distribution. Consider a collec…