Recherche

/Exposé /Talk/ The irregularity strength s(G) of a graph G is the smallest k such that the edges of G can be labelled with 1,...,k so that no two

/Exposé en anglais/Talk in english/ A rainbow matching in an edge-coloured graph is a matching whose edges all have different colours. Let G be a

We aim at designing both theoretically and experimentally methods for the automatic detection of potential bugs in software – or the proof of the

We are interested in tools for synthesizing strategies in timed games with parity objective. From a theoretical point of view, we define and interpret

Quantum physics and chemistry have provided well-recognized theoretical tools to predict the behavior of molecules and materials described by the

Age-related macular degeneration (AMD) is one of the leading causes of legal blindness worldwide. However, manual screening of the retina for

Guess Random Additive Noise Decoder (GRAND) has emerged as a noise-centric universal decoder in classical systems, enabling low-energy, low-latency

Detecting and Explaining Privacy Risks on Temporal Data Speaker: Marie-Christine Rousset, Professor at University of Grenoble Abstract: Personal data

An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by