Scheduling Trees of Malleable Tasks for Sparse Linear Algebra. - Abdou Guermouche; Loris Marchal; Bertrand Simon 001; Frédéric Vivien (Euro-Par, 2015)

Resource Optimization for Program Committee Members: A Subreview Article. - Michael A. Bender; Samuel McCauley; Bertrand Simon 001; Shikha Singh 002; Frédéric Vivien (FUN, 2016)

The I/O Complexity of Computing Prime Tables. - Michael A. Bender; Rezaul Chowdhury; Alexander Conway 001; Martin Farach-Colton; Pramod Ganapathi; Rob Johnson 001; Samuel McCauley; Bertrand Simon 001; Shikha Singh 002 (LATIN, 2016)

Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. - Michael A. Bender; Jonathan W. Berry; Rob Johnson 001; Thomas M. Kroeger; Samuel McCauley; Cynthia A. Phillips; Bertrand Simon 001; Shikha Singh 002; David Zage (PODS, 2016)

Online Scheduling of Task Graphs on Hybrid Platforms. - Louis-Claude Canon; Loris Marchal; Bertrand Simon 001; Frédéric Vivien (Euro-Par, 2018)

Parallel Scheduling of DAGs under Memory Constraints. - Loris Marchal; Hanna Nagy; Bertrand Simon 001; Frédéric Vivien (IPDPS, 2018)

Malleable Task-Graph Scheduling with a Practical Speed-Up Model. - Loris Marchal; Bertrand Simon 001; Oliver Sinnen; Frédéric Vivien (IEEE Trans. Parallel Distributed Syst., 2018)

Scheduling task graphs on modern computing platforms. (Ordonnancement de graphes de tâches sur des plates-formes de calcul modernes). - Bertrand Simon 001 (2018)

Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms. - Loris Marchal; Bertrand Simon 001; Frédéric Vivien (J. Parallel Distributed Comput., 2019)

Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. - Bertrand Simon 001; Joachim Falk; Nicole Megow; Jürgen Teich (NG-RES@HiPEAC, 2020)

Scheduling on Hybrid Platforms: Improved Approximability Window. - Vincent Fagnon; Imed Kacem; Giorgio Lucarelli; Bertrand Simon 001 (LATIN, 2020)

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (MFCS, 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Martin Böhm 001; Franziska Eberle; Nicole Megow; Lukas Nölke; Jens Schlöter; Bertrand Simon 001; Andreas Wiese (CoRR, 2020)

Speed-Robust Scheduling. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (CoRR, 2020)

Online Scheduling of Task Graphs on Heterogeneous Platforms. - Louis-Claude Canon; Loris Marchal; Bertrand Simon 001; Frédéric Vivien (IEEE Trans. Parallel Distributed Syst., 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Franziska Eberle; Nicole Megow; Lukas Nölke; Bertrand Simon 001; Andreas Wiese (FSTTCS, 2021)

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (NeurIPS, 2021)

Scheduling on Two Types of Resources: A Survey. - Olivier Beaumont; Louis-Claude Canon; Lionel Eyraud-Dubois; Giorgio Lucarelli; Loris Marchal; Clément Mommessin; Bertrand Simon 001; Denis Trystram (ACM Comput. Surv., 2021)

An Exact Algorithm for the Linear Tape Scheduling Problem. - Valentin Honoré; Bertrand Simon 001; Frédéric Suter (ICAPS, 2022)

Double Coverage with Machine-Learned Advice. - Alexander Lindermayr; Nicole Megow; Bertrand Simon 001 (ITCS, 2022)

On Hop-Constrained Steiner Trees in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (SIAM J. Discret. Math., 2022)

Discovering and certifying lower bounds for the online bin stretching problem. - Martin Böhm 001; Bertrand Simon 001 (Theor. Comput. Sci., 2022)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Mixing Predictions for Online Metric Algorithms. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Minimizing I/Os in Out-of-Core Task Tree Scheduling. - Loris Marchal; Samuel McCauley; Bertrand Simon 001; Frédéric Vivien (Int. J. Found. Comput. Sci., 2023)

Speed-robust scheduling: sand, bricks, and rocks. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (Math. Program., 2023)

Online Metric Algorithms with Untrusted Predictions. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ACM Trans. Algorithms, 2023)

Contract Scheduling with Distributional and Multiple Advice. - Spyros Angelopoulos 001; Marcin Bienkowski; Christoph Dürr; Bertrand Simon 001 (IJCAI, 2024)

Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees. - Christopher Chung; William Jannen; Samuel McCauley; Bertrand Simon 001 (SPAA, 2024)

Root-to-Leaf Scheduling in Write-Optimized Trees. - Christopher Chung; William Jannen; Samuel McCauley; Bertrand Simon 001 (CoRR, 2024)