Recherche

[RATIO] Sanja Lukumbuzya

Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with

GT AlgoDist, Chana Weil-Kennedy, «Parameterized Verification of Distributed Systems»

Chana Weil-Kennedy (CEA List) Title: Parameterized Verification of Distributed Systems Abstract: I am interested in verification of distributed

[gt.go] - "The Alon-Jaeger-Tarsi conjecture via group ring identities" by Péter Pál Pach

/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

PapyTwin net: a Twin network for Greek letters detection on ancient Papyri

Séminaire TAD

[M2F] Parosh Adbulla

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

[gt.go] - "A tight local algorithm for the minimum dominating set problem in > outerplanar graphs" and "Limiting crossing numbers" by Alexandra Wesole

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

GT AlgoDist, «A Parameterized-Complexity Framework for Finding Local Optima», Nils Morawietz

Nils Morawietz (LaBRI) Title: A Parameterized-Complexity Framework for Finding Local Optima Abstract: Local search is a fundamental optimization

[LX] Edwin Hamel de Le Court

*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity

Cross-modal Swin Transformer for computer-assisted diagnosis of age-related macular degeneration

Séminaire TAD

[gt.go] - "Monochromatic partitions of graphs and hypergraphs" by Jozef Skokan

/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type