Richard P. Brent

Richard P. Brent: Further analysis of the binary Euclidean algorithm. CoRR abs/1303.2772 (2013)

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)

Shi Bai, Richard P. Brent, Emmanuel Thomé: Root optimization of polynomials in the number field sieve. CoRR abs/1212.1958 (2012)

Shi Bai, Richard P. Brent, Emmanuel Thomé: Root Optimization of Polynomials in the Number Field Sieve. IACR Cryptology ePrint Archive 2012: 691 (2012)

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

Richard P. Brent, David Harvey: Fast computation of Bernoulli, Tangent and Secant numbers. CoRR abs/1108.0286 (2011)

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)

Richard P. Brent: Finding many D-optimal designs by randomised decomposition and switching. CoRR abs/1112.4671 (2011)

Richard P. Brent, Paul Zimmermann: An O(M(n) logn) Algorithm for the Jacobi Symbol. ANTS 2010: 83-95

Richard P. Brent, Paul Zimmermann: An O(M(n) log n) algorithm for the Jacobi symbol. CoRR abs/1004.2091 (2010)

Richard P. Brent: Fast normal random number generators on vector processors. CoRR abs/1004.3105 (2010)

Richard P. Brent: Uses of randomness in computation. CoRR abs/1004.3108 (2010)

Richard P. Brent: A fast vectorised implementation of Wallace's normal random number generator. CoRR abs/1004.3114 (2010)

Richard P. Brent: Some long-period random number generators using shifts and xors. CoRR abs/1004.3115 (2010)

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)

Richard P. Brent: MP users guide. CoRR abs/1004.3173 (2010)

Richard P. Brent: Some integer factorization algorithms using elliptic curves. CoRR abs/1004.3366 (2010)

Richard P. Brent: On the precision attainable with various floating-point number systems. CoRR abs/1004.3374 (2010)

Richard P. Brent: Multiple-precision zero-finding methods and the complexity of elementary function evaluation. CoRR abs/1004.3412 (2010)

Richard P. Brent: The complexity of multiple-precision arithmetic. CoRR abs/1004.3608 (2010)

Richard P. Brent: Unrestricted algorithms for elementary and special functions. CoRR abs/1004.3621 (2010)

Richard P. Brent, Franklin T. Luk, H. T. Kung: Some linear-time algorithms for systolic arrays. CoRR abs/1004.3716 (2010)

Richard P. Brent, Paul Zimmermann: Modern Computer Arithmetic (version 0.5.1). CoRR abs/1004.4710 (2010)

Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog: A weakly stable algorithm for general Toeplitz systems. CoRR abs/1005.0503 (2010)

Douglas R. Sweet, Richard P. Brent: Error analysis of a partial pivoting method for structured matrices. CoRR abs/1005.0667 (2010)

Richard P. Brent: Stability of fast algorithms for structured linear systems. CoRR abs/1005.0671 (2010)

Richard P. Brent: Note on Computing Ratings from Eigenvectors. CoRR abs/1005.0762 (2010)

Richard P. Brent: George Forsythe's last paper. CoRR abs/1005.0909 (2010)

Richard P. Brent: A Simple Approach to Error Reconciliation in Quantum Key Distribution. CoRR abs/1005.1206 (2010)

Richard P. Brent: The myth of equidistribution for high-dimensional simulation. CoRR abs/1005.1320 (2010)

Richard P. Brent, Paul Zimmermann: The great trinomial hunt. CoRR abs/1005.1967 (2010)

Richard P. Brent: Some comments on C. S. Wallace's random number generators. CoRR abs/1005.2314 (2010)

Richard P. Brent, Paul Zimmermann: Ten new primitive binary trinomials. Math. Comput. 78(266): 1197-1199 (2009)

Weifa Liang, Richard P. Brent, Yinlong Xu, Qingshan Wang: Minimum-energy all-to-all multicasting in wireless ad hoc networks. IEEE Transactions on Wireless Communications 8(11): 5490-5499 (2009)

Richard P. Brent: Some Comments on C. S. Wallace's Random Number Generators. Comput. J. 51(5): 579-584 (2008)

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann: Faster Multiplication in GF(2)[x]. ANTS 2008: 153-166

Shi Bai, Richard P. Brent: On the Efficiency of Pollard's Rho Method for Discrete Logarithms. CATS 2008: 125-131

Richard P. Brent, Colin Percival, Paul Zimmermann: Error bounds on complex floating-point multiplication. Math. Comput. 76(259): 1469-1481 (2007)

Yuan J. Lui, Richard P. Brent, Ani Calinescu: Extracting Significant Phrases from Text. AINA Workshops (1) 2007: 361-366

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

Richard P. Brent, Paul Zimmermann: A Multi-level Blocking Distinct Degree Factorization Algorithm. CoRR abs/0710.4410 (2007)

