Computing ideals of points

Computation of minimal generators of ideals of fat points

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

Cited References

Computer algebra handbook

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

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

Computing zero-dimensional schemes

Journal of Symbolic Computation

Computer algebra for fingerprint matching

ICCS'03 Proceedings of the 1st international conference on Computational science: PartI

A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

Journal of Computational and Applied Mathematics

Some combinatorial applications of Gröbner bases

CAI'11 Proceedings of the 4th international conference on Algebraic informatics

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 unique representation of very strong algebraic geometry codes

Designs, Codes and Cryptography