History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Gröbner bases of ideals given by dual bases
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A note on Nielsen reduction and coset enumeration
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Decoding Affine Variety Codes Using Gröbner Bases
Designs, Codes and Cryptography
Computation of minimal generators of ideals of fat points
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Lagrange interpolation on subgrids of tensor product grids
Mathematics of Computation
Towards a VLSI Architecture for Interpolation-Based Soft-Decision Reed-Solomon Decoders
Journal of VLSI Signal Processing Systems
Computational communicative algebra
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A robust monomial quotient basis for approximate points
ACM Communications in Computer Algebra
Computing Gröbner bases of ideals of few points in high dimensions
ACM Communications in Computer Algebra
Stable border bases for ideals of points
Journal of Symbolic Computation
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
Mathematical Methods in Computer Science
Approximate computation of zero-dimensional polynomial ideals
Journal of Symbolic Computation
Almost vanishing polynomials for sets of limited precision points
Journal of Symbolic Computation
Computing zero-dimensional schemes
Journal of Symbolic Computation
A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
Journal of Computational and Applied Mathematics
Flat families by strongly stable ideals and a generalization of Gröbner bases
Journal of Symbolic Computation
Some combinatorial applications of Gröbner bases
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
A general framework for applying FGLM techniques to linear codes
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing gröbner bases for vanishing ideals of finite sets of points
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the evaluation of multivariate polynomials over finite fields
Journal of Symbolic Computation
Simple varieties for limited precision points
Theoretical Computer Science
Representing and solving finite-domain constraint problems using systems of polynomials
Annals of Mathematics and Artificial Intelligence
On the unique representation of very strong algebraic geometry codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |