Recherche

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

Title: Building atlases to benchmark transcriptomics studies

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

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

/Exposé en anglais/Talk in english/ The Maker-Breaker game is played on a hypergraph H. Maker and Breaker take turns coloring vertices of H, in red

Mouna Safir (IRIF) Title: Some new results with k-set agreement Abstract: In this talk, I will present our investigation of the solvability of k-set

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture