The following pages link to Christoph Haase (Q782554):
Displaying 22 items.
- Approaching arithmetic theories with finite-state automata (Q782555) (← links)
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Approaching the coverability problem continuously (Q2272922) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Reachability in Register Machines with Polynomial Updates (Q2849929) (← links)
- Branching-Time Model Checking of Parametric One-Counter Automata (Q2892786) (← links)
- Relating Reachability Problems in Timed and Counter Automata (Q2968526) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- On Process-Algebraic Extensions of Metric Temporal Logic (Q3163409) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Integer Vector Addition Systems with States (Q3447699) (← links)
- The Odds of Staying on Budget (Q3449479) (← links)
- A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246) (← links)
- The taming of the semi-linear set (Q4598270) (← links)
- (Q4601893) (← links)
- (Q5009428) (← links)
- Counting problems for parikh images (Q5111226) (← links)
- On the Complexity of Quantified Integer Programming (Q5111426) (← links)
- On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes (Q6168472) (← links)
- On the Size of Finite Rational Matrix Semigroups (Q6325050) (← links)
