-
Towards dynamic randomized algorithms in computational geometry
Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed... -
On Randomness in Hash Functions
International audience -
Pseudo-deterministic Algorithms
International audience -
What Makes Affinity-Based Schedulers So Efficient ?
The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore,... -
Local Distributed Decision
International audience -
Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Met...
Also appeared as Lapack Working Note 285 -
Fast and reliable solutions for numerical linear algebra solvers in high-perf...
In this "Habilitation à Diriger des Recherches" (HDR), we present our research in high-performance scientific computing over the recent years. Our work has been mainly...
