The following pages link to Sven Schewe (Q259050):
Displaying 50 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Solving parity games in big steps (Q340584) (← links)
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- Controlling loosely cooperating processes (Q896910) (← links)
- Buying optimal payoffs in bi-matrix games (Q1630445) (← links)
- Model-checking iterated games (Q1674862) (← links)
- Optimal control for multi-mode systems with discrete costs (Q1683440) (← links)
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games (Q1935779) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant (Q2233841) (← links)
- Editorial: Special issue on synthesis (Q2249656) (← links)
- Complementing semi-deterministic Büchi automata (Q2272937) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Synthesis of succinct systems (Q2353397) (← links)
- Distributed synthesis is simply undecidable (Q2445907) (← links)
- Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge (Q2849954) (← links)
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete (Q2908870) (← links)
- Efficient Approximation of Optimal Control for Markov Games (Q2911641) (← links)
- Determinising Parity Automata (Q2922042) (← links)
- Tight Bounds for Complementing Parity Automata (Q2922043) (← links)
- Knowledge = Observation + Memory + Computation (Q2949441) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Bounded-rate multi-mode systems based motion planning (Q2988914) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Treewidth (Q3167011) (← links)
- The Buck Stops Here: Order, Chance, and Coordination in Distributed Control (Q3172930) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Learning to Complement Büchi Automata (Q3296336) (← links)
- SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS (Q3426790) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Multiplayer Cost Games with Simple Nash Equilibria (Q3455836) (← links)
- Distributed Synthesis for Alternating-Time Logics (Q3510801) (← links)
- Bounded Synthesis (Q3510817) (← links)
- ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← links)
- Selective Approaches for Solving Weak Games (Q3522910) (← links)
- Synthesis for Probabilistic Environments (Q3522913) (← links)
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (Q3540191) (← links)
- Coordination Logic (Q3586048) (← links)
- Synthesis of Asynchronous Systems (Q3591079) (← links)
- Automatic Synthesis of Assumptions for Compositional Model Checking (Q3613064) (← links)
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (Q3613365) (← links)
- Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- A Simple Algorithm for Solving Qualitative Probabilistic Parity Games (Q4633558) (← links)
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata (Q4649286) (← links)
- Synthesis of Succinct Systems (Q4649297) (← links)
- Playing Optimally on Timed Automata with Random Delays (Q4649385) (← links)
