Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand Simon 0001
Person information
- affiliation: CNRS, IN2P3 Computing Center, Villeurbanne, France
- affiliation (2018 - 2020): University of Bremen, Germany
- affiliation (PhD 2018): University of Lyon, France
Other persons with the same name
- Bertrand Simon 0002
![[0000-0002-1459-6410]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-1459-6410")
— University of Bordeaux, France (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien:
Minimizing I/Os in Out-of-Core Task Tree Scheduling. Int. J. Found. Comput. Sci. 34(1): 51-80 (2023)- [j8]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023) - [j7]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms 19(2): 19:1-19:34 (2023) - [c18]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. ICML 2023: 952-968 - [c17]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing Predictions for Online Metric Algorithms. ICML 2023: 969-983 - [i14]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing predictions for online metric algorithms. CoRR abs/2304.01781 (2023) - 2022
- [j6]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36(2): 1249-1273 (2022) - [j5]Martin Böhm, Bertrand Simon:
Discovering and certifying lower bounds for the online bin stretching problem. Theor. Comput. Sci. 938: 1-15 (2022) - [c16]Valentin Honoré, Bertrand Simon, Frédéric Suter:
An Exact Algorithm for the Linear Tape Scheduling Problem. ICAPS 2022: 151-159 - [c15]Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Double Coverage with Machine-Learned Advice. ITCS 2022: 99:1-99:18 - [i13]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - 2021
- [j4]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: A Survey. ACM Comput. Surv. 53(3): 56:1-56:36 (2021) - [c14]Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS 2021: 18:1-18:17 - [c13]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO 2021: 283-296 - [c12]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS 2021: 16714-16726 - [i12]Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Double Coverage with Machine-Learned Advice. CoRR abs/2103.01640 (2021) - [i11]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR abs/2110.13116 (2021) - [i10]Valentin Honoré, Bertrand Simon, Frédéric Suter:
An Exact Algorithm for the Linear Tape Scheduling Problem. CoRR abs/2112.09384 (2021) - 2020
- [j3]Louis-Claude Canon, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Online Scheduling of Task Graphs on Heterogeneous Platforms. IEEE Trans. Parallel Distributed Syst. 31(3): 721-732 (2020) - [c11]Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich:
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. NG-RES@HiPEAC 2020: 2:1-2:13 - [c10]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. ICML 2020: 345-355 - [c9]Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. LATIN 2020: 38-49 - [c8]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS 2020: 18:1-18:15 - [i9]Martin Böhm, Bertrand Simon:
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem. CoRR abs/2001.01125 (2020) - [i8]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. CoRR abs/2003.02144 (2020) - [i7]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR abs/2003.05699 (2020) - [i6]Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR abs/2007.08415 (2020) - [i5]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling. CoRR abs/2011.05181 (2020)
2010 – 2019
- 2019
- [j2]Loris Marchal, Bertrand Simon, Frédéric Vivien:
Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms. J. Parallel Distributed Comput. 128: 30-42 (2019) - [i4]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: a Survey. CoRR abs/1909.11365 (2019) - [i3]Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. CoRR abs/1912.03088 (2019) - [i2]Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich:
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. CoRR abs/1912.09170 (2019) - 2018
- [b1]Bertrand Simon:
Scheduling task graphs on modern computing platforms. (Ordonnancement de graphes de tâches sur des plates-formes de calcul modernes). University of Lyon, France, 2018 - [j1]Loris Marchal, Bertrand Simon, Oliver Sinnen, Frédéric Vivien:
Malleable Task-Graph Scheduling with a Practical Speed-Up Model. IEEE Trans. Parallel Distributed Syst. 29(6): 1357-1370 (2018) - [c7]Louis-Claude Canon, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Online Scheduling of Task Graphs on Hybrid Platforms. Euro-Par 2018: 192-204 - [c6]Loris Marchal, Hanna Nagy, Bertrand Simon, Frédéric Vivien:
Parallel Scheduling of DAGs under Memory Constraints. IPDPS 2018: 204-213 - 2017
- [c5]Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien:
Minimizing I/Os in Out-of-Core Task Tree Scheduling. IPDPS Workshops 2017: 884-893 - 2016
- [c4]Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frédéric Vivien:
Resource Optimization for Program Committee Members: A Subreview Article. FUN 2016: 7:1-7:20 - [c3]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh:
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c2]Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage:
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. PODS 2016: 289-302 - 2015
- [c1]Abdou Guermouche, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Scheduling Trees of Malleable Tasks for Sparse Linear Algebra. Euro-Par 2015: 479-490 - 2014
- [i1]Abdou Guermouche, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Scheduling Trees of Malleable Tasks for Sparse Linear Algebra. CoRR abs/1410.7249 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-31 20:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
