Pierre‐Cyrille Héam

Université de Bourgogne — France

Computer Science · Physical Sciences

11h-index1.7kcitations106works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(35), semigroups and automata theory(26), Software Testing and Debugging Techniques(25), Logic, programming, and type systems(19), Scheduling and Optimization Algorithms(15)

Publications106 total

An update on the asymptotic optimality of the longest processing time heuristic
Journal of Scheduling·2026
Approximation Bounds for SLACK on Identical Parallel Machines
Lecture notes in computer science·2025
MCMC generation of cost matrices for scheduling performance evaluation
Future Generation Computer Systems·2025
Asymptotic Performance and Energy Consumption of SLACK
Lecture notes in computer science·2023· 1 citedOpen Access
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds
Journal of Parallel and Distributed Computing·2022· 7 cited
ELECTOR: Deterministic leader election algorithm for modular robots
2022
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds
HAL (Le Centre pour la Communication Scientifique Directe)·2022Open Access
Shelf schedules for independent moldable tasks to minimize the energy consumption
2021· 1 citedOpen Access
Update on the Asymptotic Optimality of LPT
Lecture notes in computer science·2021· 6 citedOpen Access
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that
HAL (Le Centre pour la Communication Scientifique Directe)·2019Open Access
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that
2019
A Comparison of Random Task Graph Generation Methods for Scheduling\n Problems
arXiv (Cornell University)·2019· 21 citedOpen Access
A Comparison of Random Task Graph Generation Methods for Scheduling Problems
Lecture notes in computer science·2019· 3 citedOpen Access
Code to compare random task graph generation methods
Figshare·2019Open Access
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation
2018· 1 citedOpen Access
An Approximation-based Approach for the Random Exploration of Large Models
HAL (Le Centre pour la Communication Scientifique Directe)·2018Open Access
Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes
Mathematics·2018· 1 citedOpen Access
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for\n Scheduling Performance Evaluation
arXiv (Cornell University)·2018Open Access
An Approximation-Based Approach for the Random Exploration of Large Models
Lecture notes in computer science·2018· 2 citedOpen Access
A Cryptographic Approach for Steganography
arXiv (Cornell University)·2017Open Access
page 1 of 6Next →

Frequent Co-authors

Olga Kouchnarenko(19), Yohan Boichut(9), Christophe Guyeux(7), Louis-Claude Canon(6), Frédéric Dadeau(4), Jacques M. Bahi(4), Roméo Courbis(4), Jérôme Voinot(4), Rafik Kheddam(3), Raphaël Couturier(3), Cyril Nicaud(3), Mohamad El Sayah(2), Ghazi Maatoug(2), Michaël Rusinowitch(2), Jean-François Couchot(2), Gérard Cécé(2), Yann Mainier(2), Sylvain Schmitz(2), Anne Benoît(2), Redouane Elghazi(2)