4 citations · 8 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
Dynamic Complexity of Parity Games with Bounded Tree-Width
Patricia Bouyer, Vincent Jugé, Nicolas Markey
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of…
cs.CC2016
Dynamic Complexity of the Dyck Reachability
Patricia Bouyer, Vincent Jugé
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed…