Wayne Eberly

According to our database, Wayne Eberly authored at least 32 papers between 1984 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Automating algorithm selection: Checking for matrix properties that can simplify computations.

Wayne Eberly

J. Symb. Comput., 2019

2016

Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fields.

Wayne Eberly

ACM Commun. Comput. Algebra, 2016

Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations.

Wayne Eberly

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2013

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority.

Isheeta Nargis, Payman Mohassel, Wayne Eberly

Proceedings of the Progress in Cryptology, 2013

2010

Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case.

Wayne Eberly

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2007

Faster inversion and other black box matrix computations using efficient block projections.

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Solving Sparse Integer Linear Systems

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard

CoRR, 2006

Solving sparse rational linear systems.

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

A reliable block Lanczos algorithm over small finite fields.

Bradford Hovinen, Wayne Eberly

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Efficient decomposition of separable algebras.

Wayne Eberly, Mark Giesbrecht

J. Symb. Comput., 2004

Reliable Krylov-based algorithms for matrix null space and rank.

Wayne Eberly

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Early termination over small fields.

Wayne Eberly

Proceedings of the Symbolic and Algebraic Computation, 2003

2000

Efficient Decomposition of Associative Algebras over Finite Fields.

Wayne Eberly, Mark Giesbrecht

J. Symb. Comput., 2000

Black box Frobenius decompositions over small fields.

Wayne Eberly

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

Computing the Determinant and Smith Form of an Integer Matrix.

Wayne Eberly, Mark Giesbrecht, Gilles Villard

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1998

Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput.

Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca

Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997

On Randomized Lanczos Algorithms.

Wayne Eberly, Erich L. Kaltofen

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

Processor-efficient parallel matrix inversion over abstract fields: two extensions.

Wayne Eberly

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

1996

Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan).

Wayne Eberly

SIAM Rev., 1996

Efficient Decomposition of Associative Algebras.

Wayne Eberly, Mark Giesbrecht

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

1995

Fast Parallel Band Matrix Arithmetic

Wayne Eberly

Inf. Comput., January, 1995

Size-Depth Tradeoffs for Algebraic Formulas.

Nader H. Bshouty, Richard Cleve, Wayne Eberly

SIAM J. Comput., 1995

Efficient Parallel Computations for Singular Band Matrices.

Wayne Eberly

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Logarithmic Depth Circuits for Hermite Interpolation.

Wayne Eberly

J. Algorithms, 1994

1992

On Efficient Band Matrix Arithmetic

Wayne Eberly

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

1991

Decompositions of Algebras Over R and C.

Wayne Eberly

Comput. Complex., 1991

Decomposition of Algebras Over Finite Fields and Number Fields.

Wayne Eberly

Comput. Complex., 1991

Efficient parallel independent subsets and matrix factorizations.

Wayne Eberly

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

Size-Depth Tradeoffs for Algebraic Formulae

Nader H. Bshouty, Richard Cleve, Wayne Eberly

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989

Computations for algebras and group representations.

Wayne Eberly

PhD thesis, 1989

Very Fast Parallel Polynomial Arithmetic.

Wayne Eberly

SIAM J. Comput., 1989

1984

Very Fast Parallel Matrix and Polynomial Arithmetic

Wayne Eberly

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984