The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Effective lattice point counting in rational convex polytopes
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Stanley, R. P., & Rota, G.-C. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511805967 · Cited by 6,025
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Applied and Computational Complex Analysis
Thacher, H. C., & Henrici, P. (1977) · Mathematics of Computation · doi:10.2307/2005805 · Cited by 2,022
Handbook of discrete and computational geometry
(1998) · Choice Reviews Online · doi:10.5860/choice.35-5707b · Cited by 1,456
Integer Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
Handbook of Discrete and Computational Geometry, Second Edition
(2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315 · Cited by 1,208
Handbook of Computational Geometry
(2000) · Elsevier eBooks · doi:10.1016/b978-0-444-82537-7.x5000-1 · Cited by 1,062
Lang, S. (1991) · Encyclopaedia of mathematical sciences · doi:10.1007/978-3-642-58227-1 · Cited by 513
An Algorithmic Theory of Lattice Points in Polyhedra
Barvinok, A. I., & Pommersheim, J. (1999) · Cambridge University Press eBooks · doi:10.1017/9781009701587.004 · Cited by 224
Rectangular Arrays with Fixed Margins
Diaconis, P., & Gangolli, A. (1995) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4612-0801-3_3 · Cited by 160
Discrete and Computational Geometry
Akiyama, J., Tan, X., & Kanō, M. (2005) · Lecture notes in computer science · doi:10.1007/11589440 · Cited by 104
Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety
Pemantle, R., & Wilson, M. C. (2004) · Combinatorics Probability Computing · doi:10.1017/s0963548304006248 · Cited by 95
Asymptotics of Multivariate Sequences
Pemantle, R., & Wilson, M. C. (2002) · Journal of Combinatorial Theory Series A · doi:10.1006/jcta.2001.3201 · Cited by 76
Non-standard approaches to integer programming
Aardal, K., Weismantel, R., & Wolsey, L. A. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00337-7 · Cited by 64
Cited by
A survey of symbolic execution techniques
Baldoni, R., Coppa, E., D’elia, D. C., Demetrescu, C., & Finocchi, I. (2019) · ACM Computing Surveys · doi:10.1145/3182657 · Cited by 708
Metadata
- Authors
- De Loera, J. A., Hemmecke, R., Tauzer, J., & Yoshida, R.
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 2004-10
- Volume
- 38
- Issue
- 4
- Pages
- 1273-1302
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W2033084216
- Cited by
- 261
- References
- 16
- FWCI
- 36.51
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.