Journal of the ACM Bibliography
Richard P. Brent. Fast
multiple-precision evaluation of elementary functions. Journal of
the ACM, 23(2):242-251, April 1976.
[BibTeX entry]
Selected papers that cite this one
- Eric Bach. The
complexity of number-theoretic constants. Information
Processing Letters, 62(3):145-152, 14 May 1997.
- Joris van der Hoeven. Fast evaluation of
holonomic functions. Theoretical Computer Science,
210(1):199-215, 6 January 1999.
- Joris van der Hoeven. Fast evaluation of
holonomic functions. Theoretical Computer Science,
210(1):199-215, 6 January 1999.
- R. Seidel and C. R. Aragon. Randomized
search trees. Algorithmica, 16(4/5):464-497,
October/November 1996.
- Klaus Weihrauch. On the complexity
of online computations of real functions. Journal of
Complexity, 7(4):380-394, December 1991.
- Klaus Weihrauch. A refined model of
computation for continuous problems. Journal of
Complexity, 14(1):102-121, March 1998.
Shortcuts: