Person:685710

Available identifiers

zbMath Open eberly.wayneMaRDI QIDQ685710

List of research outcomes

Publication	Date of Publication	Type
Automating algorithm selection: checking for matrix properties that can simplify computations	2019-06-20	Paper
Black box linear algebra	2017-06-21	Paper
Selecting Algorithms for Black Box Matrices	2017-05-10	Paper
Solving sparse rational linear systems	2017-02-03	Paper
Black box Frobenius decompositions over small fields	2015-11-26	Paper
Yet another block Lanczos algorithm	2015-09-17	Paper
A reliable block Lanczos algorithm over small finite fields	2015-07-16	Paper
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority	2013-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q5301663	2009-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q4660651	2005-04-04	Paper
Reliable Krylov-based algorithms for matrix null space and rank	2005-03-14	Paper
Efficient decomposition of separable algebras.	2004-06-22	Paper
Efficient decomposition of associative algebras over finite fields	2002-07-17	Paper
Efficient matrix preconditioners for black box linear algebra	2002-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4226959	1999-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4227001	1999-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4227340	1999-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q4230370	1999-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4886042	1996-12-08	Paper
Size-Depth Tradeoffs for Algebraic Formulas	1995-11-01	Paper
Fast parallel band matrix arithmetic	1995-04-10	Paper
Logarithmic Depth Circuits for Hermite Interpolation	1995-02-02	Paper
Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)	1993-10-10	Paper
Decomposition of algebras over finite fields and number fields	1993-10-10	Paper
Very Fast Parallel Polynomial Arithmetic	1989-01-01	Paper

Research outcomes over time

This page was built for person: Wayne Eberly