Axel Haddad

According to our database1, Axel Haddad
  • authored at least 15 papers between 2011 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Acta Inf., 2017

2016
Efficient Energy Distribution in a Smart Grid using Multi-Player Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

2015
Erratum for "Randomization in Automata on Infinite Trees".
ACM Trans. Comput. Log., 2015

Simple strategies for Banach-Mazur games and sets of probability 1.
Inf. Comput., 2015

Counting Branches in Trees Using Games.
CoRR, 2015

Quantitative Games under Failures.
CoRR, 2015

Simple Priced Timed Games Are Not That Simple.
CoRR, 2015

Quantitative Games under Failures.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Randomization in Automata on Infinite Trees.
ACM Trans. Comput. Log., 2014

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
CoRR, 2014

2013
Model Checking and Functional Program Transformations.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
IO vs OI in Higher-Order Recursion Schemes
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

2011
Qualitative Tree Languages.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011


  Loading...