Victor Y. Pan

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Solving a Polynomial Equation: Some History and Recent Progress.

[BibT_eX]

[DOI]

SIAM Rev., 1997

Newton's Iteration for Inversion of Cauchy-Like and Other Structured Matrices.

[BibT_eX]

[DOI]

J. Complex., 1997

Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs.

[BibT_eX]

[DOI]

Yijie Han

Algorithmica, 1997

Faster Solution of the Key Equation for Decoding BCH Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

The Structure of Sparse Resultant Matrices.

[BibT_eX]

[DOI]

Ioannis Z. Emiris

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Fast rectangular matrix multiplications and improving parallel matrix computations.

[BibT_eX]

[DOI]

Xiaohan Huang

Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, 1997

Algebraic Algorithms.

[BibT_eX]

Angel Díaz

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Computing x^m mod p(x) and an Application to Splitting a Polynomial Into Factors Over a Fixed Disc.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors.

[BibT_eX]

[DOI]

J. Complex., 1996

Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors.

[BibT_eX]

[DOI]

J. Complex., 1996

A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer Rings.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

On Parallel Computations with Banded Matrices

[BibT_eX]

[DOI]

Isdor Sobze

Antoine Atinkpahoun

Inf. Comput., August, 1995

Work-Preserving Speed-Up of Parallel Matrix Computations.

[BibT_eX]

[DOI]

Franco P. Preparata

SIAM J. Comput., 1995

An algebraic approach to approximate evaluation of a polynomial on a set of real points.

[BibT_eX]

[DOI]

Adv. Comput. Math., 1995

Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

New Resultant Inequalities and Complex Polynomial Factorization.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Simple Multivariate Polynomial Multiplication.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

Optimum Parallel Computations with Banded Matrices.

[BibT_eX]

[DOI]

Isdor Sobze

Antoine Atinkpahoun

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

New Techniques for Approximating Complex Polynomial Zeros.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic.

[BibT_eX]

Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

Polynomial and matrix computations, 1st Edition.

[BibT_eX]

[DOI]

Progress in theoretical computer science 12, Birkhäuser, ISBN: 3764337869, 1994

1993

Concurrent Iterative Algorithm for Toeplitz-like Linear Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Fast and Efficient Parallel Solution of Sparse Linear Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Improved Parallel Polynomial Division.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem.

[BibT_eX]

[DOI]

James Demmel

J. Complex., 1993

Parallel Computations with Toeplitz-like and Hankel-like Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD

[BibT_eX]

[DOI]

David Shallcross

Yu Lin-Kriz

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Compact Multigrid.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1992

Complexity of Computations with Matrices and Polynomials.

[BibT_eX]

[DOI]

SIAM Rev., 1992

Parallel solution of toeplitzlike linear systems.

[BibT_eX]

[DOI]

J. Complex., 1992

Polynomial Division with a Remainder by Means of Evaluation and Interpolation.

[BibT_eX]

[DOI]

Akimou Sadikou

Elliott Landowne

Inf. Process. Lett., 1992

Practical improvement of the divide-and-conquer eigenvalue algorithms.

[BibT_eX]

[DOI]

Computing, 1992

Supereffective Slow-Down of Parallel Computations.

[BibT_eX]

[DOI]

Franco P. Preparata

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function.

[BibT_eX]

[DOI]

Yu Lin-Kriz

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms

[BibT_eX]

[DOI]

Stephen R. Tate

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Improved Parallel Polynomial Division and Its Extensions

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications.

[BibT_eX]

[DOI]

Robert Schreiber

SIAM J. Sci. Comput., 1991

On the evaluation of the Eigenvalues of a banded toeplitz block matrix.

[BibT_eX]

[DOI]

J. Complex., 1991

The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Univariate polynomial division with a remainder by means of evaluation and interpolation.

[BibT_eX]

[DOI]

Elliott Landowne

Akimou Sadikou

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Processor Efficient Parallel Solution of Linear Systems over an Abstract Field.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Improved Parallel Computations with Matrices and Polynomials.

[BibT_eX]

[DOI]

Luca Gemignani

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Parallel Least-Squares Solution of General and Toeplitz Systems.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Parallel Polynomial Computations by Recursive Processes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Fast and Efficient Solution of Path Algebra Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

Parallel Evaluation of the Determinant and of the Inverse of a Matrix.

[BibT_eX]

[DOI]

Zvi Galil

Inf. Process. Lett., 1989

On Some Computations with Dense Structured Matrices.

[BibT_eX]

[DOI]

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988

Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Improved processor bounds for combinatorial problems in RNC.

[BibT_eX]

[DOI]

Zvi Galil

Comb., 1988

1987

Complexity of Parallel Matrix Computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Some Polynomial and Toeplitz Matrix Computations

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Polynomial division and its computational complexity.

[BibT_eX]

[DOI]

J. Complex., 1986

The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Efficient Parallel Solution of Linear Systems

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

Fast and Efficient Algorithms for Sequential and Parallel Evaluation of Polynomial Zeros and of Matrix Polynomials

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC

[BibT_eX]

[DOI]

Zvi Galil

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Algorithms for Polynominal Division.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

1984

The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

How to Multiply Matrices Faster

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 179, Springer, ISBN: 3-540-13866-8, 1984

1983

The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1983

1981

A Unified Approach to the Analysis of Bilinear Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1981

The Bit-Complexity of Arithmetic Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1981

The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

New Fast Algorithms for Matrix Operations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Convolution of Vectors over the Real Field of Constants by Evaluation - Interpolation Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1980

1979

Field Extension and Triangular Aggregating, Uniting and Canceling for the Acceleration of Matrix Multiplications

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers

[BibT_eX]

[DOI]

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations

[BibT_eX]

[DOI]