The paper “On the Complexity of Universality for Partially Ordered NFAs” by Markus Krötzsch, Tomas Masopust and Michaël Thomazo has been accepted for publication at the Mathematical Foundations of Computer Science (MFCS 2016) conference.
Main recent results
- The Andreas Pfitzmann Best Student Paper Award in PETS’24
- Nelly Barret’s PhD defense
- EMNLP 2023: Evaluating the Factual Faithfulness of Graph-to-Text Generation
- EDBT 2024: “Computing Generic Abstractions from Application Datasets”
- WWW 2023: “On Detecting Policy-Related Political Ads: An Exploratory Analysis of Meta Ads in 2022 French Election”
Latest News
- PVLDB: “Dynamic Graph Databases with Out-of-order-updates”
- The Andreas Pfitzmann Best Student Paper Award in PETS’24
- BDA 2024: three papers and three demonstrations accepted
- BigVis 2024: “A Unified Visual Exploration Framework for (Semi -) Structured Data”
More…