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
- ICDE 2026: Efficient and Scalable Search for Statistics
- Ghufran Khan defends his PhD
- CoopIS 2025: RDF Query Answering in the Presence of Access Restrictions
- EMNLP 2025: “The Search for Conflicts of Interest: Open Information Extraction in Scientific Publications”
- Three papers accepted to ACL 2025
Latest News
- ICDE 2026: Efficient and Scalable Search for Statistics
- Dr. Benjamin Ocampo: “When Hate Meets Facts: Exploring the Intersection of Hate Speech and Check-Worthiness”
- Ghufran Khan defends his PhD
- Prof. George Fletcher: “On the (im)possibilities of generative AI in education”
More…
