 | 2008 |
|---|
| 78 |       | Richard P. Brent,
Pierrick Gaudry,
Emmanuel Thomé,
Paul Zimmermann:
Faster Multiplication in GF(2)[x].
ANTS 2008: 153-166 |
| 77 | | Shi Bai,
Richard P. Brent:
On the Efficiency of Pollard's Rho Method for Discrete Logarithms.
CATS 2008: 125-131 |
| 76 | | Richard P. Brent:
Some Comments on C. S. Wallace's Random Number Generators.
Comput. J. 51(5): 579-584 (2008) |
| 2007 |
|---|
| 75 | | 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 |
| 74 | | Richard P. Brent,
Paul Zimmermann:
A Multi-level Blocking Distinct Degree Factorization Algorithm
CoRR abs/0710.4410: (2007) |
| 2006 |
|---|
| 73 |  | 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 |
| 72 | | 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 |
| 71 | | 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 |
| 2005 |
|---|
| 70 | | 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 |
|---|
| 69 | | Richard P. Brent:
Fast and Reliable Random Number Generators for Scientific Computing.
PARA 2004: 1-10 |
| 68 | | 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) |
| 2003 |
|---|
| 67 | | Richard P. Brent,
Paul Zimmermann:
Random Number Generators with Period Divisible by a Mersenne Prime.
ICCSA (1) 2003: 1-10 |
| 66 | | 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 |
| 65 | | Laurence Tianruo Yang,
Richard P. Brent:
Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures.
ISPA 2003: 197-208 |
| 64 | | 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) |
| 63 | | 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) |
| 62 | | Richard P. Brent,
Shuhong Gao,
Alan G. B. Lauder:
Random Krylov Spaces over Finite Fields.
SIAM J. Discrete Math. 16(2): 276-287 (2003) |
| 2002 |
|---|
| 61 | | Laurence Tianruo Yang,
Richard P. Brent:
The Improved BiCG Method for Large and Sparse Linear Systems on Parallel Distributed Memory Architectures.
IPDPS 2002 |
| 2001 |
|---|
| 60 | | 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 |
| 59 | | Laurence Tianruo Yang,
Richard P. Brent:
The Improved Conjugate Gradient Squared (ICGS) Method on Parallel Distributed Memory Architectures.
ICPP Workshops 2001: 161-168 |
| 58 | | Bing Bing Zhou,
Richard P. Brent:
Gang Scheduling with a Queue for Large Jobs.
IPDPS 2001: 58 |
| 57 | | Bing Bing Zhou,
Richard P. Brent:
On the Development of an Efficient Coscheduling System.
JSSPP 2001: 103-115 |
| 56 | | 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) |
| 2000 |
|---|
| 55 | | Richard P. Brent:
Recent Progress and Prospects for Integer Factorisation Algorithms.
COCOON 2000: 3-22 |
| 54 | | M. Manzur Murshed,
Richard P. Brent:
How promising is the k-constrained reconfigurable mesh?
Computers and Their Applications 2000: 288-291 |
| 53 | | Bing Bing Zhou,
David Walsh,
Richard P. Brent:
Resource Allocation Schemes for Gang Scheduling.
JSSPP 2000: 74-86 |
| 52 | | Richard P. Brent,
Richard E. Crandall,
Karl Dilcher,
C. Van Halewyn:
Three new factors of Fermat numbers.
Math. Comput. 69(231): 1297-1304 (2000) |
| 51 | | M. Manzur Murshed,
Richard P. Brent:
Adaptive AT2 optimal algorithms on reconfigurable meshes.
Parallel Computing 26(11): 1447-1458 (2000) |
| 1999 |
|---|
| 50 | | Richard P. Brent:
Some Parallel Algorithms for Integer Factorisation.
Euro-Par 1999: 1-22 |
| 49 | | Richard P. Brent:
Computer Arithmetic - A Programmer's Perspective.
IEEE Symposium on Computer Arithmetic 1999: 2- |
| 48 | | 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 |
| 47 | | 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 |
| 46 | | M. Manzur Murshed,
Richard P. Brent:
Maximal Contour Algorithms on Constrained Reconfigurable Meshes.
PDPTA 1999: 2238-2244 |
| 45 | | Richard P. Brent:
Factorization of the tenth Fermat number.
Math. Comput. 68(225): 429-451 (1999) |
| 1998 |
|---|
| 44 | | Brian Murphy,
Richard P. Brent:
On Quadratic Polynomials for the Number Field Sieve.
CATS 1998: 199-214 |
| 43 | | Richard P. Brent:
Random Number Generation and Simulation on Vector and Parallel Computers.
Euro-Par 1998: 1-20 |
| 42 | | 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 |
| 41 | | Bing Bing Zhou,
Richard P. Brent,
David Walsh,
Kuniyasu Suzaki:
Job Scheduling Strategies for Networks of Workstations.
JSSPP 1998: 143-157 |
| 40 | | M. Manzur 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) |
| 1997 |
|---|
| 39 | | M. Manzur Murshed,
Richard P. Brent:
Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh.
ICPADS 1997: 172-177 |
| 38 | | 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) |
| 1996 |
|---|
| 37 | | 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 |
| 36 | | Bing Bing Zhou,
Richard P. Brent,
X. Qu,
W. F. Liang:
A Novel Parallel Algorithm for Enumerating Combinations.
ICPP, Vol. 2 1996: 70-73 |
| 35 | | Weifa Liang,
Richard P. Brent:
Constructing the Spanners of Graphs in Parallel.
IPPS 1996: 206-210 |
| 34 | | Bing Bing Zhou,
Richard P. Brent:
Jacobi-like Algorithms for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic.
IPPS 1996: 593-600 |
| 33 | | Wanli Ma,
C. W. Johnson,
Richard P. Brent:
Programming with transactions and chemical abstract machine.
ISPAN 1996: 562-564 |
| 1995 |
|---|
| 32 | | Bing Bing Zhou,
Richard P. Brent:
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions.
PDP 1995: 401-408 |
| 31 | | Andrew Tridgell,
Richard P. Brent:
A General-Purpose Parallel Sorting Algorithm.
International Journal of High Speed Computing 7(2): 285-301 (1995) |
| 1994 |
|---|
| 30 | | Bing Bing Zhou,
Richard P. Brent,
Andrew Tridgell:
Efficient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines.
ICPADS 1994: 102-106 |
| 29 | | 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 |
| 1993 |
|---|
| 28 | | Bing Bing Zhou,
Richard P. Brent:
Parallel Computation of the Singular Value Decomposition on Tree Architectures.
ICPP 1993: 128-131 |
| 1991 |
|---|
| 27 | | Richard P. Brent,
Bing Bing Zhou:
A Stabilized Parallel Algorithm for Direct-Form Recursive Filters.
IEEE Trans. Computers 40(3): 333-336 (1991) |
| 1990 |
|---|
| 26 | | Adam W. Bojanczyk,
Richard P. Brent,
F. R. de Hoog:
Linearly Connected Arrays for Toeplitz Least-Squares Problems.
J. Parallel Distrib. Comput. 9(3): 261-270 (1990) |
| 1989 |
|---|
| 25 | | Richard P. Brent:
Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation.
ACM Trans. Program. Lang. Syst. 11(3): 388-403 (1989) |
| 1987 |
|---|
| 24 | | Richard P. Brent:
A Linear Algorithm for Data Compression.
Australian Computer Journal 19(2): 64-68 (1987) |
| 23 | | Richard P. Brent,
Brendan D. McKay:
Determinants and ranks of random matrices over Zm.
Discrete Mathematics 66(1-2): 35-49 (1987) |
| 1984 |
|---|
| 22 | | Richard P. Brent,
H. T. Kung:
Systolic VLSI Arrays for Polynomial GCD Computation.
IEEE Trans. Computers 33(8): 731-736 (1984) |
| 1983 |
|---|
| 21 | | Richard P. Brent,
H. T. Kung,
Franklin T. Luk:
Some Linear-Time Algorithms for Systolic Arrays.
IFIP Congress 1983: 865-876 |
| 1982 |
|---|
| 20 | | Richard P. Brent,
H. T. Kung:
A Regular Layout for Parallel Adders.
IEEE Trans. Computers 31(3): 260-264 (1982) |
| 19 | | Richard P. Brent,
H. T. Kung:
Corrigendum: ``The Area-Time Complexity of Binary Multiplication''.
J. ACM 29(3): 904 (1982) |
| 18 | | Richard P. Brent,
Leslie M. Goldschlager:
Some Area-Time Tradeoffs for VLSI.
SIAM J. Comput. 11(4): 737-747 (1982) |
| 1981 |
|---|
| 17 | | Richard P. Brent,
H. T. Kung:
The Area-Time Complexity of Binary Multiplication.
J. ACM 28(3): 521-534 (1981) |
| 1980 |
|---|
| 16 | | Richard P. Brent:
Unrestricted Algorithms for Elementary and Special Functions.
IFIP Congress 1980: 613-619 |
| 15 | | Richard P. Brent,
H. T. Kung:
The Chip Complexity of Binary Arithmetic
STOC 1980: 190-200 |
| 14 | | 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) |
| 13 | | 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) |
| 12 | | Richard P. Brent,
H. T. Kung:
On the Area of Binary Tree Layouts.
Inf. Process. Lett. 11(1): 46-48 (1980) |
| 11 | | 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) |
| 10 | | 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) |
| 1979 |
|---|
| 9 | | 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 |
|---|
| 8 | | Richard P. Brent:
A Fortran Multiple-Precision Arithmetic Package.
ACM Trans. Math. Softw. 4(1): 57-70 (1978) |
| 7 | | Richard P. Brent:
Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1].
ACM Trans. Math. Softw. 4(1): 71-81 (1978) |
| 6 | | Richard P. Brent,
H. T. Kung:
Fast Algorithms for Manipulating Formal Power Series.
J. ACM 25(4): 581-595 (1978) |
| 1976 |
|---|
| 5 | | Richard P. Brent:
Fast Multiple-Precision Evaluation of Elementary Functions.
J. ACM 23(2): 242-251 (1976) |
| 1974 |
|---|
| 4 | | Richard P. Brent:
A Gaussian Pseudo-Random Number Generator (Algorithm 488).
Commun. ACM 17(12): 704-706 (1974) |
| 3 | | Richard P. Brent:
The Parallel Evaluation of General Arithmetic Expressions.
J. ACM 21(2): 201-206 (1974) |
| 1973 |
|---|
| 2 | | Richard P. Brent:
Reducing the Retrieval Time of Scatter Storage Techniques.
Commun. ACM 16(2): 105-109 (1973) |
| 1971 |
|---|
| 1 | | Richard P. Brent:
An Algorithm with Guaranteed Convergence for Finding a Zero of a Function.
Comput. J. 14(4): 422-425 (1971) |
