-
Quantum coin flipping and bit commitment : optimal bounds, pratical construct...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with information theoretic security. In 1984, Bennett and Brassard presented a... -
Synchronous Set Agreement: a Concise Guided Tour (with open problems)
The $k$-set agreement problem is a paradigm of coordination problems encountered in distributed computing. The parameter $k$ defines the coordination degree we are... -
Development of quality indicators for the finite element method : application...
The thesis proposes to study the accuracy of the finite element method (FEM) analyses by means of « quality indicators ». The quality indicators represent simple... -
Tabu search and lower bound for an industrial complex shop scheduling problem
International audience -
Improving the preemptive bound for the one-machine dynamic total completion t...
International audience -
Minimizing the number of late jobs on parallel machines with alpha time windows
International audience -
Asymptotic behavior for the Navier--Stokes Equations with nonzero external fo...
International audience
