{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T18:46:16Z","timestamp":1778006776721,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10208-011-9106-4","type":"journal-article","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T20:18:34Z","timestamp":1321042714000},"page":"435-469","source":"Crossref","is-referenced-by-count":20,"title":["Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra"],"prefix":"10.1007","volume":"12","author":[{"given":"V.","family":"Baldoni","sequence":"first","affiliation":[]},{"given":"N.","family":"Berline","sequence":"additional","affiliation":[]},{"given":"J. A.","family":"De Loera","sequence":"additional","affiliation":[]},{"given":"M.","family":"K\u00f6ppe","sequence":"additional","affiliation":[]},{"given":"M.","family":"Vergne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"9106_CR1","unstructured":"G.E. Andrews, P. Paule, MacMahon\u2019s dream, SFB-report 2006-26, RISC Linz SFB 013, September 2006."},{"key":"9106_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/conm\/452\/08769","volume":"452","author":"V. Baldoni","year":"2008","unstructured":"V. Baldoni, N. Berline, M. Vergne, Local Euler\u2013Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of rational polytopes, Contemp. Math. 452, 15\u201333 (2008).","journal-title":"Contemp. Math."},{"key":"9106_CR3","doi-asserted-by":"crossref","unstructured":"V. Baldoni, N. Berline, J.A. De Loera, M. K\u00f6ppe, M. Vergne, Maple programs accompanying the manuscript. Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra. http:\/\/www.math.ucdavis.edu\/~latte\/topweightedehrhart-maple\/ , 2010.","DOI":"10.1007\/s10208-011-9106-4"},{"key":"9106_CR4","unstructured":"V. Baldoni, N. Berline, M. K\u00f6ppe, M. Vergne, Intermediate sums on polyhedra: Computation and real Ehrhart theory, eprint arXiv:1011.6002 [math.CO], 2010."},{"key":"9106_CR5","unstructured":"V. Baldoni, N. Berline, M. K\u00f6ppe, M. Vergne, Computation of Barvinok valuations of polyhedra, Manuscript, unpublished, 2011."},{"issue":"273","key":"9106_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-2010-02378-6","volume":"80","author":"V. Baldoni","year":"2011","unstructured":"V. Baldoni, N. Berline, J.A. De Loera, M. K\u00f6ppe, M. Vergne, How to integrate a polynomial over a simplex, Math. Comput. 80(273), 297\u2013325 (2011).","journal-title":"Math. Comput."},{"key":"9106_CR7","doi-asserted-by":"crossref","unstructured":"A.I. Barvinok, Computation of exponential integrals. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) Teor. Slozhn. Vychisl. 5, 149\u2013162, 175\u2013176 (1991), translation in J. Math. Sci. 70(4), 1934\u20131943 (1994).","DOI":"10.1007\/BF02112432"},{"key":"9106_CR8","first-page":"3","volume":"4","author":"A.I. Barvinok","year":"1992","unstructured":"A.I. Barvinok, Partition functions in optimization and computational problems. Algebra Anal. 4, 3\u201353 (1992), translation in St. Petersburg Math. J. 4(1), 1\u201349 (1993)","journal-title":"Algebra Anal."},{"key":"9106_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02574364","volume":"12","author":"A.I. Barvinok","year":"1994","unstructured":"A.I. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Discrete Comput. Geom. 12, 35\u201348 (1994).","journal-title":"Discrete Comput. Geom."},{"key":"9106_CR10","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A.I. Barvinok","year":"1994","unstructured":"A.I. Barvinok, Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, Math. Oper. Res. 19, 769\u2013779 (1994).","journal-title":"Math. Oper. Res."},{"issue":"255","key":"9106_CR11","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1090\/S0025-5718-06-01836-9","volume":"75","author":"A.I. Barvinok","year":"2006","unstructured":"A.I. Barvinok, Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comput. 75(255), 1449\u20131466 (2006).","journal-title":"Math. Comput."},{"key":"9106_CR12","series-title":"Z\u00fcrich Lectures in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.4171\/052","volume-title":"Integer Points in Polyhedra","author":"A.I. Barvinok","year":"2008","unstructured":"A.I. Barvinok, Integer Points in Polyhedra, Z\u00fcrich Lectures in Advanced Mathematics (European Mathematical Society (EMS), Z\u00fcrich, 2008)."},{"key":"9106_CR13","series-title":"Math. Sci. Res. Inst. Publ.","first-page":"91","volume-title":"New Perspectives in Algebraic Combinatorics","author":"A.I. Barvinok","year":"1999","unstructured":"A.I. Barvinok, J.E. Pommersheim, An algorithmic theory of lattice points in polyhedra, in New Perspectives in Algebraic Combinatorics, ed. by L.J. Billera, A. Bj\u00f6rner, C. Greene, R.E. Simion, R.P. Stanley, Math. Sci. Res. Inst. Publ., vol. 38 (Cambridge Univ. Press, Cambridge, 1999), pp.\u00a091\u2013147."},{"key":"9106_CR14","series-title":"Undergraduate Texts in Mathematics","volume-title":"Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra","author":"M. Beck","year":"2007","unstructured":"M. Beck, S. Robins, Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra, Undergraduate Texts in Mathematics (Springer, Berlin, 2007)."},{"key":"9106_CR15","unstructured":"N. Berline, M. Brion, M. Vergne, A Poisson summation formula for piecewise polynomial functions, Manuscript, unpublished, 2010."},{"key":"9106_CR16","first-page":"170","volume-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing","author":"A. Bj\u00f6rner","year":"1992","unstructured":"A. Bj\u00f6rner, L. Lov\u00e1sz, A.C.C. Yao, Linear decision trees: volume estimates and topological bounds, in Proc. 24th Ann. ACM Symp. on Theory of Computing (1992), pp. 170\u2013177."},{"key":"9106_CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/PL00009389","volume":"20","author":"D. Bremner","year":"1998","unstructured":"D. Bremner, K. Fukuda, A. Marzetta, Primal\u2013dual methods for vertex and facet enumeration, Discrete Comput. Geom. 20, 333\u2013357 (1998). doi: 10.1007\/PL00009389 .","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9106_CR18","doi-asserted-by":"crossref","first-page":"653","DOI":"10.24033\/asens.1572","volume":"21","author":"M. Brion","year":"1988","unstructured":"M. Brion, Points entiers dans les poly\u00e8dres convexes, Ann. Sci. \u00c9cole Norm. Sup. 21(4), 653\u2013663 (1988).","journal-title":"Ann. Sci. \u00c9cole Norm. Sup."},{"issue":"2","key":"9106_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1090\/S0894-0347-97-00229-4","volume":"10","author":"M. Brion","year":"1997","unstructured":"M. Brion, M. Vergne, Lattice points in simple polytopes, J. Am. Math. Soc. 10(2), 371\u2013392 (1997).","journal-title":"J. Am. Math. Soc."},{"key":"9106_CR20","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1090\/S0894-0347-97-00242-7","volume":"10","author":"M. Brion","year":"1997","unstructured":"M. Brion, M. Vergne, Residue formulae, vector partition functions and lattice points in rational polytopes, J. Am. Math. Soc. 10, 797\u2013833 (1997).","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"9106_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00454-002-2759-7","volume":"28","author":"B. Chen","year":"2002","unstructured":"B. Chen, Lattice points, Dedekind sums, and Ehrhart polynomials of lattice polyhedra, Discrete Comput. Geom. 28(2), 175\u2013199 (2002). MR 1920138 (2003g:52019).","journal-title":"Discrete Comput. Geom."},{"key":"9106_CR22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1090\/conm\/374\/06899","volume":"374","author":"Y. Chen","year":"2005","unstructured":"Y. Chen, I. Dinwoodie, A. Dobra, M. Huber, Lattice points, contingency tables, and sampling, Contemp. Math. 374, 65\u201378 (2005).","journal-title":"Contemp. Math."},{"issue":"2","key":"9106_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00591-005-0094-9","volume":"52","author":"J.A. Loera De","year":"2005","unstructured":"J.A. De Loera, The many aspects of counting lattice points in polytopes, Math. Semesterber. 52(2), 175\u2013195 (2005). MR 2159956 (2006c:52015).","journal-title":"Math. Semesterber."},{"issue":"4","key":"9106_CR24","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J.A. Loera De","year":"2004","unstructured":"J.A. De Loera, R. Hemmecke, J. Tauzer, R. Yoshida, Effective lattice point counting in rational convex polytopes, J. Symb. Comput. 38(4), 1273\u20131302 (2004).","journal-title":"J. Symb. Comput."},{"issue":"1","key":"9106_CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/moor.1050.0169","volume":"31","author":"J.A. Loera De","year":"2006","unstructured":"J.A. De Loera, R. Hemmecke, M. K\u00f6ppe, R. Weismantel, Integer polynomial optimization in fixed dimension, Math. Oper. Res. 31(1), 147\u2013153 (2006).","journal-title":"Math. Oper. Res."},{"key":"9106_CR26","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations: Structures for Algorithms and Applications","author":"J.A. Loera De","year":"2010","unstructured":"J.A. De Loera, J. Rambau, F. Santos, Triangulations: Structures for Algorithms and Applications, 1st edn., Algorithms and Computation in Mathematics, vol.\u00a025 (Springer, Berlin, 2010).","edition":"1"},{"key":"9106_CR27","series-title":"IMA Series","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-1-4612-0801-3_3","volume-title":"Discrete Probability and Algorithms (Minneapolis 1993)","author":"P. Diaconis","year":"1995","unstructured":"P. Diaconis, A. Gangolli, Rectangular arrays with fixed margins, in Discrete Probability and Algorithms (Minneapolis 1993). IMA Series, vol. 72 (Springer, New York, 1995), pp. 15\u201341."},{"key":"9106_CR28","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/73393.73406","volume-title":"Proceedings of the Fourth Annual Symposium on Computational Geometry","author":"H. Edelsbrunner","year":"1988","unstructured":"H. Edelsbrunner, E.P. M\u00fccke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, in Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana, IL, 1988 (ACM, New York, 1988), pp. 118\u2013133. MR 1213465."},{"issue":"4","key":"9106_CR29","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"R. Kannan, A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8(4), 499\u2013507 (1979).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9106_CR30","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1137\/060664768","volume":"21","author":"M. K\u00f6ppe","year":"2007","unstructured":"M. K\u00f6ppe, A primal Barvinok algorithm based on irrational decompositions, SIAM J. Discrete Math. 21(1), 220\u2013236 (2007).","journal-title":"SIAM J. Discrete Math."},{"key":"9106_CR31","unstructured":"M. K\u00f6ppe, LattE macchiato, version 1.2-mk-0.9.3, an improved version of De Loera et al.\u2019s LattE program for counting integer points in polyhedra with variants of Barvinok\u2019s algorithm, Available from URL http:\/\/www.math.ucdavis.edu\/~mkoeppe\/latte\/ , 2008."},{"key":"9106_CR32","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems","author":"D. Micciancio","year":"2002","unstructured":"D. Micciancio, S. Goldwasser, Complexity of Lattice Problems, The Kluwer International Series in Engineering and Computer Science, vol. 671 (Kluwer Academic Publishers, Boston, 2002), A cryptographic perspective. MR 2042139 (2004m:94067)."},{"issue":"2","key":"9106_CR33","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/aima.1993.1033","volume":"100","author":"R. Morelli","year":"1993","unstructured":"R. Morelli, Pick\u2019s theorem and the Todd class of a toric variety, Adv. Math. 100(2), 183\u2013231 (1993). MR 1234309 (94j:14048).","journal-title":"Adv. Math."},{"issue":"2","key":"9106_CR34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.jsc.2007.07.007","volume":"43","author":"S. Verdoolaege","year":"2008","unstructured":"S. Verdoolaege, K.M. Woods, Counting with rational generating functions, J. Symb. Comput. 43(2), 75\u201391 (2008).","journal-title":"J. Symb. Comput."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-011-9106-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-011-9106-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-011-9106-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T12:22:16Z","timestamp":1560946936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-011-9106-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9106"],"URL":"https:\/\/doi.org\/10.1007\/s10208-011-9106-4","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,12]]}}}