Randomization in automata on infinite trees A Carayol, A Haddad, O Serre ACM Transactions on Computational Logic (TOCL) 15 (3), 1-33, 2014 | 26 | 2014 |

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games T Brihaye, G Geeraerts, A Haddad, B Monmege Acta Informatica 54 (1), 85-125, 2017 | 20 | 2017 |

IO vs OI in higher-order recursion schemes A Haddad (FICS'12), Proceedings of the 8th Workshop on Fixed Points in Computer …, 2012 | 19 | 2012 |

To reach or not to reach? Efficient algorithms for total-payoff games T Brihaye, G Geeraerts, A Haddad, B Monmege arXiv preprint arXiv:1407.5030, 2014 | 18 | 2014 |

Model checking and functional program transformations A Haddad (FSTTCS'13) IARCS Annual Conference on Foundations of Software Technology …, 2013 | 16 | 2013 |

Simple priced timed games are not that simple T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege arXiv preprint arXiv:1507.03786, 2015 | 13 | 2015 |

Efficient Energy Distribution in a Smart Grid using Multi-Player Games T Brihaye, AK Dhar, G Geeraerts, A Haddad, B Monmege arXiv preprint arXiv:1608.00652, 2016 | 8 | 2016 |

Shape-Preserving Transformations of Higher-Order Recursion Schemes A Haddad Université Paris Diderot, 2013 | 8 | 2013 |

Quantitative games under failures T Brihaye, G Geeraerts, A Haddad, B Monmege, GA Pérez, G Renault arXiv preprint arXiv:1504.06744, 2015 | 6 | 2015 |

Qualitative tree languages A Carayol, A Haddad, O Serre (LICS'11) Logic in Computer Science, 2011 26th Annual IEEE Symposium on, 13-22, 2011 | 6 | 2011 |

Counting branches in trees using games A Carayol, O Serre Information and Computation 252, 221-242, 2017 | 5 | 2017 |

Why value iteration runs in pseudo-polynomial time for discounted-payoff games A Haddad, B Monmege Technical note, Université libre de Bruxelles, 2015 | 5 | 2015 |

One-Clock Priced Timed Games with Arbitrary Weights T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege Logical Methods in Computer Science 18 (3), 51, 2022 | 3 | 2022 |

Characterising Nash equilibria outcomes in fully informed concurrent games A Haddad | 2 | 2016 |

Simple strategies for Banach–Mazur games and sets of probability 1 T Brihaye, A Haddad, Q Menet Information and Computation 245, 17-35, 2015 | 2 | 2015 |

To reach or not to reach T Brihaye, G Geeraerts, A Haddad, B Monmege Efficient algorithms for total-payoff games. CoRR, abs/1407.5030, 2014 | 2 | 2014 |

One-Clock Priced Timed Games with Negative Weights T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege arXiv preprint arXiv:2009.03074, 2020 | 1 | 2020 |

Simple Priced Timed Games are not that simple L Engel, T Brihaye, A Haddad, B Monmege | 1 | 2016 |

Erratum for “Randomization in Automata on Infinite Trees” A Carayol, A Haddad, O Serre ACM Transactions on Computational Logic (TOCL) 16 (4), 1-2, 2015 | 1 | 2015 |

One-Clock Priced Timed Games with Negative Weights B Monmege, E Lefaucheux, A Haddad, G Geeraerts, T Brihaye Logical Methods in Computer Science 18, 2022 | | 2022 |