default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard P. Brent
Person information
- affiliation: Australian National University, Acton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j60]Richard P. Brent
:
Some Instructive Mathematical Errors. Maple Trans. 1(1) (2021)- [j59]Richard P. Brent, David J. Platt, Timothy S. Trudgian:
Accurate estimation of sums over zeros of the Riemann zeta-function. Math. Comput. 90(332): 2923-2935 (2021)
2010 – 2019
- 2019
- [j58]Richard P. Brent, M. L. Glasser, Anthony J. Guttmann:
A Conjectured Integer Sequence Arising From the Exponential Integral. J. Integer Seq. 22(4): 19.4.7 (2019) - 2018
- [j57]Richard P. Brent, Adam B. Yedidia:
Computation of Maximal Determinants of Binary Circulant Matrices. J. Integer Seq. 21(5): 18.5.6 (2018) - [i36]Richard P. Brent, Adam B. Yedidia:
Computation of Maximal Determinants of Binary Circulant Matrices. CoRR abs/1801.00399 (2018) - 2017
- [j56]David H. Bailey, Jonathan M. Borwein, Richard P. Brent, Mohsen Reisi:
Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi. Exp. Math. 26(3): 298-305 (2017) - 2016
- [j55]Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith:
Probabilistic lower bounds on maximal determinants of binary matrices. Australas. J Comb. 66: 350-364 (2016) - [j54]Richard P. Brent, Christian Krattenthaler, Ole Warnaar:
Discrete analogues of Macdonald-Mehta integrals. J. Comb. Theory A 144: 80-138 (2016) - [j53]Richard P. Brent, Hideyuki Ohtsuka, Judy-anne H. Osborn, Helmut Prodinger:
Some Binomial Sums Involving Absolute Values. J. Integer Seq. 19(3): 16.3.7 (2016) - 2015
- [j52]Richard P. Brent:
Generalizing Tuenter's Binomial Sums. J. Integer Seq. 18(3): 15.3.2 (2015) - [j51]Richard P. Brent, Fredrik Johansson:
A bound for the error term in the Brent-McMillan algorithm. Math. Comput. 84(295): 2351-2359 (2015) - [j50]Shi Bai, Richard P. Brent, Emmanuel Thomé:
Root optimization of polynomials in the number field sieve. Math. Comput. 84(295): 2447-2457 (2015) - 2013
- [j49]Richard P. Brent:
Finding D-optimal designs by randomised decomposition and switching. Australas. J Comb. 55: 15-30 (2013) - [j48]Richard P. Brent, Judy-anne H. Osborn:
General Lower Bounds on Maximal Determinants of Binary Matrices. Electron. J. Comb. 20(2): 15 (2013) - [p1]Juan Arias de Reyna, Richard P. Brent, Jan van de Lune:
On the Sign of the Real Part of the Riemann Zeta Function. Number Theory and Related Fields 2013: 75-97 - [i35]Richard P. Brent:
Further analysis of the binary Euclidean algorithm. CoRR abs/1303.2772 (2013) - 2012
- [i34]Juan Arias de Reyna, Richard P. Brent, Jan van de Lune:
On the sign of the real part of the Riemann zeta-function. CoRR abs/1205.4423 (2012) - [i33]Shi Bai, Richard P. Brent, Emmanuel Thomé:
Root optimization of polynomials in the number field sieve. CoRR abs/1212.1958 (2012) - [i32]Shi Bai, Richard P. Brent, Emmanuel Thomé:
Root Optimization of Polynomials in the Number Field Sieve. IACR Cryptol. ePrint Arch. 2012: 691 (2012) - 2011
- [c50]Nimalan Nandapalan, Richard P. Brent, Lawrence M. Murray, Alistair P. Rendell:
High-Performance Pseudo-Random Number Generation on Graphics Processing Units. PPAM (1) 2011: 609-618 - [i31]Richard P. Brent, David Harvey:
Fast computation of Bernoulli, Tangent and Secant numbers. CoRR abs/1108.0286 (2011) - [i30]Nimalan Nandapalan, Richard P. Brent, Lawrence M. Murray, Alistair P. Rendell:
High-Performance Pseudo-Random Number Generation on Graphics Processing Units. CoRR abs/1108.0486 (2011) - [i29]Richard P. Brent:
Finding many D-optimal designs by randomised decomposition and switching. CoRR abs/1112.4671 (2011) - 2010
- [c49]Richard P. Brent, Paul Zimmermann:
An O(M(n) logn) Algorithm for the Jacobi Symbol. ANTS 2010: 83-95 - [i28]Richard P. Brent, Paul Zimmermann:
An O(M(n) log n) algorithm for the Jacobi symbol. CoRR abs/1004.2091 (2010) - [i27]Richard P. Brent:
Fast normal random number generators on vector processors. CoRR abs/1004.3105 (2010) - [i26]Richard P. Brent:
Uses of randomness in computation. CoRR abs/1004.3108 (2010) - [i25]Richard P. Brent:
A fast vectorised implementation of Wallace's normal random number generator. CoRR abs/1004.3114 (2010) - [i24]Richard P. Brent:
Some long-period random number generators using shifts and xors. CoRR abs/1004.3115 (2010) - [i23]Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele:
Factorizations of Cunningham numbers with bases 13 to 99. CoRR abs/1004.3169 (2010) - [i22]Richard P. Brent:
MP users guide. CoRR abs/1004.3173 (2010) - [i21]Richard P. Brent:
Some integer factorization algorithms using elliptic curves. CoRR abs/1004.3366 (2010) - [i20]Richard P. Brent:
On the precision attainable with various floating-point number systems. CoRR abs/1004.3374 (2010) - [i19]Richard P. Brent:
Multiple-precision zero-finding methods and the complexity of elementary function evaluation. CoRR abs/1004.3412 (2010) - [i18]Richard P. Brent:
The complexity of multiple-precision arithmetic. CoRR abs/1004.3608 (2010) - [i17]Richard P. Brent:
Unrestricted algorithms for elementary and special functions. CoRR abs/1004.3621 (2010) - [i16]Richard P. Brent, Franklin T. Luk, H. T. Kung:
Some linear-time algorithms for systolic arrays. CoRR abs/1004.3716 (2010) - [i15]Richard P. Brent, Paul Zimmermann:
Modern Computer Arithmetic (version 0.5.1). CoRR abs/1004.4710 (2010) - [i14]Richard P. Brent:
Parallel algorithms in linear algebra. CoRR abs/1004.5437 (2010) - [i13]Richard P. Brent:
On the periods of generalized Fibonacci recurrences. CoRR abs/1004.5439 (2010) - [i12]Richard P. Brent:
On computing factors of cyclotomic polynomials. CoRR abs/1004.5466 (2010) - [i11]Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog, Douglas R. Sweet:
On the stability of the Bareiss and related Toeplitz factorization algorithms. CoRR abs/1004.5510 (2010) - [i10]Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog:
A weakly stable algorithm for general Toeplitz systems. CoRR abs/1005.0503 (2010) - [i9]Douglas R. Sweet, Richard P. Brent:
Error analysis of a partial pivoting method for structured matrices. CoRR abs/1005.0667 (2010) - [i8]Richard P. Brent:
Stability of fast algorithms for structured linear systems. CoRR abs/1005.0671 (2010) - [i7]Richard P. Brent:
Note on Computing Ratings from Eigenvectors. CoRR abs/1005.0762 (2010) - [i6]Richard P. Brent:
George Forsythe's last paper. CoRR abs/1005.0909 (2010) - [i5]Richard P. Brent:
A Simple Approach to Error Reconciliation in Quantum Key Distribution. CoRR abs/1005.1206 (2010) - [i4]Richard P. Brent:
The myth of equidistribution for high-dimensional simulation. CoRR abs/1005.1320 (2010) - [i3]Richard P. Brent, Paul Zimmermann:
The great trinomial hunt. CoRR abs/1005.1967 (2010) - [i2]Richard P. Brent:
Some comments on C. S. Wallace's random number generators. CoRR abs/1005.2314 (2010)
2000 – 2009
- 2009
- [j47]Richard P. Brent, Paul Zimmermann:
Ten new primitive binary trinomials. Math. Comput. 78(266): 1197-1199 (2009) - [j46]Weifa Liang, Richard P. Brent, Yinlong Xu, Qingshan Wang:
Minimum-energy all-to-all multicasting in wireless ad hoc networks. IEEE Trans. Wirel. Commun. 8(11): 5490-5499 (2009) - 2008
- [j45]Richard P. Brent:
Some Comments on C. S. Wallace's Random Number Generators. Comput. J. 51(5): 579-584 (2008) - [c48]Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann:
Faster Multiplication in GF(2)[x]. ANTS 2008: 153-166 - [c47]Shi Bai, Richard P. Brent:
On the Efficiency of Pollard's Rho Method for Discrete Logarithms. CATS 2008: 125-131 - 2007
- [j44]Richard P. Brent, Colin Percival, Paul Zimmermann:
Error bounds on complex floating-point multiplication. Math. Comput. 76(259): 1469-1481 (2007) - [c46]Yuan Jenq Lui, Richard P. Brent, Ani Calinescu:
Extracting Significant Phrases from Text. AINA Workshops (1) 2007: 361-366 - [c45]Pinghao Wang, Bing Bing Zhou, Monther Tarawneh, Daniel Chu, Chen Wang, Albert Y. Zomaya, Richard P. Brent:
A Global Maximum Likelihood Super-Quartet Phylogeny Method. APBC 2007: 111-120 - [i1]Richard P. Brent, Paul Zimmermann:
A Multi-level Blocking Distinct Degree Factorization Algorithm. CoRR abs/0710.4410 (2007) - 2006
- [c44]Bing Bing Zhou, Monther Tarawneh, Penghao Wang, Daniel Chu, Chen Wang, Albert Y. Zomaya, Richard P. Brent:
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree. BIBE 2006: 193-200 - [c43]Bing Bing Zhou, Monther Tarawneh, Daniel Chu, Francis Wang, Chen Wang, Albert Y. Zomaya, Richard P. Brent:
On a New Quartet-Based Phylogeny Reconstruction Algorithm. BIOCOMP 2006: 87-93 - [c42]Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Penghao Wang, Chen Wang, Albert Y. Zomaya, Richard P. Brent:
Parallel implementation of a quartet-based algorithm for phylogenetic analysis. IPDPS 2006 - 2005
- [j43]Richard P. Brent, Samuli Larvala, Paul Zimmermann:
A primitive trinomial of degree 6972593. Math. Comput. 74(250): 1001-1002 (2005) - [c41]Bing Bing Zhou, Monther Tarawneh, Chen Wang, Albert Y. Zomaya, Richard P. Brent:
A Novel Quartet-Based Method for Phylogenetic Inference. BIBE 2005: 32-39 - 2004
- [j42]Laurence Tianruo Yang, Richard P. Brent:
Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures. J. Supercomput. 29(2): 145-156 (2004) - [c40]Richard P. Brent:
Fast and Reliable Random Number Generators for Scientific Computing. PARA 2004: 1-10 - 2003
- [j41]Bing Bing Zhou, Richard P. Brent:
An efficient method for computing eigenvalues of a real normal matrix. J. Parallel Distributed Comput. 63(6): 638-648 (2003) - [j40]Richard P. Brent, Samuli Larvala, Paul Zimmermann:
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377. Math. Comput. 72(243): 1443-1452 (2003) - [j39]Richard P. Brent, Shuhong Gao, Alan G. B. Lauder:
Random Krylov Spaces over Finite Fields. SIAM J. Discret. Math. 16(2): 276-287 (2003) - [c39]Richard P. Brent, Paul Zimmermann:
Random Number Generators with Period Divisible by a Mersenne Prime. ICCSA (1) 2003: 1-10 - [c38]Laurence Tianruo Yang, Richard P. Brent:
The Improved Krylov Subspace Methods for Large and Sparse Linear Systems on Bulk Synchronous Parallel Architecture. IPDPS 2003: 260 - [c37]Laurence Tianruo Yang, Richard P. Brent:
Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures. ISPA 2003: 197-208 - 2002
- [c36]Laurence Tianruo Yang, Richard P. Brent:
The Improved BiCG Method for Large and Sparse Linear Systems on Parallel Distributed Memory Architectures. IPDPS 2002 - 2001
- [j38]Weifa Liang, Richard P. Brent, Hong Shen:
Fully Dynamic Maintenance of k-Connectivity in Parallel. IEEE Trans. Parallel Distributed Syst. 12(8): 846-864 (2001) - [c35]Laurence Tianruo Yang, Richard P. Brent:
The Parallel Improved Lanczos Method for Integer Factorization over Finite Fields for Public Key Cryptosystems. ICPP Workshops 2001: 106-114 - [c34]Laurence Tianruo Yang, Richard P. Brent:
The Improved Conjugate Gradient Squared (ICGS) Method on Parallel Distributed Memory Architectures. ICPP Workshops 2001: 161-168 - [c33]Bing Bing Zhou, Richard P. Brent:
Gang Scheduling with a Queue for Large Jobs. IPDPS 2001: 58 - [c32]Bing Bing Zhou, Richard P. Brent:
On the Development of an Efficient Coscheduling System. JSSPP 2001: 103-115 - 2000
- [j37]Richard P. Brent, Richard E. Crandall, Karl Dilcher, C. Van Halewyn:
Three new factors of Fermat numbers. Math. Comput. 69(231): 1297-1304 (2000) - [j36]M. Manzur Murshed, Richard P. Brent:
Adaptive AT2 optimal algorithms on reconfigurable meshes. Parallel Comput. 26(11): 1447-1458 (2000) - [c31]M. Manzur Murshed, Richard P. Brent:
How promising is the k-constrained reconfigurable mesh? CATA 2000: 288-291 - [c30]Richard P. Brent:
Recent Progress and Prospects for Integer Factorisation Algorithms. COCOON 2000: 3-22 - [c29]Bing Bing Zhou, David Walsh, Richard P. Brent:
Resource Allocation Schemes for Gang Scheduling. JSSPP 2000: 74-86
1990 – 1999
- 1999
- [j35]Richard P. Brent:
Factorization of the tenth Fermat number. Math. Comput. 68(225): 429-451 (1999) - [c28]Richard P. Brent:
Computer Arithmetic - A Programmer's Perspective. IEEE Symposium on Computer Arithmetic 1999: 2- - [c27]Richard P. Brent:
Some Parallel Algorithms for Integer Factorisation. Euro-Par 1999: 1-22 - [c26]Bing Bing Zhou, Richard P. Brent, Chris W. Johnson, David Walsh:
Job Re-pacing for Enhancing the Performance of Gang Scheduling. JSSPP 1999: 129-143 - [c25]Bing Bing Zhou, Paul Mackerras, Chris W. Johnson, David Walsh, Richard P. Brent:
An Efficient Resource Allocation Scheme for Gang Scheduling. IWCC 1999: 187-194 - [c24]M. Manzur Murshed, Richard P. Brent:
Maximal Contour Algorithms on Constrained Reconfigurable Meshes. PDPTA 1999: 2238-2244 - 1998
- [j34]M. Manzur Murshed, Richard P. Brent:
Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh. Parallel Process. Lett. 8(3): 351-361 (1998) - [c23]Brian Murphy, Richard P. Brent:
On Quadratic Polynomials for the Number Field Sieve. CATS 1998: 199-214 - [c22]Richard P. Brent:
Random Number Generation and Simulation on Vector and Parallel Computers. Euro-Par 1998: 1-20 - [c21]Richard P. Brent, L. Grosz, David L. Harrar II, Markus Hegland, Margaret Kahn, G. Keating, G. Mercer, Ole Møller Nielsen, Michael R. Osborne, Bing Bing Zhou, M. Nakanishi:
Development of a Mathematical Subroutine Library for Fujitsu Vector Parallel Processors. International Conference on Supercomputing 1998: 13-20 - [c20]Bing Bing Zhou, Richard P. Brent, David Walsh, Kuniyasu Suzaki:
Job Scheduling Strategies for Networks of Workstations. JSSPP 1998: 143-157 - [c19]Bing Bing Zhou, X. Qu, Richard P. Brent:
Effective scheduling in a mixed parallel and sequential computing environment. PDP 1998: 32-37 - [e1]Greg K. Egan, Richard P. Brent, Dennis Gannon:
Proceedings of the 12th international conference on Supercomputing, ICS 1998, Melbourne, Australia, July 13-17, 1998. ACM 1998, ISBN 0-89791-998-X [contents] - 1997
- [j33]Bing Bing Zhou, Richard P. Brent:
A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations. J. Parallel Distributed Comput. 42(1): 1-10 (1997) - [c18]M. Manzur Murshed, Richard P. Brent:
Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh. ICPADS 1997: 172-177 - 1996
- [c17]Richard P. Brent, Alfred J. van der Poorten, Herman J. J. te Riele:
A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers. ANTS 1996: 35-47 - [c16]Bing Bing Zhou, Richard P. Brent, X. Qu, W. F. Liang:
A Novel Parallel Algorithm for Enumerating Combinations. ICPP, Vol. 2 1996: 70-73 - [c15]Weifa Liang, Richard P. Brent:
Constructing the Spanners of Graphs in Parallel. IPPS 1996: 206-210 - [c14]Bing Bing Zhou, Richard P. Brent:
Jacobi-like Algorithms for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic. IPPS 1996: 593-600 - [c13]Wanli Ma, C. W. Johnson, Richard P. Brent:
Programming with transactions and chemical abstract machine. ISPAN 1996: 562-564 - 1995
- [j32]Andrew Tridgell, Richard P. Brent:
A General-Purpose Parallel Sorting Algorithm. Int. J. High Speed Comput. 7(2): 285-301 (1995) - [j31]Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog:
Stability analysis of a general toeplitz systems solver. Numer. Algorithms 10(2): 225-244 (1995) - [j30]Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog, Douglas R. Sweet:
On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms. SIAM J. Matrix Anal. Appl. 16(1): 40-57 (1995) - [c12]Bing Bing Zhou, Richard P. Brent:
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions. PDP 1995: 401-408 - 1994
- [c11]Richard P. Brent, Yong-Kim Chong, Guo-Jie Li, Paul B. S. Lin, Rabi N. Mahapatra, Myong-Soon, Makoto Takizawa:
Parallel and Distributed Processing Research in Some Asian Countries. ICPADS 1994: 26-27 - [c10]Bing Bing Zhou, Richard P. Brent, Andrew Tridgell:
Efficient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines. ICPADS 1994: 102-106 - 1993
- [c9]Richard P. Brent, Andrew Tridgell:
A fast, storage-efficient parallel sorting algorithm. ASAP 1993: 369-379 - [c8]Bing Bing Zhou, Richard P. Brent:
Parallel Computation of the Singular Value Decomposition on Tree Architectures. ICPP (3) 1993: 128-131 - 1992
- [j29]Daniel Boley, Richard P. Brent, Gene H. Golub, Franklin T. Luk:
Algorithmic Fault Tolerance Using the Lanczos Method. SIAM J. Matrix Anal. Appl. 13(1): 312-332 (1992) - 1991
- [j28]Richard P. Brent, Bing Bing Zhou:
A Stabilized Parallel Algorithm for Direct-Form Recursive Filters. IEEE Trans. Computers 40(3): 333-336 (1991) - [j27]Richard P. Brent:
Fast training algorithms for multilayer neural nets. IEEE Trans. Neural Networks 2(3): 346-354 (1991) - 1990
- [j26]Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog:
Linearly Connected Arrays for Toeplitz Least-Squares Problems. J. Parallel Distributed Comput. 9(3): 261-270 (1990)
1980 – 1989
- 1989
- [j25]Richard P. Brent:
Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation. ACM Trans. Program. Lang. Syst. 11(3): 388-403 (1989) - 1988
- [c7]Bing Bing Zhou, Richard P. Brent:
A high throughput systolic implementation of the second order recursive filter. ICASSP 1988: 2053-2056 - 1987
- [j24]Richard P. Brent:
A Linear Algorithm for Data Compression. Aust. Comput. J. 19(2): 64-68 (1987) - [j23]Richard P. Brent, Brendan D. McKay:
Determinants and ranks of random matrices over Zm. Discret. Math. 66(1-2): 35-49 (1987) - 1985
- [j22]Adam W. Bojanczyk, Richard P. Brent:
Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors. J. Parallel Distributed Comput. 2(3): 261-276 (1985) - [c6]Richard P. Brent, H. T. Rung:
A systolic algorithm for integer GCD computation. IEEE Symposium on Computer Arithmetic 1985: 118-125 - 1984
- [j21]Richard P. Brent, H. T. Kung:
Systolic VLSI Arrays for Polynomial GCD Computation. IEEE Trans. Computers 33(8): 731-736 (1984) - 1983
- [c5]Richard P. Brent, H. T. Kung, Franklin T. Luk:
Some Linear-Time Algorithms for Systolic Arrays. IFIP Congress 1983: 865-876 - 1982
- [j20]Richard P. Brent, H. T. Kung:
Corrigendum: "The Area-Time Complexity of Binary Multiplication". J. ACM 29(3): 904 (1982) - [j19]Richard P. Brent, Leslie M. Goldschlager:
Some Area-Time Tradeoffs for VLSI. SIAM J. Comput. 11(4): 737-747 (1982) - [j18]Richard P. Brent, H. T. Kung:
A Regular Layout for Parallel Adders. IEEE Trans. Computers 31(3): 260-264 (1982) - 1981
- [j17]Richard P. Brent, H. T. Kung:
The Area-Time Complexity of Binary Multiplication. J. ACM 28(3): 521-534 (1981) - 1980
- [j16]Gérard M. Baudet, Richard P. Brent, H. T. Kung:
Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor. Aust. Comput. J. 12(3): 105-112 (1980) - [j15]Richard P. Brent, H. T. Kung:
On the Area of Binary Tree Layouts. Inf. Process. Lett. 11(1): 46-48 (1980) - [j14]Richard P. Brent, Fred G. Gustavson, David Y. Y. Yun:
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants. J. Algorithms 1(3): 259-295 (1980) - [j13]Richard P. Brent, Joseph F. Traub:
On the Complexity of Composition and Generalized Composition of Power Series. SIAM J. Comput. 9(1): 54-66 (1980) - [j12]Richard P. Brent, Judith A. Hooper, J. Michael Yohe:
An AUGMENT Interface for Brent's Multiple Precision Arithmetic Package. ACM Trans. Math. Softw. 6(2): 146-149 (1980) - [c4]Richard P. Brent:
Unrestricted Algorithms for Elementary and Special Functions. IFIP Congress 1980: 613-619 - [c3]Richard P. Brent, H. T. Kung:
The Chip Complexity of Binary Arithmetic. STOC 1980: 190-200
1970 – 1979
- 1979
- [j11]Richard P. Brent:
Remark on "Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]". ACM Trans. Math. Softw. 5(4): 518-519 (1979) - 1978
- [j10]Richard P. Brent, H. T. Kung:
Fast Algorithms for Manipulating Formal Power Series. J. ACM 25(4): 581-595 (1978) - [j9]Richard P. Brent:
A Fortran Multiple-Precision Arithmetic Package. ACM Trans. Math. Softw. 4(1): 57-70 (1978) - [j8]Richard P. Brent:
Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]. ACM Trans. Math. Softw. 4(1): 71-81 (1978) - 1976
- [j7]Richard P. Brent:
Analysis of the binary Euclidean algorithm. SIGSAM Bull. 10(2): 6-7 (1976) - [j6]Richard P. Brent:
Fast Multiple-Precision Evaluation of Elementary Functions. J. ACM 23(2): 242-251 (1976) - 1974
- [j5]Richard P. Brent:
A Gaussian Pseudo-Random Number Generator (Algorithm 488). Commun. ACM 17(12): 704-706 (1974) - [j4]Richard P. Brent:
The Parallel Evaluation of General Arithmetic Expressions. J. ACM 21(2): 201-206 (1974) - 1973
- [j3]Richard P. Brent:
Reducing the Retrieval Time of Scatter Storage Techniques. Commun. ACM 16(2): 105-109 (1973) - [j2]Richard P. Brent:
On the Precision Attainable with Various Floating-Point Number Systems. IEEE Trans. Computers 22(6): 601-607 (1973) - 1972
- [c2]Richard P. Brent:
On the precision attainable with various floating-point number systems. IEEE Symposium on Computer Arithmetic 1972: 1-29 - [c1]Richard P. Brent:
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations. Complexity of Computer Computations 1972: 61-71 - 1971
- [b1]Richard P. Brent:
Algorithms for finding zeros and extrema of functions without calculating derivatives. Stanford University, USA, 1971 - [j1]Richard P. Brent:
An Algorithm with Guaranteed Convergence for Finding a Zero of a Function. Comput. J. 14(4): 422-425 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
