Pages that link to "Item:Q4228428"
From MaRDI portal
The following pages link to Exact analysis of hot-potato routing. (Extended abstract) (Q4228428):
Displaying 19 items.
- \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks (Q706318) (← links)
- Randomized routing on generalized hypercubes (Q1351447) (← links)
- Potential function analysis of greedy hot-potato routing (Q1384707) (← links)
- Many-to-many routing on trees via matchings (Q1390958) (← links)
- A lower bound for nearly minimal adaptive and hot potato algorithms (Q1393080) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Randomized Single-Target Hot-Potato Routing (Q3128988) (← links)
- Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus (Q3502649) (← links)
- Scheduled Hot-Potato Routing (Q4397215) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- (Q4796139) (← links)
- Safe and efficient traffic laws for mobile robots (Q5054827) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- Greedy hot-potato routing on the two-dimensional mesh (Q5136999) (← links)
- Networks on which hot-potato routing does not livelock (Q5137895) (← links)
- Euro-Par 2004 Parallel Processing (Q5311348) (← links)
- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks (Q6102312) (← links)
- Dynamic tree routing under the “matching with consumption” model (Q6487447) (← links)
