The numbering corresponds to a complete list of publications. To use the hyperlinks, please access the version at http://www.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pubs20.html.

For the papers on this list, contributions from all authors were approximately equal and hence the authors' names are given in alphabetical order.

11. R. P. Brent, Algorithms for minimization without derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973, 195 pp. Reprinted by Dover Publications, New York, 2002.

17. R. P. Brent, On the precision attainable with various floating-point number systems, IEEE Transactions on Computers C-22 (1973), 601-607.

22. R. P. Brent, The parallel evaluation of general arithmetic expressions, Journal of the ACM 21 (1974), 201-206.

34. R. P. Brent, Fast multiple-precision evaluation of elementary functions, Journal of the ACM 23 (1976), 242-251.

45. R. P. Brent and H. T. Kung, Fast algorithms for manipulating formal power series, Journal of the ACM 25 (1978), 581-595.

47. R. P. Brent, On the zeros of the Riemann zeta function in the critical strip, Mathematics of Computation 33 (1979), 1361-1372.

49. R. P. Brent and E. M. McMillan, Some new algorithms for high-precision computation of Euler's constant, Mathematics of Computation 34 (1980), 305-312.

52. R. P. Brent, Unrestricted algorithms for elementary and special functions (invited paper at the IFIP 8th World Computer Congress, Tokyo and Melbourne), Information Processing 80 , North-Holland, Amsterdam, 1980, 613-619.

55. R. P. Brent and H. T. Kung, The area-time complexity of binary multiplication, Journal of the ACM 28 (1981), 521-534. Corrigendum: ibid 29 (1982), 904.

59. R. P. Brent, F. G. Gustavson and D. Y. Y. Yun, Fast solution of Toeplitz systems of equations and computation of Padé approximants, Journal of Algorithms 1 (1980), 259-295.

60. R. P. Brent and H. T. Kung, A regular layout for parallel adders, IEEE Transactions on Computers C-31 (1982), 260-264.

79. R. P. Brent, H. T. Kung and F. T. Luk, Some linear-time algorithms for systolic arrays (invited paper at the IFIP 9th World Computer Congress, Paris), Information Processing 83, North-Holland, Amsterdam, 1983, 865-876.

116. R. P. Brent, G. L. Cohen and H. J. J. te Riele, Improved techniques for lower bounds for odd perfect numbers, Mathematics of Computation 57 (1991), 857-868.

133. R. P. Brent, On the periods of generalized Fibonacci recurrences, Mathematics of Computation 63 (1994), 389-401.

135. R. P. Brent, On computing factors of cyclotomic polynomials, Mathematics of Computation 61 (1993), 131-149 (D. H. Lehmer memorial issue).

144. A. W. Bojanczyk, R. P. Brent, F. R. de Hoog and D. R. Sweet, On the stability of the Bareiss and related Toeplitz factorization algorithms, SIAM J. Matrix Analysis and Applications 16 (1995), 40-57.

161. R. P. Brent, Factorization of the tenth Fermat number, Mathematics of Computation 68 (1999), 429-451.

183. R. P. Brent, Twenty years' analysis of the binary Euclidean algorithm, Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford-Microsoft Symposium in honour of C. A. R. Hoare, Palgrave, 2000, 41-53.

185. R. P. Brent, Random number generation and simulation on vector and parallel computers (invited paper at fourth Euro-Par Conference, Southampton), Lecture Notes in Computer Science, Vol. 1470, Springer-Verlag, Berlin, 1998, 1-20.

199. R. P. Brent, S. Larvala and P. Zimmermann, A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377, Mathematics of Computation, 72 (2003), 1443-1452.