Skip to main content
SpringerLink
Log in

Order Statistics in the Farey Sequences in Sublinear Time

  • Conference paper
Algorithms – ESA 2007 (ESA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4698))

Included in the following conference series:

Abstract

The paper presents the first sublinear algorithm for computing order statistics in the Farey sequences. The algorithm runs in time O(n 3/4logn) and in space \(O(\sqrt n\,)\) for Farey sequence of order n. This is a significant improvement to the algorithm from [1] that runs in time O(nlogn).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pǎtrascu, C.E, Pǎtrascu, M.: Computing order statistics in the Farey sequence. In: Buell, D.A. (ed.) Algorithmic Number Theory. LNCS, vol. 3076, pp. 358–366. Springer, Heidelberg (2004)

    Google Scholar 

  2. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, London, UK (1994)

    MATH  Google Scholar 

  3. Yanagisawa, H.: A simple algorithm for lattice point counting in rational polygons. Research report, IBM Research, Tokyo Research Laboratory (August 2005)

    Google Scholar 

  4. Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research 19(4), 769–779 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Beck, M., Robins, S.: Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind–Rademacher sums. Discrete and Computational Geometry 27(4), 443–459 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Brent, R.P., van der Poorten, A.J., te Riele, H.: A comparative study of algorithms for computing continued fractions of algebraic numbers. In: Cohen, H. (ed.) Algorithmic Number Theory. LNCS, vol. 1122, pp. 35–47. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland

    Jakub Pawlewicz

Authors
  1. Jakub Pawlewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lars Arge Michael Hoffmann Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pawlewicz, J. (2007). Order Statistics in the Farey Sequences in Sublinear Time. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75520-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75519-7

  • Online ISBN: 978-3-540-75520-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation