| Publication | Date of Publication | Type |
|---|
Automating algorithm selection: checking for matrix properties that can simplify computations
Journal of Symbolic Computation | 2019-06-20 | Paper |
Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
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 | 2017-05-10 | Paper |
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Black box Frobenius decompositions over small fields
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
A reliable block Lanczos algorithm over small finite fields
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
Efficient multiparty computation for arithmetic circuits against a covert majority
Progress in Cryptology – AFRICACRYPT 2013 | 2013-06-07 | Paper |
| Faster inversion and other black box matrix computations using efficient block projections | 2009-01-20 | Paper |
| scientific article; zbMATH DE number 2151185 (Why is no real title available?) | 2005-04-04 | Paper |
Reliable Krylov-based algorithms for matrix null space and rank
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Efficient decomposition of separable algebras.
Journal of Symbolic Computation | 2004-06-22 | Paper |
Efficient decomposition of associative algebras over finite fields
Journal of Symbolic Computation | 2002-07-17 | Paper |
Efficient matrix preconditioners for black box linear algebra
Linear Algebra and its Applications | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1253981 (Why is no real title available?) | 1999-08-05 | Paper |
| scientific article; zbMATH DE number 1254019 (Why is no real title available?) | 1999-08-05 | Paper |
| scientific article; zbMATH DE number 1254290 (Why is no real title available?) | 1999-07-12 | Paper |
| scientific article; zbMATH DE number 1256683 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 910868 (Why is no real title available?) | 1996-12-08 | Paper |
Size-Depth Tradeoffs for Algebraic Formulas
SIAM Journal on Computing | 1995-11-01 | Paper |
Fast parallel band matrix arithmetic
Information and Computation | 1995-04-10 | Paper |
Logarithmic Depth Circuits for Hermite Interpolation
Journal of Algorithms | 1995-02-02 | Paper |
Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
Computational Complexity | 1993-10-10 | Paper |
Decomposition of algebras over finite fields and number fields
Computational Complexity | 1993-10-10 | Paper |
Very Fast Parallel Polynomial Arithmetic
SIAM Journal on Computing | 1989-01-01 | Paper |
