Richard P. Brent

Q: What Schools Are Affiliated With Richard P. Brent

Richard P. Brent is affiliated with the following schools: University of Newcastle , University of Melbourne, Stanford University, Australian National University, Monash University

Richard P. Brent's AcademicInfluence.com Rankings

Richard P. Brent

Computer Science

#1431

World Rank

#1480

Historical Rank

Numerical Analysis

#11

World Rank

#12

Historical Rank

computer-science Degrees

Richard P. Brent

Mathematics

#2799

World Rank

#4244

Historical Rank

Linear Algebra

World Rank

Historical Rank

Measure Theory

#437

World Rank

#628

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Richard P. Brent's Degrees

Bachelors Mathematics University of Melbourne

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Richard P. Brent Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Peirce Brent is an Australian mathematician and computer scientist. He is an emeritus professor at the Australian National University. From March 2005 to March 2010 he was a Federation Fellow at the Australian National University. His research interests include number theory , random number generators, computer architecture, and analysis of algorithms.

(See a Problem?)

Richard P. Brent's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Regular Layout for Parallel Adders (1982) (1177)
The Parallel Evaluation of General Arithmetic Expressions (1974) (847)
Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) (1975) (610)
An Algorithm with Guaranteed Convergence for Finding a Zero of a Function (1971) (481)
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants (1980) (446)
Fast Multiple-Precision Evaluation of Elementary Functions (1976) (378)
The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays (1985) (347)
Fast Algorithms for Manipulating Formal Power Series (1978) (296)
A Fortran Multiple-Precision Arithmetic Package (1978) (246)
On the zeros of the Riemann zeta function in the critical strip (1979) (235)
Almost linear-time computation of the singular value decomposition using mesh-connected processors (1983) (218)
The Area-Time Complexity of Binary Multiplication (1981) (212)
An improved Monte Carlo factorization algorithm (1980) (210)
Fast training algorithms for multilayer neural nets (1991) (189)
Some Efficient Algorithms for Solving Systems of Nonlinear Equations (1973) (163)
Modern Computer Arithmetic (2010) (157)
Systolic VLSI Arrays for Polynomial GCD Computation (1984) (136)
The chip complexity of binary arithmetic (1980) (119)
Factorization of the eighth Fermat number (1981) (110)
A Note on Downdating the Cholesky Factorization (1987) (99)
Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors (1984) (98)
Algorithms for matrix multiplication (1970) (96)
Solving Triangular Systems on a Parallel Computer (1977) (93)
On the Area of Binary Tree Layouts (1980) (92)
Reducing the retrieval time of scatter storage techniques (1973) (91)
Multiple-precision zero-finding methods and the complexity of elementary function evaluation (1975) (89)
QR factorization of Toeplitz matrices (1986) (82)
The improved BiCGStab method for large and sparse unsymmetric linear systems on parallel distributed memory architectures (2002) (78)
Improved techniques for lower bounds for odd perfect numbers (1989) (74)
Algorithm 488: A Gaussian pseudo-random number generator (1974) (68)
On the stability of the Bareiss and related Toeplitz factorization algorithms (2010) (68)
Faster Multiplication in GF(2)[x] (2008) (67)
Irregularities in the distribution of primes and twin primes (1975) (64)
Uniform random number generators for supercomputers (1992) (62)
Recent Progress and Prospects for Integer Factorisation Algorithms (2000) (59)
The Parallel Evaluation of Arithmetic Expressions Without Division (1973) (52)
Analysis of the binary Euclidean algorithm (1976) (52)
On the Addition of Binary Numbers (1970) (52)
On the Precision Attainable with Various Floating-Point Number Systems (1972) (51)
Some New Algorithms for High-Precision Computation of Euler’s Constant (1980) (50)
Some New Algorithms for High-Precision Computation of Euler’s Constant (1980) (50)
Algorithms for finding zeros and extrema of functions without calculating derivatives (1971) (49)
Factorization of the tenth Fermat number (1999) (47)
Note on Marsaglia's Xorshift Random Number Generators (2004) (46)
Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1] (1978) (46)
A Systolic Array for the Linear-Time Solution of Toeplitz Systems of Equations (1982) (43)
Minimum-energy all-to-all multicasting in wireless ad hoc networks (2009) (43)
Efficient implementation of the first-fit strategy for dynamic storage allocation (1989) (42)
A Linear Algorithm for Data Compression (1987) (41)
Some integer factorization algorithms using elliptic curves (2010) (41)
The Complexity of computational problem solving (1976) (40)
Some Linear-Time Algorithms for Systolic Arrays (2010) (39)
Computation Of The Generalized Singular Value Decomposition Using Mesh-Connected Processors (1983) (38)
Random Krylov Spaces over Finite Fields (2003) (38)
Some long-period random number generators using shifts and xors (2007) (36)
Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity (1970) (36)
A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations (1997) (35)
Error bounds on complex floating-point multiplication (2007) (35)
Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials (2021) (35)
The complexity of multiple-precision arithmetic (2010) (35)
The First Occurrence of Large Gaps Between Successive Primes (1973) (34)
On the periods of generalized Fibonacci recurrences (1994) (34)
Algorithmic Fault Tolerance Using the Lanczos Method (1992) (34)
Some Parallel Algorithms for Integer Factorisation (1999) (34)
Determinants and ranks of random matrices over Zm (1987) (34)
Optimal iterative processes for root-finding (1972) (31)
O((n log n)3/2) ALGORITHMS FOR COMPOSITION AND REVERSION OF POWER SERIES (1976) (31)
The improved BiCG method for large and sparse linear systems on parallel distributed memory architectures (2002) (30)
AN IMPLEMENTATION OF A GENERAL-PURPOSE PARALLEL SORTING ALGORITHM (1993) (29)
The Distribution of Small Gaps Between Successive Primes (1974) (29)
A systolic algorithm for integer GCD computation (1985) (28)
Concerning $\int_0^1 \cdots \int_0^1 {(x_1^2 + \cdots + x_k^2 )} ^{{1 / 2}} dx_1 \cdots ,dx_k $ and a Taylor Series Method (1976) (26)
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (2003) (26)
Error analysis of a fast partial pivoting method for structured matrices (1995) (26)
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions (1995) (26)
Parallel Algorithms for Digital Signal Processing (1991) (26)
On the Davidenko-Branin method for solving simultaneous nonlinear equations (1972) (25)
Fast local convergence with single and multistep methods for nonlinear equations (1975) (25)
On the Complexity of Composition and Generalized Composition of Power Series (1980) (25)
On the Efficiency of Pollard's Rho Method for Discrete Logarithms (2008) (24)
A Systolic Architecture for Almost Linear-Time Solution of the Symmetric Eigenvalue Problem (1982) (23)
High-Performance Pseudo-Random Number Generation on Graphics Processing Units (2011) (23)
An O(M(n) logn) Algorithm for the Jacobi Symbol (2010) (23)
Unrestricted Algorithms for Elementary and Special Functions (2010) (22)
Factorization of the tenth and eleventh Fermat numbers (1996) (22)
Supplement to A New Lower Bound for Odd Perfect Numbers (1989) (22)
A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers (1996) (22)
On Quadratic Polynomials for the Number Field Sieve (1998) (20)
The first occurrence of certain large prime gaps (1980) (20)
Fast computation of Bernoulli, Tangent and Secant numbers (2011) (20)
Random Number Generators with Period Divisible by a Mersenne Prime (2003) (20)
Job Scheduling Strategies for Networks of Workstations (1998) (20)
Parallel Algorithms for Toeplitz Systems (1991) (19)
Computing the Cholesky Factorization Using a Systolic Architecture (1982) (19)
An AUGMENT Interface for Brent's Multiple Precision Arithmetic Package (1980) (19)
COMPUTATION OF THE REGULAR CONTINUED FRACTION FOR EULER'S CONSTANT (1977) (18)
Some Area-Time Tradeoffs for VLSI (1982) (18)
The great trinomial hunt (2010) (18)
Old And New Algorithms For Toeplitz Systems (1988) (18)
Job Re-pacing for Enhancing the Performance of Gang Scheduling (1999) (18)
MP users guide (2010) (17)
Proceedings of the 1998 ACM/IEEE conference on Supercomputing (1998) (17)
Algebraic independence of Mahler functions via radial asymptotics (2014) (16)
Effective scheduling in a mixed parallel and sequential computing environment (1998) (16)
Discrete analogues of Macdonald-Mehta integrals (2016) (16)
Fast and Reliable Random Number Generators for Scientific Computing (2004) (16)
Random Number Generation and Simulation on Vector and Parallel Computers (1998) (16)
THE PARALLEL EVALUATION OF ARITHMETIC EXPRESSIONS IN LOGARITHMIC TIME (2003) (15)
Ten new primitive binary trinomials (2008) (15)
Accurate estimation of sums over zeros of the Riemann zeta-function (2020) (15)
Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures (2003) (15)
A mobile TCP socket (1997) (14)
General Lower Bounds on Maximal Determinants of Binary Matrices (2012) (14)
On computing factors of cyclotomic polynomials (1993) (13)
Two new factors of Fermat numbers (1997) (13)
Resource Allocation Schemes for Gang Scheduling (2000) (13)
Root optimization of polynomials in the number field sieve (2012) (13)
Vector and Parallel Algorithms for Integer Factorisation (1990) (13)
Gang scheduling with a queue for large jobs (2001) (13)
Implementation of the BLAS level 3 and LINPACK Benchmark on the AP1000 (1992) (13)
A Multi-level Blocking Distinct Degree Factorization Algorithm (2007) (13)
Stability analysis of a general toeplitz systems solver (1995) (13)
A Systolic Architecture for the Singular Value Decomposition (1982) (13)
FACTORIZATIONS OF a n ± 1, 13 a < 100 (1992) (12)
Lower bounds on maximal determinants of ±1 matrices via the probabilistic method (2012) (12)
Parallel implementation of QRD algorithms on the Fujitsu AP1000 (1993) (12)
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations (1972) (12)
Fully Dynamic Maintenance of k-Connectivity in Parallel (2001) (11)
The LINPACK benchmark on the Fujitsu FAP 1000 (1992) (11)
Matching with mismatches and assorted applications (2006) (11)
Succinct proofs of primality for the factors of some Fermat numbers (1982) (11)
Some Comments on C. S. Wallace's Random Number Generators (2008) (11)
The mean square of the error term in the prime number theorem (2020) (11)
A CLASS OF OPTIMAL-ORDER ZERO-FINDING METHODS USING DERIVATIVE EVALUATIONS (1976) (10)
Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors (1985) (10)
Tables Concerning Irregularities in the Distribution of Primes and Twin Primes to $10^{11} (1976) (10)
Fast Algorithms for High-Precision Computation of Elementary Functions (2006) (10)
Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi (2017) (10)
Note on a double binomial sum relevant to the Hadamard maximal determinant problem (2013) (10)
A bound for the error term in the Brent-McMillan algorithm (2013) (10)
Choosing Small Weights For Multiple Error Detection (1989) (10)
Bounds on determinants of perturbed diagonal matrices (2014) (10)
Number Theory and Cryptography: Parallel algorithms for integer factorisation (1990) (9)
A General-Purpose Parallel Sorting Algorithm (1995) (9)
A novel quartet-based method for phylogenetic inference (2005) (9)
High Precision Coefficients Related to the Zeta Function. (1977) (9)
Factor: an integer factorization program for the IBM PC (1994) (9)
Efficient one-sided Jacobi algorithms for singular value decomposition and the symmetric eigenproblem (1995) (9)
A Theoretical Foundation For The Weighted Checksum Scheme (1988) (9)
Maximal determinants and saturated D-optimal designs of orders 19 and 37 (2011) (8)
Linearly Connected Arrays for Toeplitz Least-Squares Problems (1990) (8)
Extracting Significant Phrases from Text (2007) (8)
Three new factors of Fermat numbers (2000) (8)
Algorithms for optimal self-simulation of some restricted reconfigurable meshes (1997) (8)
Some Binomial Sums Involving Absolute Values (2014) (8)
The Solution Of Singular Value Problems Using Systolic Arrays (1984) (8)
Note on best possible bounds for determinants of matrices close to the identity matrix (2015) (8)
Parallel solution of certain Toeplitz least-squares problems (1986) (7)
Constructing the spanners of graphs in parallel (1996) (7)
Efficient Methods for Finding Zeros of Functions Whose Derivatives are Easy to Evaluate. (1974) (7)
A primitive trinomial of degree 6972593 (2004) (7)
Adaptive AT2 optimal algorithms on reconfigurable meshes (2000) (7)
Uniform Random Number Generators for Vector and Parallel Computers (1992) (7)
Lower bounds on maximal determinants of binary matrices via the probabilistic method (2014) (7)
A PARALLEL ALGORITHM FOR CONTEXT-FREE PARSING (2003) (7)
Constant time algorithms for computing the contour of maximal elements on the reconfigurable mesh (1997) (7)
THE LINPACK BENCHMARK ON THE AP1000 (2003) (7)
An efficient method for computing eigenvalues of a real normal matrix (2003) (7)
A weakly stable algorithm for general Toeplitz systems (2010) (7)
On minors of maximal determinant matrices (2012) (7)
An efficient resource allocation scheme for gang scheduling (1999) (7)
A One-Sided Jacobi Algorithm for the Symmetric Eigenvalue Problem (1994) (7)
Correction to: “Irregularities in the distribution of primes and twin primes” (Math. Comp. 29 (1975), 43–56) (1976) (6)
Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix using real arithmetic (1996) (6)
On determinants of random symmetric matrices over Z_m (2010) (6)
Efficient implementation of sorting algorithms on asynchronous distributed-memory machines (1994) (6)
Stability of fast algorithms for structured linear systems (1999) (6)
The improved conjugate gradient squared (ICGS) method on parallel distributed memory architectures (2001) (6)
A systolic algorithm for extended GCD computation (1987) (6)
RMSIM: a serial simulator for reconfigurable mesh parallel computers (1997) (6)
On a New Quartet-Based Phylogeny Reconstruction Algorithm (2006) (6)
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree (2006) (5)
The parallel improved Lanczos method for integer factorization over finite fields for public key cryptosystems (2001) (5)
ON THE ACCURACY OF ASYMPTOTIC APPROXIMATIONS TO THE LOG-GAMMA AND RIEMANN–SIEGEL THETA FUNCTIONS (2016) (5)
Finding D-optimal designs by randomised decomposition and switching (2011) (5)
Factorization of large integers on some vector and parallel computers (1995) (5)
"Recent progress and prospects for integer factorisation algorithms," Computing and Combinatorics : 6th Annual International Conference, COCOON 2000 (2000) (5)
A fast vectorised implementation of Wallace's normal random number generator (2010) (5)
A Stabilized Parallel Algorithm for Direct-Form Recursive Filters (1991) (5)
Computing Aurifeuillian Factors (1995) (5)
Modern Computer Arithmetic (version 0.5.1) (2010) (5)
The Implementation of BLAS level 3 on the AP1000: Preliminary Report (1991) (5)
Some high-order zero-finding methods using almost orthogonal polynomials (1975) (5)
A note on the real part of the Riemann zeta-function (2011) (5)
Fast normal random number generators on vector processors (2010) (5)
The Borwein Brothers, Pi and the AGM (2017) (5)
Implementation of a portable-IP system for mobile TCP/IP (1997) (5)
Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor (1980) (5)
Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers (2002) (5)
An efficient architecture for solving the recursive convolution equation with high throughput (1987) (4)
On the Development of an Efficient Coscheduling System (2001) (4)
An asymptotic expansion inspired by Ramanujan (2010) (4)
Area-time Tradeoffs for VLSI Circuits (1982) (4)
A HARMONIC SUM OVER NONTRIVIAL ZEROS OF THE RIEMANN ZETA-FUNCTION (2020) (4)
Parallel implementation of a quartet-based algorithm for phylogenetic analysis (2006) (4)
Stability analysis of fast Toeplitz linear system solvers (1991) (4)
Parallel algorithms in linear algebra (2010) (4)
A high throughput systolic implementation of the second order recursive filter (1988) (4)
A Fast Algorithm for Testing Irreducibility of Trinomials mod 2 (preliminary report) 1 (2000) (3)
A NOTE ON P OLYA'S OBSERVATION CONCERNING LIOUVILLE'S FUNCTION (2011) (3)
Parallel Computation of the Singular Value Decomposition on Tree Architectures (1993) (3)
The myth of equidistribution for high-dimensional simulation (2010) (3)
Serial Simulation of Reconngurable Mesh, an Image Understanding Architecture (2007) (3)
Remark on “Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]” (1979) (3)
IMPLEMENTATION OF THE BLAS LEVEL 3 ON THE AP 1000 : PRELIMINARY REPORT (1991) (3)
How promising is the k-constrained reconfigurable mesh? (2000) (3)
An Improved Monte Carlo Method for Factorization Algorithm (1980) (3)
A note on continuation methods for the solution of nonlinear equations (1977) (3)
A Global Maximum Likelihood Super-Quartet Phylogeny Method (2007) (3)
A novel parallel algorithm for enumerating combinations (1996) (3)
Further analysis of the binary Euclidean algorithm (2013) (3)
Implementing BLAS Level 3 on the CAP-II (1990) (3)
Factorizations In ) (2003) (3)
The improved Krylov subspace methods for large and sparse linear systems on bulk synchronous parallel architectures (2003) (3)
Probabilistic lower bounds on maximal determinants of binary matrices (2015) (3)
Primality testing and integer factorisation (1990) (3)
Development of a mathematical subroutine library for Fujitsu vector parallel processors (1998) (3)
THE FIRST 200,000,001 ZEROS OF RIEMANN'S ZETA FUNCTION (1982) (3)
Generalizing Tuenter's Binomial Sums (2014) (3)
A fast, storage-efficient parallel sorting algorithm (1993) (3)
Three Ways to Test Irreducibility (2008) (2)
Linear Algebra Research on the AP1000 (1993) (2)
Stability of Bareiss algorithm (1991) (2)
On the Sign of the Real Part of the Riemann Zeta Function (2012) (2)
Finding many D-optimal designs by randomised decomposition and switching (2011) (2)
EMPIRICAL EVIDENCE FOR A PROPOSED DISTRIBUTION OF SMALL PRIME GAPS (1969) (2)
Knuth's Constants to 1000 Decimal and 1100 Octal Places (1976) (2)
Update 1 to: factorizations of an±1, 13≤a<100 (1994) (2)
Uses of randomness in computation (2010) (2)
The solution of singular-value and eigenvalue problems on systolic arrays (1984) (2)
Old and new algorithms for pi (2013) (2)
Parallel QR Decomposition Of Toeplitz Matrices (1986) (2)
On some results of Agelas concerning the GRH and of Vassilev-Missana concerning the prime zeta function (2021) (2)
Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines (1993) (2)
CHECKSUM SCHEMES FOR FAULT TOLERANT SYSTOLIC COMPUTING (2003) (1)
Topics in computational complexity and the analysis of algorithms (1980) (1)
Proceedings of the 12th international conference on Supercomputing (1998) (1)
Concerning the Length of Time Slots for Efficient Gang Scheduling (2003) (1)
UNRESTRICTED ALGORITHMS FOR ELEMENTARY AND SPECIAL FUNCTIONS Invited Paper 1 (1980) (1)
Computer Arithmetic - A Programmer's Perspective (1999) (1)
Using Magma to find good xorshift random number generators (2006) (1)
On two theorems of Vassilev-Missana (2021) (1)
Error analysis of a partial pivoting method for structured matrices (2010) (1)
Adaptive AT 2 optimal algorithms on recon ® gurable meshes q (2000) (1)
The Distribution of Prime Gaps in Intervals up to 10 16 (1974) (1)
γ and e γ to 20700D and Their Regular Continued Fractions to 20000 Partial Quotients. (1978) (1)
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ (2006) (1)
Tables of the First 15,000 Zeros of the Riemann Zeta Function to 28 Significant Figures, and Related Quantities. (1980) (1)
Parallel integer sorting (1995) (1)
A Simple Approach to Error Reconciliation in Quantum Key Distribution (2010) (1)
BOUNDS ON MINORS OF BINARY MATRICES (2012) (1)
Computation of Maximal Determinants of Binary Circulant Matrices (2018) (1)
Phylogenetic Inference Using a Global Quartet Weight Matrix (2005) (1)
The Australian National University TR-CS-90-05 Vector and Parallel Algorithms for Integer Factorisation (1)
Maximal Contour Algorithms on Constrained Reconfigurable Meshes (1999) (1)
Factoring and Testing Irreducibility of Sparse Polynomials over Small Finite Fields (2009) (1)
Corrigendum: `` The Area-Time Complexity of Binary Multiplication'' (1982) (1)
The Complexity of Multiple-precision Arithmetic 1 (1976) (1)
FFT extension for algebraic-group factorization algorithms (2017) (1)
Numerical Stability of Some Fast Algorithms for Structured Matrices (1997) (1)
DYNAMIC STORAGE ALLOCATION ON A COMPUTER WITH VIRTUAL MEMORY (1985) (1)
A Fortran Multiple-Precision Arithmetic (1978) (1)
Fast multiple-precision evaluation of elementary functions (1976) (2016) (1)
Twelve new primitive binary trinomials (2016) (1)
Computation of the zeros of the Riemann zeta function in the critical strip (1978) (1)
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? (1993) (0)
Computing Bernoulli and Tangent Numbers (2011) (0)
Lower Bounds for the Hadamard Maximal Determinant Problem (2015) (0)
Number Theory Elementary Number Theory (2016) (0)
ANZ volume 19 issue 2 Cover and Front matter (1975) (0)
Progressive messages: tracking message progress through events (2011) (0)
A CLASS OF PARALLEL ITERATIVE MEDIAN-TYPE ALGORITHMSFOR EFFICIENT IMAGE (2007) (0)
George Forsythe's last paper (2010) (0)
Introduction to Integer Factorisation Algorithms (2010) (0)
Finding many solutions of the Hadamard maximal determinant problem given the maximal Gram matrices (2012) (0)
Implementation and Performance of Scalable Scientific Library Subroutines on Fujitsu's VPP500 (1994) (0)
Asymptotic approximation of central binomial coefficients with rigorous error bounds (2016) (0)
CSE 2009 Organizing and Program Committees (2009) (0)
A Block Jacobi-like Method for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic ∗ (2003) (0)
TR-CS-98-02 Adaptive AT 2 Optimal Algorithms on Reconfigurable Meshes (1998) (0)
Factorizations of Cunningham numbers with bases 13 to 99 (2010) (0)
Modern Computer Arithmetic: Elementary and special function evaluation (2010) (0)
From Mersenne Primes to Random Number Generators (2006) (0)
Note on Computing Ratings from Eigenvectors (2010) (0)
Reversible rotations , or how rho lost its tail ∗ (2006) (0)
ELEMENTARY AND SPECIAL FUNCTIONS Invited Paper 1 (1999) (0)
Modern Computer Arithmetic: Preface (2010) (0)
Jonathan Michael Borwein 1951 − 2016: Life and Legacy (2021) (0)
Modern Computer Arithmetic: Implementations and pointers (2010) (0)
The Australian National University TR-CS-95-01 Factorisation of Large Integers on some Vector and Parallel Computers (1995) (0)
TR-CS-97-11 Two New Factors of Fermat Numbers (1997) (0)
TR-CS-97-08 A Mobile TCP Socket (1997) (0)
Programming with transactions and chemical abstract machine (1996) (0)
Floating-point arithmetic (2010) (0)
Lower bounds on maximal determinants via the probabilistic method (2012) (0)
Parallel and Distributed Processing Research in Some Asian Countries (1994) (0)
Challenges in Solving Large Sparse Linear Systems over Finite Fields (2005) (0)
Ju l 2 01 2 On the sign of the real part of the Riemann zeta-function (2012) (0)
Algorithms for the Multiplication Table Problem (2019) (0)
Integer Factorisation on the AP1000 (1995) (0)
Modern Computer Arithmetic: References (2010) (0)
New Results - Polynomial Arithmetic (2003) (0)
Modern Computer Arithmetic: Integer arithmetic (2010) (0)
Fast and Reliable Random Number Generators for Scientific Computing ( extended abstract ) (2004) (0)
Factorizations of $ a^n pm 1,13 leq a < 100 $ (1992) (0)
A FAST ALGORITHM FOR TESTINGREDUCIBILITY OF TRINOMIALS MOD 2 AND SOME NEW PRIMITIVE TRINOMIALSOF DEGREE 3021377 (2003) (0)
Some Instructive Mathematical Errors (2021) (0)
Factorizations of $ a ^ n $ + 1, 13 < a < 100 : update 2 (1996) (0)
J ul 2 01 2 On the sign of the real part of the Riemann zeta-function (2012) (0)
Message from HPSEC Workshop Co-chairs (2006) (0)
Pitfalls in Computation: Random and not so Random Numbers ∗ (2006) (0)
N A ] 2 1 A pr 2 01 0 UNRESTRICTED ALGORITHMS FOR ELEMENTARY AND SPECIAL FUNCTIONS Invited Paper (2010) (0)
Modern Computer Arithmetic: Modular arithmetic and the FFT (2010) (0)
Factoring Integers - an Introduction (2010) (0)
A Conjectured Integer Sequence Arising From the Exponential Integral (2018) (0)
M ay 2 01 0 A Simple Approach to Error Reconciliation in Quantum Key Distribution ∗ (2018) (0)
FAST ALGORITHMS FOR COMPOSITION AND REVERSION OF FORMAL POWER SERIES (PRELIMINARY VERSION) (1993) (0)
Parallel Pseudo-Random Number Generation (2011) (0)
Computer Arithmetic – A Programmer ’ s Perspective ( invited talk ) (1999) (0)
Computing Continued Fractions of Algebraic Numbers (2005) (0)
N A ] 2 7 M ar 2 01 4 Bounds on determinants of perturbed diagonal matrices (2014) (0)
A Systolic Algorithm for Integer GCD Computation. Revision (1984) (0)
Parallel execution time analysis for least squares problems on distributed memory architectures (2001) (0)

This paper list is powered by the following services:

Other Resources About Richard P. Brent

What Schools Are Affiliated With Richard P. Brent?

Richard P. Brent is affiliated with the following schools:

Richard P. Brent's Academic­Influence.com Rankings

Richard P. Brent's Degrees

Similar Degrees You Can Earn

Why Is Richard P. Brent Influential?

Richard P. Brent's Published Works

Published Works

Other Resources About Richard P. Brent

What Schools Are Affiliated With Richard P. Brent?

Richard P. Brent's AcademicInfluence.com Rankings