ANTS
2004
Springer
13 years 10 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...