Hermite canonical form and Smith canonical form of a matrix over a principal ideal domain
ACM SIGSAM Bulletin - Issue #93
Computation of the Smith normal form of polynomial matrices
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A solution to the extended gcd problem
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Factoring modular polynomials (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of Hermite normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Near optimal algorithms for computing Smith normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
A solution to the extended GCD problem with applications
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Asymptotically fast triangulation of matrices over rings
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A linear space algorithm for computing the hermite normal form
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Large Integer Matrix Problems
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Declarative definition of group indexed data structures and approximation of their domains
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Computer algebra handbook
Smith normal form of dense integer matrices fast algorithms into practice
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
Theoretical Computer Science
A tool for integer homology computation: λ-AT-model
Image and Vision Computing
Normal forms for general polynomial matrices
Journal of Symbolic Computation
Extending the notion of AT-model for integer homology computation
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Computing hermite forms of polynomial matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
An algorithm for computing a basis of a finite abelian group
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Linear time algorithms for the basis of abelian groups
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the use of gröbner bases for computing the structure of finite abelian groups
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |