Order Statistics in the Farey Sequences in Sublinear Time

Abstract

The paper presents the first sublinear algorithm for computing order statistics in the Farey sequences. The algorithm runs in time O(n log n) and in space O( √ n ) for Farey sequence of order n. This is a significant improvement to the algorithm from [1] that runs in time O(n log n).

DOI: 10.1007/978-3-540-75520-3_21
View Slides

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Pawlewicz2007OrderSI, title={Order Statistics in the Farey Sequences in Sublinear Time}, author={Jakub Pawlewicz}, booktitle={ESA}, year={2007} }