The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
Understanding expression simplification
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
User interface design with matrix algebra
ACM Transactions on Computer-Human Interaction (TOCHI)
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel
IEEE Transactions on Computers
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Deterministic equation solving over finite fields
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A block Wiedemann rank algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Surface parametrisation without diagonalisation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Unique factorization in ACL2: Euclidean domains
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Fast algorithms for computing Jones polynomials of certain links
Theoretical Computer Science
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Complexity of Ring Morphism Problems
Computational Complexity
Recognizing and parametrizing curves isomorphic to a line
Journal of Symbolic Computation
Differential equations for algebraic functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Optimal routing in double loop networks
Theoretical Computer Science
Fixed points in discrete models for regulatory genetic networks
EURASIP Journal on Bioinformatics and Systems Biology
Foundations and Trends® in Networking
Computational complexity of sentences over fields
Information and Computation
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Multi-modular algorithm for computing the splitting field of a polynomial
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Efficient Disjointness Tests for Private Datasets
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Towards an Implementation of a Computer Algebra System in a Functional Language
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Computing Omega-Limit Sets in Linear Dynamical Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Solving structured linear systems with large displacement rank
Theoretical Computer Science
Complexity analysis of Reed-Solomon decoding over GF(2m) without using syndromes
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Unconditionally secure disjointness tests for private datasets
International Journal of Applied Cryptography
The Optimal H∞ Norm of a Parametric System Achievable Using a Static Feedback Controller
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Fast arithmetics using Chinese remaindering
Information Processing Letters
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
Quasi-quadratic elliptic curve point counting using rigid cohomology
Journal of Symbolic Computation
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Algorithms for near solutions to polynomial equations
Journal of Symbolic Computation
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Space- and time-efficient polynomial multiplication
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Integer matrix rank certification
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
A stopping radius for the sphere decoder and its application to MSDD of DPSK
IEEE Communications Letters
Code Generation for Polynomial Multiplication
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
On Computing the Hermite Form of a Matrix of Differential Polynomials
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Computing Multidimensional Persistence
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast encoding and decoding of Gabidulin codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Validated numerical computation of the L∞-norm for linear dynamical systems
Journal of Symbolic Computation
When stream cipher analysis meets public-key cryptography
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On computation of Boolean involutive bases
Programming and Computing Software
An authentication scheme based on the twisted conjugacy problem
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
An improved multi-set algorithm for the dense subset sum problem
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Approximate polynomial gcd: small degree and small height perturbations
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Speeding-up lattice reduction with random projections
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Key equations for list decoding of Reed-Solomon codes and how to solve them
Journal of Symbolic Computation
A quantitative study of reductions in algebraic libraries
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Asymptotically fast algorithms for modern computer algebra
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Complexity of creative telescoping for bivariate rational functions
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing specified generators of structured matrix inverses
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On some decidable and undecidable problems related to q-difference equations with parameters
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
An in-place truncated fourier transform and applications to polynomial multiplication
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
A local decision test for sparse polynomials
Information Processing Letters
Modular Las Vegas algorithms for polynomial absolute factorization
Journal of Symbolic Computation
A lifting and recombination algorithm for rational factorization of sparse polynomials
Journal of Complexity
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Factorization of polynomials and GCD computations for finding universal denominators
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Implementing data parallel rational multiple-residue arithmetic in eden
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Additive fast Fourier transforms over finite fields
IEEE Transactions on Information Theory
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Proceedings of the first ACM conference on Data and application security and privacy
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
Unconditionally secure first-price auction protocols using a multicomponent commitment scheme
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Vector rational number reconstruction
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Practical polynomial factoring in polynomial time
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Fast fourier transforms over poor fields
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Normalization of row reduced matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Numeric-symbolic exact rational linear system solver
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Making NTRU as secure as worst-case problems over ideal lattices
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Efficient quantum algorithm for identifying hidden polynomials
Quantum Information & Computation
Fast computation of common left multiples of linear ordinary differential operators
ACM Communications in Computer Algebra
Faster polynomial multiplication via discrete fourier transforms
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Efficient multiplication in finite field extensions of degree 5
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Acceleration of the inversion of triangular Toeplitz matrices and polynomial division
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Cryptanalysis of RSA with small prime combination
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Extension of Barreto-Voloch root extraction method
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Pseudorandomness and Dynamics of Fermat Quotients
SIAM Journal on Discrete Mathematics
Predicting subset sum pseudorandom generators
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Computing the distance between piecewise-linear bivariate functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On degrees of polynomial interpolations related to elliptic curve cryptography
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A modular method for computing the splitting field of a polynomial
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
The complexity of black-box ring problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
The complexity of reachability in randomized sabotage games
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Non-linear polynomial selection for the number field sieve
Journal of Symbolic Computation
Approximate GCD of several univariate polynomials with small degree perturbations
Journal of Symbolic Computation
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]
Journal of Symbolic Computation
Algebraic cryptanalysis of the PKC’2009 algebraic surface cryptosystem
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Efficient polynomial operations in the shared-coefficients setting
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Proving the security of AES substitution-permutation network
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Efficient FPGA-based karatsuba multipliers for polynomials over F2
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Efficient algorithms for order basis computation
Journal of Symbolic Computation
Simplified high-speed high-distance list decoding for alternant codes
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
On the isotopic meshing of an algebraic implicit surface
Journal of Symbolic Computation
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rigorous polynomial approximation using taylor models in Coq
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Fast arithmetic in unramified p-adic fields
Finite Fields and Their Applications
Computing the modular inverses is as simple as computing the GCDs
Finite Fields and Their Applications
Counting reducible and singular bivariate polynomials
Finite Fields and Their Applications
Arrangement computation for planar algebraic curves
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Efficient multiplication over extension fields
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Improving the berlekamp algorithm for binomials xn-a
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On fast division algorithm for polynomials using newton iteration
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
A note on the space complexity of fast D-finite function evaluation
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Adleman-Manders-Miller root extraction method revisited
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Extracting sparse factors from multivariate integral polynomials
Journal of Symbolic Computation
Relaxed p-adic Hensel lifting for algebraic systems
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Fast computation of common left multiples of linear ordinary differential operators
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
On the complexity of multivariate blockwise polynomial multiplication
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Algorithms for the universal decomposition algebra
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Deterministic unimodularity certification
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Computing minimal nullspace bases
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Multiple GCDs. probabilistic analysis of the plain algorithm
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Separating linear forms for bivariate systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Creative telescoping for rational functions using the griffiths: dwork method
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Computing column bases of polynomial matrices
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
A new truncated fourier transform algorithm
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Factoring bivariate polynomials using adjoints
Journal of Symbolic Computation
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Guessing singular dependencies
Journal of Symbolic Computation
Probabilistic equivalence verification approach for automatic mathematical solution assessment
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Faster arithmetic for number-theoretic transforms
Journal of Symbolic Computation
Testing set proportionality and the Ádám isomorphism of circulant graphs
Journal of Discrete Algorithms
Journal of Symbolic Computation
| Hi-index | 0.07 |
From the Publisher:"Computer algebra systems are gaining more and more importance in all areas of science and engineering. This textbook gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems." It is designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics. Its comprehensiveness and authority make it also an essential reference for professionals in the area.