| Adaptive strategies for rLTL games | 0 | 0.34 | 2021 |
| The Keys to Decidable HyperLTL Satisfiability - Small Models or Very Simple Formulas. | 0 | 0.34 | 2020 |
| From LTL to rLTL monitoring: improved monitorability through robust semantics | 0 | 0.34 | 2020 |
| Finite-state Strategies in Delay Games | 1 | 0.40 | 2020 |
| Team Semantics for the Specification and Verification of Hyperproperties. | 2 | 0.37 | 2018 |
| Robust Monitoring of Linear Temporal Properties. | 0 | 0.34 | 2018 |
| Distributed Synthesis for Parameterized Temporal Logics. | 0 | 0.34 | 2018 |
| Robust, Expressive, and Quantitative Linear Temporal Logics. | 0 | 0.34 | 2018 |
| Parity Games with Weights. | 2 | 0.39 | 2018 |
| Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. | 0 | 0.34 | 2018 |
| The First-Order Logic of Hyperproperties. | 1 | 0.36 | 2017 |
| Games with costs and delays | 1 | 0.40 | 2017 |
| Bounding Average-energy Games. | 0 | 0.34 | 2017 |
| Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. | 2 | 0.39 | 2016 |
| How Much Lookahead is Needed to Win Infinite Games | 0 | 0.34 | 2016 |
| Prompt Delay. | 0 | 0.34 | 2016 |
| Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version) | 0 | 0.34 | 2015 |
| Limit Your Consumption! Finding Bounds In Average-Energy Games | 2 | 0.38 | 2015 |
| What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead | 5 | 0.49 | 2015 |
| DELAY GAMES WITH WMSO plus U WINNING CONDITIONS | 4 | 0.49 | 2015 |
| Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL | 0 | 0.34 | 2015 |
| How Much Lookahead is Needed to Win Infinite Games? | 3 | 0.42 | 2015 |
| Distributed and Parametric Synthesis. | 0 | 0.34 | 2015 |
| Unbounded Lookahead in WMSO+U Games. | 1 | 0.37 | 2015 |
| Parametric Linear Dynamic Logic (full version). | 1 | 0.36 | 2015 |
| Approximating Optimal Bounds In Prompt-Ltl Realizability In Doubly-Exponential Time | 3 | 0.43 | 2015 |
| Visibly Linear Dynamic Logic | 2 | 0.38 | 2015 |
| Optimal strategy synthesis for request-response games. | 3 | 0.48 | 2014 |
| The Complexity of Counting Models of Linear-time Temporal Logic. | 2 | 0.38 | 2014 |
