2 papers
cs.DS2019
Binary Decision Diagrams: from Tree Compaction to Sampling
Julien Clément, Antoine Genitrini
Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common…
cs.DC2008
The cost of probabilistic gathering in oblivious robot networks
Julien Clement, Xavier Defago, Maria Gradinariu Potop-Butucaru +1
In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. These abstractions are fundamental coordinatio…