The following pages link to Leonid Barenboim (Q992508):
Displaying 26 items.
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Distributed symmetry-breaking algorithms for congested cliques (Q1625140) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Distributed backup placement (Q2084982) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks (Q2796270) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (Q2934329) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- Deterministic and Energy-Optimal Wireless Synchronization (Q3095330) (← links)
- On the Locality of Some NP-Complete Problems (Q3167029) (← links)
- Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks (Q3177822) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- Nearly Optimal Local Broadcasting in the SINR Model with Feedback (Q3460714) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- Locally-iterative Distributed (Δ + 1)-coloring and Applications (Q5066943) (← links)
- Distributed (δ+1)-coloring in linear (in δ) time (Q5172704) (← links)
- Deterministic distributed vertex coloring in polylogarithmic time (Q5176216) (← links)
- Locally-Iterative Distributed (Δ+ 1) (Q5197709) (← links)
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity (Q5368959) (← links)
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time (Q5395667) (← links)
- Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time (Q5419030) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- (Q6083370) (← links)
- Distributed backup placement in one round and its applications to maximum matching approximation and self-stabilization (Q6538738) (← links)
