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
- 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”
- ESWC 2019: “Reformulation-based query answering for RDF graphs with RDFS ontologies”
- EDBT 2019: “RDF graph summarization: principles, techniques and applications”
Latest News
- 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”
- SBD 2019: “Parallel Quotient Summarization of RDF Graphs”
- Angelos Anadiotis: Fine-grained elasticity for scale-up OLTP systems
More…