Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
Time-and space-efficient evaluation of some hypergeometric constants
Proceedings of the 2007 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
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Fault attacks on projective-to-affine coordinates conversion
COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design
| Hi-index | 0.00 |
We accelerate the known algorithms for computing a selected entry of the extended Euclidean algorithm for integers and, consequently, for the modular and numerical rational number reconstruction problems. The acceleration is from quadratic to nearly linear time, matching the known complexity bound for the integer gcd, which our algorithm computes as a special case.