Wayne Eberly

Publication Activity (10 Years)

Years Active: 1984-2019
Publications (10 Years): 5

Top Topics

Low Rank Approximation

Top Venues

ACM Commun. Comput. Algebra

Publications

Wayne Eberly
Automating algorithm selection: Checking for matrix properties that can simplify computations. J. Symb. Comput. 94 (2019)
Wayne Eberly
Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations. CoRR (2016)
Wayne Eberly
Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields. CoRR (2016)
Wayne Eberly
Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations. ISSAC (2016)
Wayne Eberly
Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fields. ACM Commun. Comput. Algebra 50 (4) (2016)
Isheeta Nargis, Payman Mohassel, Wayne Eberly
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority. AFRICACRYPT (2013)
Wayne Eberly
Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. ISSAC (2010)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections CoRR (2007)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Faster inversion and other black box matrix computations using efficient block projections. ISSAC (2007)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Solving sparse rational linear systems. ISSAC (2006)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Solving Sparse Integer Linear Systems CoRR (2006)
Bradford Hovinen, Wayne Eberly
A reliable block Lanczos algorithm over small finite fields. ISSAC (2005)
Wayne Eberly, Mark Giesbrecht
Efficient decomposition of separable algebras. J. Symb. Comput. 37 (1) (2004)
Wayne Eberly
Reliable Krylov-based algorithms for matrix null space and rank. ISSAC (2004)
Wayne Eberly
Early termination over small fields. ISSAC (2003)
Wayne Eberly
Black box Frobenius decompositions over small fields. ISSAC (2000)
Wayne Eberly, Mark Giesbrecht
Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29 (3) (2000)
Wayne Eberly, Mark Giesbrecht, Gilles Villard
Computing the Determinant and Smith Form of an Integer Matrix. FOCS (2000)
Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC (1998)
Wayne Eberly, Erich Kaltofen
On Randomized Lanczos Algorithms. ISSAC (1997)
Wayne Eberly
Processor-efficient parallel matrix inversion over abstract fields: two extensions. PASCO (1997)
Wayne Eberly
Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan). SIAM Rev. 38 (1) (1996)
Wayne Eberly, Mark Giesbrecht
Efficient Decomposition of Associative Algebras. ISSAC (1996)
Nader H. Bshouty, Richard Cleve, Wayne Eberly
Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24 (4) (1995)
Wayne Eberly
Fast Parallel Band Matrix Arithmetic Inf. Comput. 116 (1) (1995)
Wayne Eberly
Efficient Parallel Computations for Singular Band Matrices. SODA (1995)
Wayne Eberly
Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms 16 (3) (1994)
Wayne Eberly
On Efficient Band Matrix Arithmetic FOCS (1992)
Wayne Eberly
Efficient parallel independent subsets and matrix factorizations. SPDP (1991)
Nader H. Bshouty, Richard Cleve, Wayne Eberly
Size-Depth Tradeoffs for Algebraic Formulae FOCS (1991)
Wayne Eberly
Decompositions of Algebras Over R and C. Comput. Complex. 1 (1991)
Wayne Eberly
Decomposition of Algebras Over Finite Fields and Number Fields. Comput. Complex. 1 (1991)
Wayne Eberly
Very Fast Parallel Polynomial Arithmetic. SIAM J. Comput. 18 (5) (1989)
Wayne Eberly
Very Fast Parallel Matrix and Polynomial Arithmetic FOCS (1984)