Sciweavers

ANTS   2004 International Algorithmic Number Theory Symposium
Wall of Fame | Most Viewed ANTS-2004 Paper
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
13 years 10 months ago
Computing Order Statistics in the Farey Sequence
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...
Corina E. Patrascu, Mihai Patrascu
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source233
2Download preprint from source149
3Download preprint from source139
4Download preprint from source121
5Download preprint from source114
6Download preprint from source112
7Download preprint from source111
8Download preprint from source109
9Download preprint from source106
10Download preprint from source105
11Download preprint from source103
12Download preprint from source97
13Download preprint from source95
14Download preprint from source93
15Download preprint from source91
16Download preprint from source90
17Download preprint from source76
18Download preprint from source74