2007 |
27 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Faster inversion and other black box matrix computations using efficient block projections.
ISSAC 2007: 143-150 |
26 | EE | Clément Pernet,
Arne Storjohann:
Faster algorithms for the characteristic polynomial.
ISSAC 2007: 307-314 |
25 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
CoRR abs/cs/0701188: (2007) |
2006 |
24 | EE | Arne Storjohann:
Notes on computing minimal approximant bases.
Challenges in Symbolic Computation Software 2006 |
23 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Solving sparse rational linear systems.
ISSAC 2006: 63-70 |
22 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Solving Sparse Integer Linear Systems
CoRR abs/cs/0603082: (2006) |
2005 |
21 | EE | Arne Storjohann,
Gilles Villard:
Computing the rank and a small nullspace basis of a polynomial matrix.
ISSAC 2005: 309-316 |
20 | EE | Zhuliang Chen,
Arne Storjohann:
A BLAS based C library for exact linear algebra on integer matrices.
ISSAC 2005: 92-99 |
19 | EE | Arne Storjohann,
Gilles Villard:
Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix
CoRR abs/cs/0505030: (2005) |
18 | EE | Arne Storjohann:
The shifted number system for fast linear algebra on integer matrices.
J. Complexity 21(4): 609-650 (2005) |
2004 |
17 | EE | Thom Mulders,
Arne Storjohann:
Certified dense linear system solving.
J. Symb. Comput. 37(4): 485-510 (2004) |
2003 |
16 | EE | Jürgen Gerhard,
Mark Giesbrecht,
Arne Storjohann,
Eugene V. Zima:
Shiftless decomposition and polynomial-time rational summation.
ISSAC 2003: 119-126 |
15 | EE | Thom Mulders,
Arne Storjohann:
On lattice reduction for polynomial matrices.
J. Symb. Comput. 35(4): 377-401 (2003) |
14 | EE | Arne Storjohann:
High-order lifting and integrality certification.
J. Symb. Comput. 36(3-4): 613-648 (2003) |
2002 |
13 | EE | Arne Storjohann:
High-order lifting.
ISSAC 2002: 246-254 |
12 | EE | Mark Giesbrecht,
Arne Storjohann:
Computing Rational Forms of Integer Matrices.
J. Symb. Comput. 34(3): 157-172 (2002) |
2001 |
11 | EE | Mark Giesbrecht,
Michael J. Jacobson Jr.,
Arne Storjohann:
Algorithms for Large Integer Matrix Problems.
AAECC 2001: 297-307 |
10 | | Arne Storjohann:
Deterministic Computation of the Frobenius Form.
FOCS 2001: 368-377 |
2000 |
9 | EE | Thom Mulders,
Arne Storjohann:
Rational solutions of singular linear systems.
ISSAC 2000: 242-249 |
1999 |
8 | EE | Thom Mulders,
Arne Storjohann:
Diophantine Linear System Solving.
ISSAC 1999: 181-188 |
1998 |
7 | EE | Arne Storjohann,
Thom Mulders:
Fast Algorithms for for Linear Algebra Modulo N.
ESA 1998: 139-150 |
6 | EE | Arne Storjohann:
An O(n3) Algorithm for the Frobenius Normal Form.
ISSAC 1998: 101-105 |
5 | EE | Thom Mulders,
Arne Storjohann:
The Modulo N Extended GCD Problem for Polynomials.
ISSAC 1998: 105-112 |
1997 |
4 | | Arne Storjohann:
A Solution to the Extended GCD Problem with Applications.
ISSAC 1997: 109-116 |
1996 |
3 | EE | Arne Storjohann,
George Labahn:
Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices.
ISSAC 1996: 259-266 |
2 | EE | Arne Storjohann:
Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices.
ISSAC 1996: 267-274 |
1995 |
1 | EE | Arne Storjohann,
George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation.
ISSAC 1995: 119-125 |