1. Barvinok, A.I.: Computing the Ehrhart polynomial of a convex lattice polytope. Discrete Comput. Geom. 12, 35–48 (1994)
2. Barvinok, A.I., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. In: New Perspectives in Algebraic Combinatorics. Math. Sci. Res. Inst. Publ., vol. 38, pp. 91–147. Cambridge Univ. Press (1999)
3. Barvinok, A.I.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comp. 75(255), 1449–1466 (2006)
4. Dönch, C.: Standard bases in finitely generated difference-skew-differential modules and their application to dimension polynomials. Ph.D. thesis. Johannes Kepler University Linz, Research Institute for Symbolic Computation (RISC) (2012)
5. Ehrhart, E.: Sur les polyèdres rationnels homothétiques à
$$n$$
n
dimensions. C. R. Acad. Sci. Paris 254, 616–618 (1962)