The following pages link to Bertrand Simon (Q1693049):
Displaying 12 items.
- Scheduling trees of malleable tasks for sparse linear algebra (Q1693050) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- Scheduling on hybrid platforms: improved approximability window (Q2081599) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- Speed-robust scheduling: sand, bricks, and rocks (Q2689830) (← links)
- The I/O Complexity of Computing Prime Tables (Q2802940) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- (Q5282805) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- (Q6126344) (← links)
- Minimizing I/Os in Out-of-Core Task Tree Scheduling (Q6169958) (← links)
- (Q6187032) (← links)