The following pages link to Keren Censor-Hillel (Q259273):
Displaying 19 items.
- The one-out-of-\(k\) retrieval problem and linear network coding (Q259276) (← links)
- (Q666059) (redirect page) (← links)
- Combining shared-coin algorithms (Q666060) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- (Q5091074) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- (Q5092335) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- A Generic Undo Support for State-Based CRDTs (Q5874227) (← links)
- Locally checkable labelings with small messages (Q6083368) (← links)
- Distributed computations in fully-defective networks (Q6091854) (← links)
- Correction to: ``Distributed computations in fully-defective networks'' (Q6091855) (← links)
- (Q6126262) (← links)
- (Q6126264) (← links)
- Quadratic and near-quadratic lower bounds for the CONGEST model (Q6487481) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q6487482) (← links)
- Erasure correction for noisy radio networks (Q6487527) (← links)
