research
∙
04/01/2022
Givens QR Decomposition over Relational Databases
This paper introduces Figaro, an algorithm for computing the upper-trian...
share
research
∙
07/13/2021
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Finding a homomorphism from some hypergraph 𝒬 (or some relational struct...
research
∙
01/21/2021
Work-sensitive Dynamic Complexity of Formal Languages
Which amount of parallel resources is needed for updating a query result...
research
∙
04/27/2020
Dynamic complexity of Reachability: How many changes can we handle?
In 2015, it was shown that reachability for arbitrary directed graphs ca...
research
∙
10/14/2019
Dynamic Complexity Meets Parameterised Algorithms
Dynamic Complexity studies the maintainability of queries with logical f...
research
∙
10/14/2019
Dynamic Complexity of Parity Exists Queries
Given a graph whose nodes may be coloured red, the parity of the number ...
research
∙
04/23/2018