A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed, Mathematics of Operations Research, vol.19, issue.4, pp.769-779, 1994. ,
DOI : 10.1287/moor.19.4.769
An algorithmic theory of lattice points in polyhedra In: New Perspectives in Algebraic Combinatorics, Math. Sci. Res. Inst. Publ., CUP, pp.91-147, 1996. ,
Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind???Rademacher Sums, Discrete & Computational Geometry, vol.27, issue.4, pp.443-459, 2002. ,
DOI : 10.1007/s00454-001-0082-3
Autour du système de numération dóstrowski, Bull. Belg. Math. Soc, vol.8, pp.209-238, 2001. ,
Multidimensional euclidean algorithms, numeration and substitutions, A2 Integers, vol.11, 2011. ,
Points entiers dans les poly??dres convexes, Annales scientifiques de l'??cole normale sup??rieure, vol.21, issue.4, pp.653-663, 1988. ,
DOI : 10.24033/asens.1572
Effective lattice point counting in rational convex polytopes, Journal of Symbolic Computation, vol.38, issue.4, pp.1273-1302, 2004. ,
DOI : 10.1016/j.jsc.2003.04.003
Systems of numeration, Amer. Math. Monthly, vol.92, pp.321-331, 1985. ,
Sur une représentation géométrique du développement en fraction continue ordinaire The many aspects of counting lattice points in polytopes, Nouv. Ann. Math. Mathematische Semesterberichte manuscript, vol.3, issue.11, pp.327-331, 1896. ,
Geometrisches zur zahlentheorie, Naturwissenschaft Zeitschrift Lotos, 1899. ,
Géométrie discrète, calcul en nombres entiers et algorithmique, Thèse d'Etat, 1991. ,
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, Algorithmica, vol.48, issue.1, pp.37-66, 2007. ,
DOI : 10.1007/s00453-006-1231-0