References

1. T. Brázdil, P. Jancar & A. Kucera (2010): Reachability Games on Extended Vector Addition Systems with States. In: ICALP (2), pp. 478–489, doi:10.1007/978-3-642-14162-1_40.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest & C. Stein (2009): Introduction to Algorithms (3. ed.). MIT Press.
3. L. Doyen & A. Rabinovich (2013): Robot games. Research Report LSV-13-02. Laboratoire Spécification et Vérification, ENS Cachan, France. Available at http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2013-02.pdf. 2 pages.
4. D. Gale & F. M. Stewart (1953): Infinite games with perfect information. In: Contributions to the theory of games, vol. 2, Annals of Mathematics Studies, no. 28. Princeton University Press, Princeton, N. J., pp. 245–266.
5. M. Jurdzinski, F. Laroussinie & J. Sproston (2007): Model Checking Probabilistic Timed Automata with One or Two Clocks. In: TACAS, pp. 170–184, doi:10.1007/978-3-540-71209-1_15.
6. P. A. B. Pleasants, H. Ray & J. Simpson (2005): The Frobenius problem on lattices. Australasian Journal of Combinatorics.
7. C. H. Papadimitriou & K. Steiglitz (1982): Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall.
8. J. J. Sylvester (1882): On Subvariants, i.e. Semi-Invariants to Binary Quantics of an Unlimited Order. American Journal of Mathematics 5(1), pp. pp. 79–136.
9. W. Thomas (1995): On the Synthesis of Strategies in Infinite Games. In: STACS, pp. 1–13, doi:10.1007/3-540-59042-0_57.
10. H. S. Wilf (1978): A Circle-Of-Lights Algorithm for the "Money-Changing Problem". The American Mathematical Monthly 85(7), pp. pp. 562–565, doi:10.2307/2320864.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org