Recherche
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per
/Exposé en anglais/Talk in english/ We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite
/Exposé en anglais/Talk in english/ What structure can be found in a graph G with large chromatic number? One possibility is that G contains a large
Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases
/Exposé en anglais/Talk in english/ An $\alpha,\beta$-Kempe swap in a properly colored graph interchanges the colors on some component of the subgraph
The Many-Worlds Calculus: Representing Quantum Control. We explore the interaction between two monoidal structures: a multiplicative one, for the
/Exposé /Talk/ Positional games were introduced by Hales and Jewett in 1963. They are usually played on a hypergraph, and two players take turns
Mohammed Dlimi will present the results on thresholds for boundedness of Branching Immediate Observation systems. BIO Petri nets have transitions
Title: Algorithmic Aspects of the Comparison of Phylogenetic Network Homomorphisms in graphs with forbidden structures Abstract: For a fixed graph H
/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n