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
- NIPS 2019: “AIDEMe: An active learning based system for interactive exploration of large datasets”
- EDBT 2020: Ontology-Based RDF Integration of Heterogeneous Data
- PVLDB 2019: “UDAO: A Demonstration of a Next-Generation Unified Data Analytics Optimizer”
- PVLDB 2019: “Spade: A Modular Framework for Analytical Exploration of RDF Graphs”
- SIGMOD 2019: “Towards Scalable Hybrid Stores: Constraint-Based Rewriting to the Rescue”
Latest News
- NIPS 2019: “AIDEMe: An active learning based system for interactive exploration of large datasets”
- EDBT 2020: Ontology-Based RDF Integration of Heterogeneous Data
- Qi Fan: Multi-Objective Task Scheduling in Mobile Cloud Environments
- Oana Balalau: Explainable recommendations and representation learning in graphs
More…