Parallelism and algorithms for algebraic manipulation: current work

We outline recent results relating to the use of parallelism for solving problems in algebraic manipulation. Practical issues are discussed.

[1]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[2]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[3]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1984, SIAM J. Comput..

[4]  Victor Y. Pan,et al.  Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices , 1985, FSTTCS.

[5]  Victor Y. Pan.  Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Erich Kaltofen,et al.  Fast parallel algorithms for similarity of matrices , 1986, SYMSAC '86.

[7]  Jeffrey Scott Vitter,et al.  Parallel algorithms for unification and other complete problems in p , 1984, ACM '84.

[8]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[9]  Gary L. Miller,et al.  Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers , 1984, FOCS.

[10]  H. T. Kung.  New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences , 1976, JACM.

[11]  Dario Bini,et al.  Parallel Solution of Certain Toeplitz Linear Systems , 1984, SIAM J. Comput..

[12]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[13]  Mukkai S. Krishnamoorthy,et al.  A parallel algorithm for the monadic unification problem , 1985, BIT.

[14]  Joachim von zur Gathen.  Parallel algorithms for algebraic problems , 1983, STOC '83.

[15]  S. Watt.  Bounded parallelism in computer algebra , 1986 .

[16]  H. T. Kung.  Use of VLSI in algebraic computation: Some suggestions , 1981, SYMSAC '81.

[17]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[18]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[19]  Wayne Eberly,et al.  Very Fast Parallel Matrix and Polynomial Arithmetic , 1984, FOCS.

[20]  Zvi Galil.  Optimal Parallel Algorithms for String Matching , 1985, Inf. Control..

[21]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[22]  W. Morven Gentleman,et al.  Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries , 1976, TOMS.

[23]  J. Hopcroft,et al.  Fast parallel matrix and GCD computations , 1982, FOCS 1982.

[24]  David J. DeWitt,et al.  A taxonomy of parallel sorting , 1984, CSUR.

[25]  Ephraim Feig,et al.  A fast parallel algorithm for determining all roots of a polynomial with real roots , 1986, STOC '86.

[26]  Yasumasa Kanada,et al.  Parallelism in algebraic computation and parallel algorithms for symbolic linear systems , 1981, SYMSAC '81.

[27]  Zvonko G. Vranesic,et al.  Computer Organization , 1984 .

[28]  Joachim von zur Gathen,et al.  Parallel algorithms for algebraic problems , 1983, SIAM J. Comput..

[29]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[30]  James H. Davenport,et al.  On the parallel Risch Algorithm (II) , 1985, TOMS.

[31]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[32]  S. Lakshmivarahan,et al.  Parallel Algorithms for Solving Certain Classes of Linear Recurrences , 1985, FSTTCS.