The following pages link to Keren Censor-Hillel (Q259273):
Displaying 50 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)
- Tight bounds for asynchronous randomized consensus (Q3452186) (← links)
- The One-Out-of-k Retrieval Problem and Linear Network Coding (Q3460449) (← links)
- The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels (Q3547931) (← links)
- (Q3549610) (← links)
- Erratum (Q4625659) (← links)
- (Q4633853) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- Bounded-Contention Coding for Wireless Networks in the High SNR Regime (Q4909404) (← links)
- Fast Information Spreading in Graphs with Large Weak Conductance (Q4910571) (← links)
- Tight Bounds on Vertex Connectivity Under Sampling (Q4962652) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Smaller Cuts, Higher Lower Bounds (Q5035874) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5091074) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- (Q5092335) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Fast Approximate Shortest Paths in the Congested Clique (Q5145183) (← links)
- Hardness of Distributed Optimization (Q5145214) (← links)
- Max registers, counters, and monotone circuits (Q5170299) (← links)
