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
- 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
- Kun Zhang defends his PhD
Latest News
- Ghufran Khan defends his PhD
- Prof. George Fletcher: “On the (im)possibilities of generative AI in education”
- VLDB 2025: “Graph Transformers for Query Plan Representation: Potentials and Challenges”
- Ghufran Khan: “Scalable Analytics on Multi-Streams Dynamic Graphs“
More…