Bing Bing Zhou, Monther Tarawneh, Pinghao 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

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

Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Pinghao Wang, Chen Wang, Albert Y. Zomaya, Richard P. Brent: Parallel implementation of a quartet-based algorithm for phylogenetic analysis. IPDPS 2006

Richard P. Brent, Samuli Larvala, Paul Zimmermann: A primitive trinomial of degree 6972593. Math. Comput. 74(250): 1001-1002 (2005)

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

Laurence Tianruo Yang, Richard P. Brent: Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures. The Journal of Supercomputing 29(2): 145-156 (2004)

Richard P. Brent: Fast and Reliable Random Number Generators for Scientific Computing. PARA 2004: 1-10

Bing Bing Zhou, Richard P. Brent: An efficient method for computing eigenvalues of a real normal matrix. J. Parallel Distrib. Comput. 63(6): 638-648 (2003)

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)

Richard P. Brent, Shuhong Gao, Alan G. B. Lauder: Random Krylov Spaces over Finite Fields. SIAM J. Discrete Math. 16(2): 276-287 (2003)

Richard P. Brent, Paul Zimmermann: Random Number Generators with Period Divisible by a Mersenne Prime. ICCSA (1) 2003: 1-10

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

Laurence Tianruo Yang, Richard P. Brent: Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures. ISPA 2003: 197-208

Laurence Tianruo Yang, Richard P. Brent: The Improved BiCG Method for Large and Sparse Linear Systems on Parallel Distributed Memory Architectures. IPDPS 2002

Weifa Liang, Richard P. Brent, Hong Shen: Fully Dynamic Maintenance of k-Connectivity in Parallel. IEEE Trans. Parallel Distrib. Syst. 12(8): 846-864 (2001)

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

Laurence Tianruo Yang, Richard P. Brent: The Improved Conjugate Gradient Squared (ICGS) Method on Parallel Distributed Memory Architectures. ICPP Workshops 2001: 161-168

Bing Bing Zhou, Richard P. Brent: Gang Scheduling with a Queue for Large Jobs. IPDPS 2001: 58

Bing Bing Zhou, Richard P. Brent: On the Development of an Efficient Coscheduling System. JSSPP 2001: 103-115

Richard P. Brent, Richard E. Crandall, Karl Dilcher, C. Van Halewyn: Three new factors of Fermat numbers. Math. Comput. 69(231): 1297-1304 (2000)

Manzur M. Murshed, Richard P. Brent: Adaptive AT2 optimal algorithms on reconfigurable meshes. Parallel Computing 26(11): 1447-1458 (2000)

Manzur M. Murshed, Richard P. Brent: How promising is the k-constrained reconfigurable mesh? Computers and Their Applications 2000: 288-291

Richard P. Brent: Recent Progress and Prospects for Integer Factorisation Algorithms. COCOON 2000: 3-22

Bing Bing Zhou, David Walsh, Richard P. Brent: Resource Allocation Schemes for Gang Scheduling. JSSPP 2000: 74-86

Richard P. Brent: Factorization of the tenth Fermat number. Math. Comput. 68(225): 429-451 (1999)

Richard P. Brent: Computer Arithmetic - A Programmer's Perspective. IEEE Symposium on Computer Arithmetic 1999: 2-

Richard P. Brent: Some Parallel Algorithms for Integer Factorisation. Euro-Par 1999: 1-22

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

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

Manzur M. Murshed, Richard P. Brent: Maximal Contour Algorithms on Constrained Reconfigurable Meshes. PDPTA 1999: 2238-2244

Manzur M. Murshed, Richard P. Brent: Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh. Parallel Processing Letters 8(3): 351-361 (1998)

Brian Murphy, Richard P. Brent: On Quadratic Polynomials for the Number Field Sieve. CATS 1998: 199-214

Richard P. Brent: Random Number Generation and Simulation on Vector and Parallel Computers. Euro-Par 1998: 1-20

Richard P. Brent, L. Grosz, David L. Harrar II, Markus Hegland, M. 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

Bing Bing Zhou, Richard P. Brent, David Walsh, Kuniyasu Suzaki: Job Scheduling Strategies for Networks of Workstations. JSSPP 1998: 143-157

Bing Bing Zhou, X. Qu, Richard P. Brent: Effective scheduling in a mixed parallel and sequential computing environment. PDP 1998: 32-37

Bing Bing Zhou, Richard P. Brent: A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations. J. Parallel Distrib. Comput. 42(1): 1-10 (1997)

Manzur M. Murshed, Richard P. Brent: Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh. ICPADS 1997: 172-177

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

Bing Bing Zhou, Richard P. Brent, X. Qu, W. F. Liang: A Novel Parallel Algorithm for Enumerating Combinations. ICPP, Vol. 2 1996: 70-73

