Journal of Combinatorial Theory Series A
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
Mathematics of Operations Research
Simple Explicit Formula for Counting Lattice Points of Polyhedra
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science
Hi-index | 0.01 |