Recherche

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from

/Exposé /Talk/ In this talk, we will introduce a novel cooperative game theory model designed to tackle a significant unresolved issue in operations

Maslov’s class K-bar is a fragment of First-Order Logic consisting of formulae in NNF whose variables occurring in the different atoms obey a certain

Ralf Klasing (LaBRI) Title: Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems Abstract: Finding a maximum-weight

/Exposé en anglais/Talk in english/ The Alon-Jaeger-Tarsi conjecture states that for any finite field F of size at least 4 and any nonsingular matrix

Real-time Operating Systems (RTOSs) are widely used to design and develop embedded safety critical software applications. Such applications have to be

/Exposé /Talk/ The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of /n/ robots, starting from a single active