Richard Brent - Recent Talks and Lectures
CARMA Opening, Newcastle, NSW, 31 October 2009
-
The Great Trinomial Hunt
(invited talk presented at the opening of
CARMA, University of Newcastle, NSW, 31 October 2009).
This talk announced the successful completion of a search for primitive
trinomials whose degree is the exponent of a Mersenne prime
(at least until the
GIMPS Project finds another Mersenne prime).
Overhead transparencies (beamer format):
[pdf]
Queen Mary, London, 30 March 2009
-
Factoring and Testing Irreducibility of Sparse Polynomials
over Small Finite Fields
(seminar presented at
Queen Mary, University of London, 30 March 2009).
Overhead transparencies:
[pdf]
Christchurch, December 2008
-
Three Ways to Test Irreducibility
(presented at the Seventh Australia - New Zealand Mathematics
Convention
(ANZMC2008), Christchurch, New Zealand,
8-12 December 2008).
This talk announced the discovery of a new
primitive trinomial
of record degree 43112609.
Overhead transparencies:
[pdf]
- An updated version was presented at the
25th British Colloquium for Theoretical Computer Science
(BCTCS09), University of Warwick, 7 April 2009.
Overhead transparencies:
[pdf]
- A prelimininary version was presented at the
MASCOS annual conference
held in Beechworth, Victoria,
10-11 July 2008).
Melbourne, July 2007
-
A Multi-level Blocking Distinct Degree Factorization Algorithm
(presented at the
Fq8 Conference
held in Melbourne,
9-13 July 2007).
Overhead transparencies:
[pdf]
- A similar talk was presented at the
University of Adelaide,
7 Dec 2007.
Stanford, March 2007
Canberra, February 2007
Canberra, October 2006
-
Pitfalls in Computation: Random and not so Random Numbers
( NAMS seminar,
ANU, 9 October 2006).
Overhead transparencies:
[pdf]
Berlin, July 2006
-
Using Magma to Find Good Xorshift Random Number Generators
(invited talk presented at the
Magma 2006 Conference,
Berlin, 30 July 2006).
Overhead transparencies:
[pdf]
- A similar talk was presented at
Sydney University,
14 June 2007.
Berlin, July 2006
Nancy, July 2006
-
Fast Algorithms for High-Precision Computation of Elementary Functions
(invited talk presented at the
RNC7 Conference,
Nancy, France, 12 July 2006).
Overhead transparencies:
[pdf]
- A similar talk was presented at
Sydney University,
13 June 2007.
Townsville, July 2006
-
Some Long-Period Random Number Generators using Shifts and Xors
(presented at the
CTAC06 Conference,
Townsville, 3 July 2006).
Overhead transparencies:
[pdf]
Canberra, September 2005
-
Challenges in Solving Large Sparse Linear Systems over Finite Fields
(Symposium on Optimisation and Data Analysis in honour of
Mike Osborne's 70th birthday),
Canberra, 23 September 2005).
Overhead transparencies:
[dvi]
[pdf]
[ps].
Oxford, February 2005
-
Computing Ratings from Eigenvectors
(Computational Mathematics and Applications Seminar,
Oxford, 3 February 2005).
Overhead transparencies:
[dvi]
[pdf]
[ps].
Oxford, November 2004
-
Uncertainty can be Better than Certainty:
Some Algorithms for Primality Testing
(28th
Strachey Lecture, Oxford, 2 November 2004).
Overhead transparencies:
[dvi]
[pdf]
[ps].
- Revision for Computational Mathematics seminar,
MSI, ANU, 27 November 2006:
[pdf]
[ps].
Lyngby, June 2004
-
Fast and Reliable Random Number Generators for Scientific Computing
(invited talk presented at the
PARA04 Workshop, State-of-the-Art in Scientific Computing,
Lyngby, Denmark, 20-23 June 2004).
Overhead transparencies:
[dvi]
[pdf]
[ps].
- Revision for AdvCom seminar, ANU, 8 May 2006:
[pdf]
[ps].
Banff, Clemson and Oxford, April-July 2003
Montreal, May 2003
-
Random Number Generators with Period Divisible by a Mersenne Prime
(invited talk presented at the 2003 International Conference on
Computational Science and its Applications (ICCSA03),
Montreal, Canada, 21 May 2003).
Overhead transparencies:
[dvi]
[pdf]
[ps].
-
A paper on this topic is available.
Clemson, April 2003
Bath and Oxford, November 2002
-
Large Sparse Linear Systems over Finite Fields
(presented at Bath/RAL Numerical Analysis Day, 4 Nov 2002;
also Departmental Seminar, OUCL, Oxford, 12 Nov 2002;
updated version presented in Canberra, 23 September 2005).
Overhead transparencies:
[pdf]
[ps].
Hong Kong, September 2001
-
Primitive Trinomials and Random Number Generators
(distinguished lecture series seminar presented at
the Chinese University of Hong Kong in celebration of the
tenth Anniversary of the Faculty of Engineering, 26 Sept 2001).
Overhead transparencies:
[dvi]
[pdf]
[ps].
- Similar talks were given at
-
Some papers on these topics
are available.
Birmingham, Manchester and Utrecht, March - April 2001
-
Prospects for Integer Factorisation Algorithms
(seminar presented at Utrecht, 5 April 2001;
also Birmingham and Manchester, March 2001).
Overhead transparencies:
[dvi]
[pdf]
[ps].
-
Related talks were given in:
- For details, see the
survey paper presented
at COCOON 2000, Sydney, July 2000.
Symposium in Celebration of the Work of Tony Hoare, Oxford, Sept 1999
-
Twenty years' analysis of the binary Euclidean algorithm
(
Hoare Symposium, Oxford, 15 Sept 1999).
Overhead transparencies:
[dvi]
[pdf]
[ps].
Related talks were given in:
- For more details, see the
paper which appeared in
the Hoare Symposium Proceedings.
Special Series of Lectures on Algorithms, Oxford, 1999
-
Six lectures on
algorithms
(Oxford, May-June 1999)
Overhead transparencies:
[pdf]
[ps].
More details of each lecture.
Cambridge, May 1999
-
Fast and Numerically Stable Algorithms for Structured Matrices
(seminar,
DAMTP,
Cambridge University, May 1999).
Overhead transparencies:
[dvi]
[pdf]
[ps].
- For more details, see the
paper
which appeared as a chapter in
[preliminary version of a chapter which appeared in
Fast Reliable Algorithms for Matrices with Structure
(edited by Kailath and Sayed), SIAM, 1999, 103-116].
Arith 14, Adelaide, April 1999
CWI Number Theory Day, Amsterdam, May 1998
-
Integer Factorization Algorithms Illustrated by the
Factorization of Fermat Numbers
(invited talk, Number Theory Day, CWI, Amsterdam, May 1998).
Overhead transparencies:
[dvi]
[pdf]
[ps].
Return to Richard Brent's index page