Recherche

We define a method that takes advantage of structural reductions to accelerate the verification of reachability problems. We prove the correctness of

Let f, g1, …, gm be polynomials with real coefficients in n variables. Suppose the minimum f* of f over the semialgebraic set S(g) = {x in R^n : g_i(x

Title: Building atlases to benchmark transcriptomics studies

Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many

This talk presents the work I did during my thesis, which I completed in March. Petri nets are a classic formal model for concurrent systems

In order to understand and verify complex systems, we need accurate models that are either understandable for humans or can be analyzed fully

Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance

The talk is in two parts. In the first part, we prove a lower bound on the scrambling speed of a random quantum circuit. We give three applications of

Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance

Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the