The following pages link to Michal Dory (Q1988523):
Displaying 15 items.
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Fast Approximate Shortest Paths in the Congested Clique (Q5145183) (← links)
- Hardness of Distributed Optimization (Q5145214) (← links)
- Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph (Q5145264) (← links)
- Distributed Spanner Approximation (Q5197675) (← links)
- Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs (Q5197676) (← links)
- Brief Announcement (Q5368963) (← links)
- Exponentially Faster Shortest Paths in the Congested Clique (Q5855208) (← links)
- Exponentially Faster Shortest Paths in the Congested Clique (Q5889790) (← links)
- A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph (Q6538697) (← links)
- Fast 2-approximate all-pairs shortest paths (Q6645539) (← links)
- Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)
