1 Hit in 6.1 sec

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

Jakub Pawlewicz, Mihai Pătraşcu
2008 Algorithmica  
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking.  ...  We also initiate the study of a more general problem: counting primitive lattice points inside planar shapes.  ...  Order Statistics. Using the reduction in [20] , a sublinear-time algorithm for Rank does not imply a sublinear algorithm for Stat, due to the additive O(n) term.  ... 
doi:10.1007/s00453-008-9221-z fatcat:mo5zvoaugbbg5bkg2vmfnndshi