Ideal Bases and Primary Decomposition: Case of Two Variables
Journal of Symbolic Computation
Geometry theorem proving using Hilbert's Nullstellensatz
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Buchberger's algorithm and staggered linear bases
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
On implementing Buchberger's algorithm for Grobner bases
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
Journal of Symbolic Computation
On an installation of Buchberger's algorithm
Journal of Symbolic Computation
A p-adic approach to the computation ofGröbner bases
Journal of Symbolic Computation
On the construction of Gröbner bases using syzygies
Journal of Symbolic Computation
On the computation of syzygies
ACM SIGSAM Bulletin
Computing with algebraic series
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
Automating inductionless induction using test sets
Journal of Symbolic Computation
Multi-valued logic and Gröner bases with applications to modal logic
Journal of Symbolic Computation
A heuristic selection strategy for lexicographic Gröner bases?
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Implementing an irregular application on a distributed memory multiprocessor
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A dynamic algorithm for Gröbner basis computation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Uniqueness of Solutions to Three Perspective Views of Four Points
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Exponential space computation of Gröbner bases
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Number of Solutions for Motion and Structure from Multiple FrameCorrespondence
International Journal of Computer Vision
Gröbner Bases and Systems Theory
Multidimensional Systems and Signal Processing
Fatal steps of Knuth-Bendix completion
Nordic Journal of Computing
Effects of Dynamic Task Distributions on the Performance of a Class of Irregular Computations
ICPP '97 Proceedings of the international Conference on Parallel Processing
Monomial Ideals and Planar Graphs
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Gröbner Bases: A Short Introduction for Systems Theorists
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Taylor and Lyubeznik resolutions via Gröbner bases
Journal of Symbolic Computation
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A quasi-barrier technique to improve performance of an irregular application
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Changing the ordering of Gröbner bases with LLL: case of two variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Modular algorithms for computing Gröbner bases
Journal of Symbolic Computation
A simplified proof of the characterization theorem for Gröbner-bases
ACM SIGSAM Bulletin
Some comments on the modular approach to Gröbner-bases
ACM SIGSAM Bulletin
Uniform Gröbner bases for ideals generated by polynomials with parametric exponents
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Are Buchberger's criteria necessary for the chain condition?
Journal of Symbolic Computation
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On the decoding of binary cyclic codes with the Newton identities
Journal of Symbolic Computation
Detecting unnecessary reductions in an involutive basis computation
Journal of Symbolic Computation
A MIMD implementation of the Buchberger Algorithm for Boolean polynomials
Parallel Computing
A new incremental algorithm for computing Groebner bases
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Journal of Symbolic Computation
Computing inhomogeneous Gröbner bases
Journal of Symbolic Computation
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Linear algebra to compute syzygies and Gröbner bases
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Signature-based algorithms to compute Gröbner bases
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A generalized criterion for signature related Gröbner basis algorithms
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
Applying IsRewritten criterion on Buchberger algorithm
Theoretical Computer Science
Modifying Faugère's F5 algorithm to ensure termination
ACM Communications in Computer Algebra
Gröbner bases: theory refinement in the mizar system
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
A zero-dimensional gröbner basis for AES-128
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Comprehensive involutive systems
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
On the use of Buchberger criteria in G2V algorithm for calculating Gröbner bases
Programming and Computing Software
The termination of the F5 algorithm revisited
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Efficient gröbner basis reductions for formal verification of galois field multipliers
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |