WP-events

In this presentation, we will analyse from the game theoretical point of view Byzantine Fault Tolerant (BFT) blockchains when processes exhibit rational or Byzantine behaviour. [...]

When in need of benchmarking an algorithm, running said algorithm on a given - likely wide - range of parameters is usually required. In order [...]

We present exact formulas for the number of digraphs in various interesting families: acyclic digraphs (dags), strongly connected digraphs, digraphs with constraints on their strongly [...]

We consider wireless communication networks where service rates of nodes depend the loads of their neighbours. We demonstrate that these rates are utility-maximising in a [...]

We’ll cover basics of Python and design aspects. Do not hesitate to come even if you did not attend the first session. Download the notebook.

The Laplacian of a graph is a key object in the theory of graphs and can be viewed as the generator of a continuous time [...]

The false discovery rate (FDR) is a statistical approach used in multiple hypothesis testing to correct for multiple comparisons. It is typically used in high-throughput [...]