Recherche
On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the
Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the
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
In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed
/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