Very Fast Parallel Matrix and Polynomial Arithmetic - Wayne Eberly (FOCS, 1984)

Very Fast Parallel Polynomial Arithmetic. - Wayne Eberly (SIAM J. Comput., 1989)

Computations for algebras and group representations. - Wayne Eberly (1989)

Size-Depth Tradeoffs for Algebraic Formulae - Nader H. Bshouty; Richard Cleve; Wayne Eberly (FOCS, 1991)

Efficient parallel independent subsets and matrix factorizations. - Wayne Eberly (SPDP, 1991)

Decomposition of Algebras Over Finite Fields and Number Fields. - Wayne Eberly (Comput. Complex., 1991)

Decompositions of Algebras Over R and C. - Wayne Eberly (Comput. Complex., 1991)

On Efficient Band Matrix Arithmetic - Wayne Eberly (FOCS, 1992)

Logarithmic Depth Circuits for Hermite Interpolation. - Wayne Eberly (J. Algorithms, 1994)

Efficient Parallel Computations for Singular Band Matrices. - Wayne Eberly (SODA, 1995)

Size-Depth Tradeoffs for Algebraic Formulas. - Nader H. Bshouty; Richard Cleve; Wayne Eberly (SIAM J. Comput., 1995)

Fast Parallel Band Matrix Arithmetic - Wayne Eberly (Inf. Comput., 1995)

Efficient Decomposition of Associative Algebras. - Wayne Eberly; Mark Giesbrecht (ISSAC, 1996)

Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan). - Wayne Eberly (SIAM Rev., 1996)

Processor-efficient parallel matrix inversion over abstract fields: two extensions. - Wayne Eberly (PASCO, 1997)

On Randomized Lanczos Algorithms. - Wayne Eberly; Erich L. Kaltofen (ISSAC, 1997)

Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. - Wayne Eberly; Lisa Higham; Jolanta Warpechowska-Gruca (DISC, 1998)

Computing the Determinant and Smith Form of an Integer Matrix. - Wayne Eberly; Mark Giesbrecht; Gilles Villard (FOCS, 2000)

Black box Frobenius decompositions over small fields. - Wayne Eberly (ISSAC, 2000)

Efficient Decomposition of Associative Algebras over Finite Fields. - Wayne Eberly; Mark Giesbrecht (J. Symb. Comput., 2000)

Early termination over small fields. - Wayne Eberly (ISSAC, 2003)

Reliable Krylov-based algorithms for matrix null space and rank. - Wayne Eberly (ISSAC, 2004)

Efficient decomposition of separable algebras. - Wayne Eberly; Mark Giesbrecht (J. Symb. Comput., 2004)

A reliable block Lanczos algorithm over small finite fields. - Bradford Hovinen; Wayne Eberly (ISSAC, 2005)

Solving sparse rational linear systems. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2006)

Solving Sparse Integer Linear Systems - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (CoRR, 2006)

Faster inversion and other black box matrix computations using efficient block projections. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2007)

Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. - Wayne Eberly (ISSAC, 2010)

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority. - Isheeta Nargis; Payman Mohassel; Wayne Eberly (AFRICACRYPT, 2013)

Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations. - Wayne Eberly (ISSAC, 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)

Automating algorithm selection: Checking for matrix properties that can simplify computations. - Wayne Eberly (J. Symb. Comput., 2019)