Concepedia

Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons

Jakub Pawlewicz, Mihai Pǎtraşcu

Algorithmica · 2008 · 13 citations · 16 references

DOI

Concepts

References

16

A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed

Alexander Barvinok · Mathematics of Operations Research · 1994 · 406 citations

, , +11

Distribution of Lattice Points Visible from the Origin

Florin P. Boca, Alexandru Zaharescu, Cristian Cobeli · Communications in Mathematical Physics · 2000 · 104 citations

, , +5

Optimal search for rationals

Stephen Kwek, Kurt Mehlhorn · Information Processing Letters · 2003 · 41 citations

, , +6

Efficient search for rationals

Christos H. Papadimitriou · Information Processing Letters · 1979 · 40 citations

, , +7

Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind—Rademacher Sums

Beck, Robins · Discrete & Computational Geometry · 2002 · 32 citations · Full text

, , +10