The following pages link to Pierre Ohlmann (Q2051371):
Displaying 17 items.
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
- Controlling a random population (Q2200817) (← links)
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem (Q2321928) (← links)
- (Q4636627) (← links)
- (Q5028432) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5874295) (← links)
- On the Monniaux problem in abstract interpretation (Q6536286) (← links)
- Characterizing positionality in games of Infinite duration over infinite graphs (Q6566588) (← links)
- A technique to speed up symmetric attractor-based algorithms for parity games (Q6604661) (← links)
- Characterising memory in Infinite games (Q6638131) (← links)
- Flipper games for monadically stable graph classes (Q6638138) (← links)
- Canonical decompositions in monadically stable and bounded shrubdepth graph classes (Q6638145) (← links)
- Characterizing positionality in games of infinite duration over infinite graphs (Q6649452) (← links)
- New algorithms for combinations of objectives using separating automata (Q6649527) (← links)
