The following pages link to Michael Elkin (Q265068):
Displaying 3 items.
- A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968) (← links)
- Near-Optimal Distributed Routing with Low Memory (Q5197685) (← links)
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity (Q5368959) (← links)
