The following pages link to Keren Censor-Hillel (Q259273):
Displaying 43 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)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Near-linear lower bounds for distributed distance computations, even in sparse networks (Q1660917) (← links)
- Computing in additive networks with bounded-information codes (Q1664154) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
- Lower Bounds for Restricted-Use Objects (Q2812146) (← links)
- Concurrent Use of Write-Once Memory (Q2835021) (← links)
- Approximate shared-memory counting despite a strong adversary (Q2930301) (← links)
- Faster than optimal snapshots (for a while) (Q2933814) (← links)
- Lower bounds for randomized consensus under a weak adversary (Q2934356) (← links)
- Randomized consensus in expected O(n log n) individual work (Q2934357) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
- Distributed connectivity decomposition (Q2943618) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← 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)
