Recherche

Robin Vacus (Bocconi University of Milan) Title: Information Spread with Minimal Resources: some insights from the bit-dissemination problem. Abstract

On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for

Well quasi orderings (WQOs) are at the heart of the theory of Well-Structured Systems (WSTS), a class of computational models that brought numerous

/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the

This talk is mostly based on a paper by Andras Gilyen, Matthew Hastings and Umesh Vazirani titled "(Sub)Exponential advantage of adiabatic Quantum

In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal

(Uniquement en présentiel / Only offline, no online version) The Metric Dimension problem consits in identifying vertices in a graph. The Metric

/Exposé en anglais/Talk in english/ Two boxes in R^d are comparable if one of them is a subset of a translation of the other. The comparable box

In 2019, Abu Radi and Kupferman gave a polynomial-time algorithm to minimise transition-based history-deterministic co-Büchi automata. In this talk, I

Pushdown Vector Addition Systems with States (PVASS) consist of finitely many control states, a pushdown stack, and a set of counters that can be