Weifa Liang, Richard P. Brent: Constructing the Spanners of Graphs in Parallel. IPPS 1996: 206-210

Bing Bing Zhou, Richard P. Brent: Jacobi-like Algorithms for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic. IPPS 1996: 593-600

Wanli Ma, C. W. Johnson, Richard P. Brent: Programming with transactions and chemical abstract machine. ISPAN 1996: 562-564

Andrew Tridgell, Richard P. Brent: A General-Purpose Parallel Sorting Algorithm. International Journal of High Speed Computing 7(2): 285-301 (1995)

Bing Bing Zhou, Richard P. Brent: On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions. PDP 1995: 401-408

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

Bing Bing Zhou, Richard P. Brent, Andrew Tridgell: Efficient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines. ICPADS 1994: 102-106

Bing Bing Zhou, Richard P. Brent: Parallel Computation of the Singular Value Decomposition on Tree Architectures. ICPP 1993: 128-131

Richard P. Brent, Bing Bing Zhou: A Stabilized Parallel Algorithm for Direct-Form Recursive Filters. IEEE Trans. Computers 40(3): 333-336 (1991)

Adam W. Bojanczyk, Richard P. Brent, Frank R. de Hoog: Linearly Connected Arrays for Toeplitz Least-Squares Problems. J. Parallel Distrib. Comput. 9(3): 261-270 (1990)

Richard P. Brent: Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation. ACM Trans. Program. Lang. Syst. 11(3): 388-403 (1989)

Richard P. Brent: A Linear Algorithm for Data Compression. Australian Computer Journal 19(2): 64-68 (1987)

Richard P. Brent, Brendan D. McKay: Determinants and ranks of random matrices over Z_m. Discrete Mathematics 66(1-2): 35-49 (1987)

Richard P. Brent, H. T. Kung: Systolic VLSI Arrays for Polynomial GCD Computation. IEEE Trans. Computers 33(8): 731-736 (1984)

Richard P. Brent, H. T. Kung, Franklin T. Luk: Some Linear-Time Algorithms for Systolic Arrays. IFIP Congress 1983: 865-876

Richard P. Brent, H. T. Kung: Corrigendum: ``The Area-Time Complexity of Binary Multiplication''. J. ACM 29(3): 904 (1982)

Richard P. Brent, Leslie M. Goldschlager: Some Area-Time Tradeoffs for VLSI. SIAM J. Comput. 11(4): 737-747 (1982)

Richard P. Brent, H. T. Kung: A Regular Layout for Parallel Adders. IEEE Trans. Computers 31(3): 260-264 (1982)

Richard P. Brent, H. T. Kung: The Area-Time Complexity of Binary Multiplication. J. ACM 28(3): 521-534 (1981)

Gérard M. Baudet, Richard P. Brent, H. T. Kung: Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor. Australian Computer Journal 12(3): 105-112 (1980)

Richard P. Brent, H. T. Kung: On the Area of Binary Tree Layouts. Inf. Process. Lett. 11(1): 46-48 (1980)

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)

Richard P. Brent, J. F. Traub: On the Complexity of Composition and Generalized Composition of Power Series. SIAM J. Comput. 9(1): 54-66 (1980)

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)

Richard P. Brent: Unrestricted Algorithms for Elementary and Special Functions. IFIP Congress 1980: 613-619

Richard P. Brent, H. T. Kung: The Chip Complexity of Binary Arithmetic. STOC 1980: 190-200

Richard P. Brent: Remark on ``Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]''. ACM Trans. Math. Softw. 5(4): 518-519 (1979)

Richard P. Brent, H. T. Kung: Fast Algorithms for Manipulating Formal Power Series. J. ACM 25(4): 581-595 (1978)

Richard P. Brent: A Fortran Multiple-Precision Arithmetic Package. ACM Trans. Math. Softw. 4(1): 57-70 (1978)

Richard P. Brent: Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]. ACM Trans. Math. Softw. 4(1): 71-81 (1978)

Richard P. Brent: Fast Multiple-Precision Evaluation of Elementary Functions. J. ACM 23(2): 242-251 (1976)

Richard P. Brent: A Gaussian Pseudo-Random Number Generator (Algorithm 488). Commun. ACM 17(12): 704-706 (1974)

Richard P. Brent: The Parallel Evaluation of General Arithmetic Expressions. J. ACM 21(2): 201-206 (1974)

Richard P. Brent: Reducing the Retrieval Time of Scatter Storage Techniques. Commun. ACM 16(2): 105-109 (1973)

Richard P. Brent: The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations. Complexity of Computer Computations 1972: 61-71

Richard P. Brent: An Algorithm with Guaranteed Convergence for Finding a Zero of a Function. Comput. J. 14(4): 422-425 (1971)