The following pages link to The Token Distribution Problem (Q3833622):
Displaying 21 items.
- Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance (Q497238) (← links)
- The complexity of deterministic PRAM simulation on distributed memory machines (Q679435) (← links)
- Cubical token systems (Q943579) (← links)
- A note on the token distribution problem (Q1178250) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- On the stability of dynamic diffusion load balancing (Q2479533) (← links)
- Optimal Construction of Edge-Disjoint Paths in Random Graphs (Q4210165) (← links)
- (Q4235434) (← links)
- Near‐perfect token distribution (Q4312747) (← links)
- Strongly adaptive token distribution (Q4630278) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- (Q5002766) (← links)
- (Q5091109) (← links)
- Near-perfect token distribution (Q5204326) (← links)
- AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY (Q5248976) (← links)
- Structural Information and Communication Complexity (Q5315230) (← links)
- Implementing shared memory on multi-dimensional meshes and on the fat-tree (Q6102291) (← links)
