| Randomization in automata on infinite trees A Carayol, A Haddad, O Serre ACM Transactions on Computational Logic (TOCL) 15 (3), 1-33, 2014 | 28 | 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, 85-125, 2017 | 25 | 2017 |
| 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 | 21 | 2014 |
| Model checking and functional program transformations A Haddad (FSTTCS'13) IARCS Annual Conference on Foundations of Software Technology …, 2013 | 17 | 2013 |
| IO vs OI in higher-order recursion schemes A Haddad (FICS'12), Proceedings of the 8th Workshop on Fixed Points in Computer …, 2012 | 17 | 2012 |
| Simple priced timed games are not that simple T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege arXiv preprint arXiv:1507.03786, 2015 | 14 | 2015 |
| Quantitative games under failures T Brihaye, G Geeraerts, A Haddad, B Monmege, GA Pérez, G Renault arXiv preprint arXiv:1504.06744, 2015 | 8 | 2015 |
| Shape-Preserving Transformations of Higher-Order Recursion Schemes A Haddad Université Paris Diderot, 2013 | 8 | 2013 |
| One-clock priced timed games with negative weights T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege Logical Methods in Computer Science 18, 2022 | 6 | 2022 |
| 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 | 6 | 2016 |
| 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 |
| 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 |
| 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 |
| Simple Priced Timed Games are not that simple B Monmege, T Brihaye, E Lefaucheux, A Haddad | | 2015 |
| Randomization in Automata on Infinite Trees (vol 15, pg 3, 2011) A Carayol, A Haddad, O Serre ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 16 (4), 2015 | | 2015 |
