| Online metric algorithms with untrusted predictions A Antoniadis, C Coester, M Eliáš, A Polak, B Simon ACM transactions on algorithms 19 (2), 1-34, 2023 | 164 | 2023 |
| Scheduling on two types of resources: a survey O Beaumont, LC Canon, L Eyraud-Dubois, G Lucarelli, L Marchal, ... ACM Computing Surveys (CSUR) 53 (3), 1-36, 2020 | 28 | 2020 |
| Parallel scheduling of dags under memory constraints L Marchal, H Nagy, B Simon, F Vivien 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018 | 28 | 2018 |
| Anti-persistence on persistent storage: History-independent sparse tables and dictionaries MA Bender, JW Berry, R Johnson, TM Kroeger, S McCauley, CA Phillips, ... Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 22 | 2016 |
| Online scheduling of task graphs on heterogeneous platforms LC Canon, L Marchal, B Simon, F Vivien IEEE Transactions on Parallel and Distributed Systems 31 (3), 721-732, 2019 | 20 | 2019 |
| Learning-augmented dynamic power management with multiple states via new ski rental bounds A Antoniadis, C Coester, M Eliás, A Polak, B Simon Advances in neural information processing systems 34, 16714-16726, 2021 | 18 | 2021 |
| Paging with succinct predictions A Antoniadis, J Boyar, M Eliás, LM Favrholdt, R Hoeksma, KS Larsen, ... International Conference on Machine Learning, 952-968, 2023 | 17 | 2023 |
| Double coverage with machine-learned advice A Lindermayr, N Megow, B Simon arXiv preprint arXiv:2103.01640, 2021 | 15 | 2021 |
| Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms L Marchal, B Simon, F Vivien Journal of Parallel and Distributed Computing 128, 30-42, 2019 | 14 | 2019 |
| Malleable task-graph scheduling with a practical speed-up model L Marchal, B Simon, O Sinnen, F Vivien IEEE Transactions on Parallel and Distributed Systems 29 (6), 1357-1370, 2018 | 14 | 2018 |
| Mixing predictions for online metric algorithms A Antoniadis, C Coester, M Eliás, A Polak, B Simon International Conference on Machine Learning, 969-983, 2023 | 10 | 2023 |
| Speed-robust scheduling: sand, bricks, and rocks F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon Mathematical Programming 197 (2), 1009-1048, 2023 | 10 | 2023 |
| Online scheduling of task graphs on hybrid platforms LC Canon, L Marchal, B Simon, F Vivien European Conference on Parallel Processing, 192-204, 2018 | 8 | 2018 |
| Scheduling trees of malleable tasks for sparse linear algebra A Guermouche, L Marchal, B Simon, F Vivien Euro-Par 2015: Parallel Processing: 21st International Conference on …, 2015 | 8 | 2015 |
| Fully dynamic algorithms for knapsack problems with polylogarithmic update time F Eberle, N Megow, L Nölke, B Simon, A Wiese arXiv preprint arXiv:2007.08415, 2020 | 6 | 2020 |
| Scheduling task graphs on modern computing platforms B Simon Université de Lyon, 2018 | 6* | 2018 |
| Discovering and certifying lower bounds for the online bin stretching problem M Böhm, B Simon Theoretical Computer Science 938, 1-15, 2022 | 5 | 2022 |
| Energy minimization in dag scheduling on mpsocs at run-time: Theory and practice B Simon, J Falk, N Megow, J Teich arXiv preprint arXiv:1912.09170, 2019 | 5 | 2019 |
| The i/o complexity of computing prime tables MA Bender, R Chowdhury, A Conway, M Farach-Colton, P Ganapathi, ... LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 4 | 2016 |
| Deadlock avoidance and detection in railway simulation systems B Simon, B Jaumard, TH Le Transportation Research Record 2448 (1), 45-52, 2014 | 4 | 2014 |
