Computing special powers in finite fields: extended abstract
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Black box Frobenius decompositions over small fields
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Rational solutions of singular linear systems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Some remarks on parallel exponentiation (extended abstract)
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Unirational fields of transcendence degree one and functional decomposition
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
A linear space algorithm for computing the hermite normal form
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
A probabilistic algorithm to test local algebraic observability in polynomial time
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Factoring polynomials over local fields
Journal of Symbolic Computation
Computing rational forms of integer matrices
Journal of Symbolic Computation
On multivariate rational function decomposition
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Irreducible decomposition of curves
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Linear differential operators for polynomial equations
Journal of Symbolic Computation
Computer algebra in the life sciences
ACM SIGSAM Bulletin
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Complexity of the Minimal Polynomial
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Large Integer Matrix Problems
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
YACAS: A Do-It-Yourself Symbolic Algebra Environment
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Cryptographic Applications of Sparse Polynomials over Finite Rings
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Journal of Symbolic Computation
Theoretical Computer Science - Latin American theoretical informatics
Polynomial factorization over F2
Mathematics of Computation
An elementary approach to subresultants theory
Journal of Symbolic Computation
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Acceleration of Euclidean algorithm and extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Degree bounds and lifting techniques for triangular sets
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Linear recurrent sequences and polynomial roots
Journal of Symbolic Computation
Polynomial factorization: a success story
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factorization of differential systems in characteristic p
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Early termination over small fields
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Shiftless decomposition and polynomial-time rational summation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The reliable algorithmic software challenge RASC
Computer Science in Perspective
On lattice reduction for polynomial matrices
Journal of Symbolic Computation
Computer algebra handbook
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Efficient decomposition of separable algebras
Journal of Symbolic Computation
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Complete, exact, and efficient computations with cubic curves
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Computing zeta functions of Artin-Schreier curves over finite fields II
Journal of Complexity - Special issue on coding and cryptography
Classical and quantum function reconstruction via character evaluation
Journal of Complexity - Special issue on coding and cryptography
Factoring polynomials via polytopes
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Smith normal form of dense integer matrices fast algorithms into practice
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
How Many Bits have to be Changed to Decrease the Linear Complexity?
Designs, Codes and Cryptography
Distribution results for low-weight binary representations for pairs of integers
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Efficient data mappings for parity-declustered data layouts
Theoretical Computer Science - Special papers from: COCOON 2003
Computability in linear algebra
Theoretical Computer Science
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Essentially optimal computation of the inverse of generic polynomial matrices
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Energy-aware stage illumination
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
IEEE Transactions on Computers
Algebraic general solutions of algebraic ordinary differential equations
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Fast algorithms for polynomial solutions of linear differential equations
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Lifting techniques for triangular decompositions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Application of Wu's method to symbolic model checking
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Probabilistic algorithms for computing resultants
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Multivariate power series multiplication
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Computing the rank and a small nullspace basis of a polynomial matrix
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Analysis of linear combination algorithms in cryptography
ACM Transactions on Algorithms (TALG)
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Complexity of integer quasiconvex polynomial optimization
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the complexity of the D5 principle
ACM SIGSAM Bulletin
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
On the Number of Optimal Base 2 Representations of Integers
Designs, Codes and Cryptography
A displacement approach to decoding algebraic codes
Contemporary mathematics
Low complexity algorithms for linear recurrences
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Implementation techniques for fast polynomial arithmetic in a high-level programming environment
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Faà di Bruno's formula, lattices, and partitions
Discrete Applied Mathematics
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
IEEE Transactions on Computers
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Discrete Applied Mathematics - Special issue: Coding and cryptography
Structured matrices in the application of bivariate interpolation to curve implicitization
Mathematics and Computers in Simulation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Jebelean--Weber's algorithm without spurious factors
Information Processing Letters
Output-sensitive modular algorithms for polynomial matrix normal forms
Journal of Symbolic Computation
Computing monodromy groups defined by plane algebraic curves
Proceedings of the 2007 international workshop on Symbolic-numeric computation
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: from theory to practice
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Some recent progress in exact linear algebra and related questions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Multithreaded parallel implementation of arithmetic operations modulo a triangular set
Proceedings of the 2007 international workshop on Parallel symbolic computation
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
Change of order for regular chains in positive dimension
Theoretical Computer Science
On the resultant of degree-deficient polynomials
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Rational solutions of ordinary difference equations
Journal of Symbolic Computation
Rational Univariate Reduction via toric resultants
Journal of Symbolic Computation
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
A parallel extended GCD algorithm
Journal of Discrete Algorithms
Improving the topology computation of an arrangement of cubics
Computational Geometry: Theory and Applications
On the Virtues of Generic Programming for Symbolic Computation
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Towards Mathematical Knowledge Management for Electrical Engineering
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Montgomery Residue Representation Fault-Tolerant Computation in GF(2k)
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Symbolic Computation Software Composability
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Topology and arrangement computation of semi-algebraic planar curves
Computer Aided Geometric Design
ACM Transactions on Computational Logic (TOCL)
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Theory of Quantum Computation, Communication, and Cryptography
On the representation of constructible sets
ACM Communications in Computer Algebra
The modpn library: bringing fast polynomial arithmetic into MAPLE
ACM Communications in Computer Algebra
On the Check of Accuracy of the Coefficients of Formal Power Series
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fast arithmetic for triangular sets: From theory to practice
Journal of Symbolic Computation
Journal of Symbolic Computation
A simple and fast algorithm for computing exponentials of power series
Information Processing Letters
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science
Chebyshev expansions for solutions of linear differential equations
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fast arithmetics in artin-schreier towers over finite fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On finding multiplicities of characteristic polynomial factors of black-box matrices
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The number of decomposable univariate polynomials. extended abstract
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
Using symmetries in the eigenvalue method for polynomial systems
Journal of Symbolic Computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
Efficient Multiplication of Polynomials on Graphics Hardware
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Computing differential characteristic sets by change of ordering
Journal of Symbolic Computation
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Note: Faá di Bruno's formula, lattices, and partitions
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: Coding and cryptography
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Complexity of integer quasiconvex polynomial optimization
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation
Fast computation of special resultants
Journal of Symbolic Computation
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
Journal of Symbolic Computation
An algorithm to solve integer linear systems exactly using numerical methods
Journal of Symbolic Computation
Uniform approximations for transcendental functions
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Efficient mappings for parity-declustered data layouts
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Homotopy methods for equations over finite fields
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Fast decomposition of polynomials with known Galois group
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Multi-variate polynomials and Newton-Puiseux expansions
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Fault-tolerant finite field computation in the public key cryptosystems
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Explicit formulas for efficient multiplication in F36m
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Computing Hilbert class polynomials
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Computing zeta functions in families of Ca,bcurves using deformation
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Generic design of Chinese remaindering schemes
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Exact sparse matrix-vector multiplication on GPU's and multicore architectures
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Cache-oblivious polygon indecomposability testing
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Output-sensitive decoding for redundant residue systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Computing isolated roots of sparse polynomial systems in affine space
Theoretical Computer Science
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Efficient evaluation of large polynomials
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On duplication in mathematical repositories
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
The orbit problem is in the GapL hierarchy
Journal of Combinatorial Optimization
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
A note on Gao's algorithm for polynomial factorization
Theoretical Computer Science
An algebraic approach to continuous collision detection for ellipsoids
Computer Aided Geometric Design
Journal of Symbolic Computation
Polynomial algebra for Birkhoff interpolants
Numerical Algorithms
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Journal of Symbolic Computation
Simultaneous modular reduction and Kronecker substitution for small finite fields
Journal of Symbolic Computation
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing
An alternative class of irreducible polynomials for optimal extension fields
Designs, Codes and Cryptography
An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)a
Quantum Information & Computation
Rounding coefficients and artificially underflowing terms in non-numeric expressions
ACM Communications in Computer Algebra
Solving bivariate polynomial systems on a GPU
ACM Communications in Computer Algebra
An algorithm for computing a basis of a finite abelian group
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Linear time algorithms for the basis of abelian groups
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Redundancy of minimal weight expansions in Pisot bases
Theoretical Computer Science
Practical divide-and-conquer algorithms for polynomial arithmetic
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Homotopy techniques for multiplication modulo triangular sets
Journal of Symbolic Computation
Good reduction of Puiseux series and applications
Journal of Symbolic Computation
Bit-size estimates for triangular sets in positive dimension
Journal of Complexity
A revocation scheme preserving privacy
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Sparser Johnson-Lindenstrauss transforms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Constructing high order elements through subspace polynomials
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Interpolation of functions related to the integer factoring problem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Efficient implementation of polynomial arithmetic in a multiple-level programming environment
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Quadratic lower bounds on matrix rigidity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
FFT-based dense polynomial arithmetic on multi-cores
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Gradual sub-lattice reduction and a new complexity for factoring polynomials
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Automorphisms of finite rings and applications to complexity of problems
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact computation of polynomial zeros expressible by square roots
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computing curves bounding trigonometric planar maps: symbolic and hybrid methods
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Genus 2 point counting over prime fields
Journal of Symbolic Computation
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Fully homomorphic encryption with relatively small key and ciphertext sizes
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Implicitization of rational curves
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Hierarchical representations with signatures for large expression management
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Construction of explicit runge-kutta pairs with stiffness detection
Mathematical and Computer Modelling: An International Journal
Parameter choices on Guruswami--Sudan algorithm for polynomial reconstruction
Finite Fields and Their Applications
Finite Fields and Their Applications
Finite Fields and Their Applications
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
Square root algorithms for the number field sieve
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Decidability of geometricity of regular languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Trapdoor permutation polynomials of Z/nZ and public key cryptosystems
ISC'07 Proceedings of the 10th international conference on Information Security
Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Usage of modular techniques for efficient computation of ideal operations
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Affine solution sets of sparse polynomial systems
Journal of Symbolic Computation
Real closures of models of weak arithmetic
Archive for Mathematical Logic
Computing closed form solutions of integrable connections
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Power series solutions of singular (q)-differential equations
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Finding hyperexponential solutions of linear ODEs by numerical evaluation
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
From approximate factorization to root isolation
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
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
Fast algorithms for l-adic towers over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Programming and Computing Software
Journal of the ACM (JACM)
Efficient sampling of non-strict turnstile data streams
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
Sparser Johnson-Lindenstrauss Transforms
Journal of the ACM (JACM)
A novel fast hybrid GCD computation algorithm
International Journal of Computing Science and Mathematics
| Hi-index | 0.02 |