LattE (Lattice point Enumeration) is a computer software dedicated to the problems of counting lattice points and integration inside convex polytopes. LattE contains the first ever implementation of Barvinok’s algorithm. The LattE macchiato version (by M. Köppe) incorporated fundamental improvements and speed ups. Now the latest version, LattE integrale, has the ability to directly compute integrals of polynomial functions over polytopes and in particular to do volume computations.

This software is also referenced in ORMS.

References in zbMATH (referenced in 118 articles , 2 standard articles )

Showing results 1 to 20 of 118.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Kocuk, Burak: Rational polyhedral outer-approximations of the second-order cone (2021)
  2. Bertsimas, Dimitris; Sturt, Bradley: Computation of exact bootstrap confidence intervals: complexity and deterministic algorithms (2020)
  3. Chin, Eric B.; Sukumar, N.: An efficient method to integrate polynomials over polytopes and curved solids (2020)
  4. DeSalvo, Stephen; Zhao, James: Random sampling of contingency tables via probabilistic divide-and-conquer (2020)
  5. Downing, Mara; Molavi, Abtin; Bang, Lucas: Symbolic execution + model counting + entropy maximization = automatic search synthesis (2020)
  6. El Ouafdi, Abdelhalim; Lepelley, Dominique; Smaoui, Hatem: Probabilities of electoral outcomes: from three-candidate to four-candidate elections (2020)
  7. Hirai, Hiroshi; Oshiro, Ryunosuke; Tanaka, Ken’ichiro: Counting integral points in polytopes via numerical analysis of contour integration (2020)
  8. Lamei, Kamran; Yassemi, Siamak: Graded Betti numbers of good filtrations (2020)
  9. Bruns, Winfried; Ichim, Bogdan; Söger, Christof: Computations of volumes and Ehrhart series in four candidates elections (2019)
  10. Morettin, Paolo; Passerini, Andrea; Sebastiani, Roberto: Advanced SMT techniques for weighted model integration (2019)
  11. Ouadjaout, Abdelraouf; Miné, Antoine: Quantitative static analysis of communication protocols using abstract Markov chains (2019)
  12. Szlobodnyik, Gergely; Szederkényi, Gábor: Reachability analysis of low-order discrete state reaction networks obeying conservation laws (2019)
  13. Baldoni, V.; Vergne, M.; Walter, M.: Computation of dilated Kronecker coefficients (2018)
  14. Berg, Sören; Jochemko, Katharina; Silverstein, Laura: Ehrhart tensor polynomials (2018)
  15. Davis, Robert; Sagan, Bruce: Pattern-avoiding polytopes (2018)
  16. Gao, Wei; Lv, Hengyi; Zhang, Qiang; Cai, Dunbo: Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method (2018)
  17. García-García, J. I.; Marín-Aragón, D.; Vigneron-Tenorio, A.: An extension of Wilf’s conjecture to affine semigroups (2018)
  18. Ge, Cunjing; Ma, Feifei; Zhang, Peng; Zhang, Jian: Computing and estimating the volume of the solution space of SMT(LA) constraints (2018)
  19. Kahle, David; Yoshida, Ruriko; Garcia-Puente, Luis: Hybrid schemes for exact conditional inference in discrete exponential families (2018)
  20. Kaniovski, Serguei; Kurz, Sascha: Representation-compatible power indices (2018)

1 2 3 4 5 6 next