Fraction interpolation walking a Farey tree

Authors:
Marc Mosko;J. J. Garcia-Luna-Aceves
Affiliations:
Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304, USA;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304, USA and Computer Engineering Department, University of California Santa Cruz, CA 95014, USA
Venue:
Information Processing Letters
Year:
2006

Citing 3
Cited 0

A walk along the branches of the extended Farey tree

IBM Journal of Research and Development
A p × p bit fraction model of binary floating point division and extremal rounding cases

Theoretical Computer Science - Real numbers and computers
Loop-Free Routing Using a Dense Label Set in Wireless Networks

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an algorithm to find a proper fraction in simplest reduced terms between two reduced proper fractions. A proper fraction is a rational number m/n with m1. A fraction m/n is simpler than p/q if m=