Bertrand Simon

Orcid: 0000-0002-2565-1163

Affiliations:
  • CNRS, IN2P3 Computing Center, Villeurbanne, France
  • University of Bremen, Germany (2018 - 2020)
  • University of Lyon, France (PhD 2018)


According to our database1, Bertrand Simon authored at least 27 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Online Metric Algorithms with Untrusted Predictions.
ACM Trans. Algorithms, April, 2023

Speed-robust scheduling: sand, bricks, and rocks.
Math. Program., February, 2023

Minimizing I/Os in Out-of-Core Task Tree Scheduling.
Int. J. Found. Comput. Sci., January, 2023

Mixing Predictions for Online Metric Algorithms.
Proceedings of the International Conference on Machine Learning, 2023

Paging with Succinct Predictions.
Proceedings of the International Conference on Machine Learning, 2023

2022
Discovering and certifying lower bounds for the online bin stretching problem.
Theor. Comput. Sci., 2022

On Hop-Constrained Steiner Trees in Tree-Like Metrics.
SIAM J. Discret. Math., 2022

Double Coverage with Machine-Learned Advice.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

An Exact Algorithm for the Linear Tape Scheduling Problem.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Scheduling on Two Types of Resources: A Survey.
ACM Comput. Surv., 2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Online Scheduling of Task Graphs on Heterogeneous Platforms.
IEEE Trans. Parallel Distributed Syst., 2020

Speed-Robust Scheduling.
CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Scheduling on Hybrid Platforms: Improved Approximability Window.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice.
Proceedings of the Workshop on Next Generation Real-Time Embedded Systems, 2020

2019
Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms.
J. Parallel Distributed Comput., 2019

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

Malleable Task-Graph Scheduling with a Practical Speed-Up Model.
IEEE Trans. Parallel Distributed Syst., 2018

Parallel Scheduling of DAGs under Memory Constraints.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Online Scheduling of Task Graphs on Hybrid Platforms.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

2016
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

The I/O Complexity of Computing Prime Tables.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Resource Optimization for Program Committee Members: A Subreview Article.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Scheduling Trees of Malleable Tasks for Sparse Linear Algebra.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015


  Loading...