What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-47, 1991. ,
DOI : 10.1145/103162.103163
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7712
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables, Journal of the ACM, vol.23, issue.1, pp.147-154, 1976. ,
DOI : 10.1145/321921.321936
An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ???2, Developments in Reliable Computing, pp.203-212, 1999. ,
DOI : 10.1007/978-94-017-1247-7_16
Moyens arithmétiques pour un calcul fiable, 2000. ,
Worst cases for correct rounding of the elementary functions in double precision, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.111-118, 2001. ,
DOI : 10.1109/ARITH.2001.930110
Toward correctly rounded transcendentals, IEEE Transactions on Computers, vol.47, issue.11, pp.1235-1243, 1998. ,
DOI : 10.1109/12.736435
Worst cases and lattice reduction, 16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings., pp.142-147, 2003. ,
DOI : 10.1109/ARITH.2003.1207672