Recherche

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

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

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 sublinear-time quantum algorithm for approximating partition functions Gibbs partition functions are ubiquitous in statistical physics and in

Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States