On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
On the theory of graded structures
Journal of Symbolic Computation
A superexponential lower bound for Gro¨bner bases and church-Rosser Commutative Thue systems
Information and Control
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Complexity of parallel matrix computations
Theoretical Computer Science
Parallel evaluation of the determinant and of the inverse of a matrix
Information Processing Letters
Constructing universal Groebner bases
Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The structure of polynomial ideals and Grobner bases
SIAM Journal on Computing
On the intrinsic complexity of elimination theory
Journal of Complexity - Special issue: invited articles dedicated to J. F. Traub on the occasion of his 60th birthday
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Some New Effectivity Bounds in Computational Geometry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Upper and Lower Bounds for the Degree of Groebner Bases
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A note on the complexity of constructing Gröbner-Bases
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Term Orderings on the Polynominal Ring
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
On Polynomial Ideals, Their Complexity, and Applications
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Groebner bases computation in Boolean rings for symbolic model checking
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
Mathematical Methods in Computer Science
Groebner bases computation in Boolean rings for symbolic model checking
MS '07 The 18th IASTED International Conference on Modelling and Simulation
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Space-efficient Gröbner basis computation without degree bounds
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Approaches to modeling business processes: a critical analysis of BPMN, workflow patterns and YAWL
Software and Systems Modeling (SoSyM)
Dimension-dependent bounds for Gröbner bases of polynomial ideals
Journal of Symbolic Computation
| Hi-index | 0.00 |