Richard Brent - Research Interests (2)

Computational complexity and analysis of algorithms

• matrix multiplication algorithms and their numerical stability
• information storage and retrieval using hash coding
• area-time bounds for VLSI (jointly with HT Kung)
• randomised algorithms
• parallel algorithms
  • parallel evaluation of arithmetic expressions
  • parallel linear algebra
  • parallel sorting (jointly with Andrew Tridgell and Brendan McKay)
• various topics related to algorithms and complexity
  • the binary Euclidean algorithm
    • recent work inspired by Brigitte Vallée
    • a survey paper (Hoare Symposium, Oxford, Sept 1999)
  • data compression algorithms using hashing
  • some problems related to random matrices (jointly with Brendan McKay)
    (this is more combinatorics than analysis of algorithms).

Go to next research area

Return to list of research areas