Arne Storjohann

ACM Trans. Algorithms, October, 2023

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix.

[BibT_eX]

[DOI]

J. Symb. Comput., 2023

2022

Computing a Basis for an Integer Lattice: A Special Case.

[BibT_eX]

[DOI]

Haomin Li

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Algorithms for simultaneous Hermite-Padé approximations.

[BibT_eX]

[DOI]

Johan Rosenkilde

J. Symb. Comput., 2021

2020

A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Time and space efficient generators for quasiseparable matrices.

[BibT_eX]

[DOI]

Clément Pernet

J. Symb. Comput., 2018

2017

Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE Symposium on Reliable Distributed Systems, 2017

Popov Form Computation for Matrices of Ore Polynomials.

[BibT_eX]

[DOI]

Mohamed Khochtali

Johan Rosenkilde

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Abstracts of the 2015 east coast computer algebra day.

[BibT_eX]

[DOI]

Silvana Ilie

Johan Sebastian Rosenkilde

ACM Commun. Comput. Algebra, 2016

Algorithms for Simultaneous Padé Approximations.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

A deterministic algorithm for inverting a polynomial matrix.

[BibT_eX]

[DOI]

Wei Zhou

J. Complex., 2015

On the complexity of inverting integer and polynomial matrices.

[BibT_eX]

[DOI]

Comput. Complex., 2015

2014

A Relaxed Algorithm for Online Matrix Inversion.

[BibT_eX]

[DOI]

Shiyun Yang

ACM Commun. Comput. Algebra, 2014

Linear independence oracles and applications to rectangular and low rank linear systems.

[BibT_eX]

[DOI]

Shiyun Yang

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Rank-profile revealing Gaussian elimination and the CUP matrix decomposition.

[BibT_eX]

[DOI]

Claude-Pierre Jeannerod

Clément Pernet

J. Symb. Comput., 2013

Computing the invariant structure of integer matrices: fast algorithms into practice.

[BibT_eX]

[DOI]

Colton Pauderis

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x].

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Computing minimal nullspace bases.

[BibT_eX]

[DOI]

Wei Zhou

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Deterministic unimodularity certification.

[BibT_eX]

[DOI]

Colton Pauderis

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Normalization of row reduced matrices.

[BibT_eX]

[DOI]

Soumojit Sarkar

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Computing hermite forms of polynomial matrices.

[BibT_eX]

[DOI]

Somit Gupta

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Vector rational number reconstruction.

[BibT_eX]

[DOI]

Curtis Bright

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Nullspace computation over rational function fields for symbolic summation.

[BibT_eX]

[DOI]

Burçin Eröcal

ACM Commun. Comput. Algebra, 2010

2009

Integer matrix rank certification.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2007

Faster algorithms for the characteristic polynomial.

[BibT_eX]

[DOI]

Clément Pernet

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Faster inversion and other black box matrix computations using efficient block projections.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Solving Sparse Integer Linear Systems

[BibT_eX]

[DOI]

CoRR, 2006

Solving sparse rational linear systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Notes on computing minimal approximant bases.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005

The shifted number system for fast linear algebra on integer matrices.

[BibT_eX]

[DOI]

J. Complex., 2005

Computing the rank and a small nullspace basis of a polynomial matrix.

[BibT_eX]

[DOI]

Gilles Villard

Proceedings of the Symbolic and Algebraic Computation, 2005

A BLAS based C library for exact linear algebra on integer matrices.

[BibT_eX]

[DOI]

Zhuliang Chen

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Certified dense linear system solving.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

2003

High-order lifting and integrality certification.

[BibT_eX]

[DOI]

J. Symb. Comput., 2003

On lattice reduction for polynomial matrices.

[BibT_eX]

[DOI]

J. Symb. Comput., 2003

Shiftless decomposition and polynomial-time rational summation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Computing Rational Forms of Integer Matrices.

[BibT_eX]

[DOI]

Mark Giesbrecht

J. Symb. Comput., 2002

High-order lifting.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Deterministic Computation of the Frobenius Form.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Algorithms for Large Integer Matrix Problems.

[BibT_eX]

[DOI]

Mark Giesbrecht

Michael J. Jacobson Jr.

Proceedings of the Applied Algebra, 2001

2000

Rational solutions of singular linear systems.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999

Diophantine Linear System Solving.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

An O(n3) Algorithm for the Frobenius Normal Form.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

The Modulo N Extended GCD Problem for Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

Fast Algorithms for for Linear Algebra Modulo N.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

A Solution to the Extended GCD Problem with Applications.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996

Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation.

[BibT_eX]

[DOI]