Recherche

Age-related macular degeneration (AMD) is one of the leading causes of legal blindness worldwide. However, manual screening of the retina for

Verifying Liveness Properties under Weak Memory Models I will discuss verifying liveness properties for concurrent programs running on weak memory

/Exposé en anglais/Talk in english/ Let G be a bridgeless cubic graph. The Berge-Fulkerson Conjecture (1970s) states that G admits a list of six

Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [Note: no quantum background is needed to attend this talk] Quantum

We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by

Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

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