Complexity of parallel matrix computations

This publication has 12 references indexed in Scilit:

• Matching is as easy as matrix inversion
  Combinatorica, 1987
• Algebraic complexity of computing polynomial zeros
  Computers & Mathematics with Applications, 1987
• Fast parallel orthogonalization
  ACM SIGACT News, 1986
• Fast algorithms for the characteristics polynomial
  Theoretical Computer Science, 1985
• Improved processor bounds for algebraic and combinatorial problems in RNC
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• The complexity of partial derivatives
  Theoretical Computer Science, 1983
• Fast parallel matrix and GCD computations
  Information and Control, 1982
• Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
  IEEE Transactions on Circuits and Systems, 1979
• An improved parallel processor bound in fast matrix inversion
  Information Processing Letters, 1978
• Fast Parallel Matrix Inversion Algorithms
  SIAM Journal on Computing, 1976