Wayne Eberly

Affiliations:
  • University of Calgary, Canada


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Automating algorithm selection: Checking for matrix properties that can simplify computations.
J. Symb. Comput., 2019

2016
Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fields.
ACM Commun. Comput. Algebra, 2016

Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2013
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority.
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.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2007
Faster inversion and other black box matrix computations using efficient block projections.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Solving Sparse Integer Linear Systems
CoRR, 2006

Solving sparse rational linear systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005
A reliable block Lanczos algorithm over small finite fields.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Efficient decomposition of separable algebras.
J. Symb. Comput., 2004

Reliable Krylov-based algorithms for matrix null space and rank.
Proceedings of the Symbolic and Algebraic Computation, 2004

2003
Early termination over small fields.
Proceedings of the Symbolic and Algebraic Computation, 2003

2000
Efficient Decomposition of Associative Algebras over Finite Fields.
J. Symb. Comput., 2000

Black box Frobenius decompositions over small fields.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Computing the Determinant and Smith Form of an Integer Matrix.
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.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997
On Randomized Lanczos Algorithms.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Processor-efficient parallel matrix inversion over abstract fields: two extensions.
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).
SIAM Rev., 1996

Efficient Decomposition of Associative Algebras.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Fast Parallel Band Matrix Arithmetic
Inf. Comput., January, 1995

Size-Depth Tradeoffs for Algebraic Formulas.
SIAM J. Comput., 1995

Efficient Parallel Computations for Singular Band Matrices.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Logarithmic Depth Circuits for Hermite Interpolation.
J. Algorithms, 1994

1992
On Efficient Band Matrix Arithmetic
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Decompositions of Algebras Over R and C.
Comput. Complex., 1991

Decomposition of Algebras Over Finite Fields and Number Fields.
Comput. Complex., 1991

Efficient parallel independent subsets and matrix factorizations.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Size-Depth Tradeoffs for Algebraic Formulae
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989
Computations for algebras and group representations.
PhD thesis, 1989

Very Fast Parallel Polynomial Arithmetic.
SIAM J. Comput., 1989

1984
Very Fast Parallel Matrix and Polynomial Arithmetic
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984


  Loading...