Recherche
Title: Distributed derandomization revisited One of the cornerstones of the distributed complexity theory is the derandomization result by Chang
/Exposé en français/Talk in french/English slides/Transparents en anglais/ *Only offline, no online version* * En présentiel uniquement * For given
/Exposé /Talk/ Sperner's lemma states that if a labelling of the vertices of a triangulation $K$ of the $d$-simplex $\Delta^d$ with labels $1, 2,
On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the
We use quantum devices from IBMQ to perform digital quantum simulations of the Schwinger model. We work with a quantum link model description of the
Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic
In this talk, we focus on unary temporal logic over words (UTL). It is known that languages definable in this logic have several equivalent
(Uniquement en présentiel / Only offline, no online version) A geometric graph G is a graph drawn in the Euclidean plane such that its vertices are
Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most
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