Recherche
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
/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
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
/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
*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity