Modern Computer Arithmetic

Modern Computer Arithmetic (2008)

Cached

Download Links

by Richard P. Brent , Paul Zimmermann

Citations:

BibTeX

@MISC{Brent08moderncomputer,
    author = {Richard P. Brent and Paul Zimmermann},
    title = {Modern Computer Arithmetic},
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
1366	Handbook of mathematical functions - Abramowitz, Stegun - 1968
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
549	R.: Online Computation and Competitive Analysis - Borodin, El-Yaniv - 1998
476	Concrete Mathematics - Graham, Knuth, et al. - 1989
403	Special Functions - Andrews, Askey, et al. - 1999
246	Algorithms for Minimizations without Derivatives - Brent - 1973
119	Prime Numbers - A Computational Perspective - Crandall, Pomerance - 2000
102	Rounding Errors in Algebraic Processes - Wilkinson - 1963
93	The computational complexity of algebraic and numeric problems - Borodin, Munro - 1975
89	Fast algorithms for manipulating formal power series - Brent, Kung - 1978
73	Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor - BARRETT - 1987
73	Fast multiple-precision evaluation of elementary functions,” Journal of the association for computing machinery - Brent - 1976
72	standard for binary floating-point arithmetic. Std - IEEE - 1985
67	zur Gathen and Jürgen Gerhard. Modern computer algebra - von - 2003
55	Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In: Analytic computational complexity - Brent - 1976
51	Analytic continuation of generalized functions with respect to a parameter, Funk - Bernstein - 1972
46	On the Minimum Computation Time of Functions - Cook - 1966
44	Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften, no. 315 - Bürgisser, Clausen, et al. - 1997
40	Detecting perfect powers in essentially linear time - Bernstein - 1998
38	Approximations and complex multiplication according to Ramanujan’, in: Ramanujan revisited (Urbana-Champaign - Chudnovsky, Chudnovsky - 1987
35	MPFR: A Multiple-Precision Binary Floating-Point - FOUSSE, HANROT, et al. - 2005
34	Computational strategies for the Riemann zeta function - Borwein, Bradley, et al.
34	A method for numerical integration on an automatic computer - Curtis - 1960
32	A linear filtering approach to the computation of the discrete Fourier transform - Bluestein - 1970
30	Algorithmic number theory, Volume 1: Efficient algorithms - Bach, Shallit - 1996
28	Double exponential formulas for numerical integration - Takahasi, Mori - 1974
27	Analysis of the binary Euclidean algorithm - Brent - 1976
26	Removing Redundancy in High-Precision Newton Iteration,” available from http://cr.yp.to/papers.html - Bernstein
26	Fast modular transforms - Borodin, Moenck - 1974
26	Faster integer multiplication - Fürer - 1997
25	Computer algebra in the service of mathematical physics and number theory - Chudnovsky, Chudnovsky - 1986
24	A proposed radix- and word-lengthindependent standard for floating-point arithmetic - Cody, Coonen, et al. - 1984
23	Multiplication by integer constants - Bernstein - 1986
21	Fast multiprecision evaluation of series of rational numbers - Haible, Papanikolaou - 1997
20	How to read floating point numbers accurately - Clinger - 1990
20	Correctly rounded binary-decimal and decimal-binary conversions. Numerical Analysis Manuscript 90-10 - Gay - 1990
19	An algorithm for modular exponentiation - Dimitrov, Jullien, et al. - 1998
18	Systolic VLSI arrays for linear-time GCD computation - Brent, Kung - 1983
17	and the AGM: A Study in Analytic Number Theory and Computational Complexity - Pi - 1987
17	Organization of computer systems - the fixed plus variable structure computer - Estrin - 1960
17	Fast multiplication and its applications - Bernstein - 2008
16	A comparison of three high-precision quadrature schemes - Bailey, Li, et al.
16	Some new algorithms for highprecision computation of Euler’s constant - Brent, McMillan - 1980
14	Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficients”, Funct - Bernstein - 1971
14	Massively parallel elliptic curve factoring - Dixon, Lenstra - 1993
13	An Efficient Algorithm for the Riemann Zeta Function - Borwein - 1995
13	Correctness proofs outline for Newton–Raphson-based floating-point divide and square root algorithms - Cornea, Golliver, et al. - 1999
13	Efficient Algorithms for Computing the Jacobi Symbol - EIKENBERRY, SORENSON - 1996
13	Pitfalls in computation, or why a math book isn’t enough - Forsythe - 1970