3 citations · 8 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Dynamic Complexity Meets Parameterised Algorithms
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier +2
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formula…
cs.LO2019★ 3 cited
Dynamic Complexity of Parity Exists Queries
Nils Vortmeier, Thomas Zeume
Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynF…