The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Automatic Computations with Power Series
Journal of the ACM (JACM)
All Algebraic Functions Can Be Computed Fast
Journal of the ACM (JACM)
Computing with Formal Power Series
ACM Transactions on Mathematical Software (TOMS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the substitution of polynomial forms
ACM '73 Proceedings of the ACM annual conference
ACM Computing Surveys (CSUR)
Polynomial decomposition algorithms
Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay
IEEE Transactions on Computers
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Parallel distinct degree factorization algorithm
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Asymptotic expansions of exp-log functions
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Lazy multiplication of formal power series
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Approximate polynomial decomposition
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A probabilistic algorithm to test local algebraic observability in polynomial time
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Predicting zero coefficients in formal power series computations
Journal of Symbolic Computation
A probabilistic algorithm to test local algebraic observability in polynomial time
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Journal of Computational and Applied Mathematics
Journal of Symbolic Computation
A new zero-test for formal power series
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Computing power series solutions of a nonlinear PDE system
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
IEEE Transactions on Computers
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
New algorithms for relaxed multiplication
Journal of Symbolic Computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Functional decomposition of polynomials
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A simple and fast algorithm for computing exponentials of power series
Information Processing Letters
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
IBM Journal of Research and Development
Code Generation for Polynomial Multiplication
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Fast computation of special resultants
Journal of Symbolic Computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Newton's method and FFT trading
Journal of Symbolic Computation
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Almost linear time operations with triangular sets
ACM Communications in Computer Algebra
Efficient and accurate computation of upper bounds of approximation errors
Theoretical Computer Science
Root lifting techniques and applications to list decoding
ACM Communications in Computer Algebra
On the efficient generation of taylor expansions for DAE solutions by automatic differentiation
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Genus 2 point counting over prime fields
Journal of Symbolic Computation
Algebraic computation of resolvents without extraneous powers
European Journal of Combinatorics
Algorithms for combinatorial structures: Well-founded systems and Newton iterations
Journal of Combinatorial Theory Series A
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
On the complexity of computing certain resultants
ACM Communications in Computer Algebra
ACM Communications in Computer Algebra
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Guessing singular dependencies
Journal of Symbolic Computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.01 |