Author of the publication

Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials.

, , and . SNC, page 105-114. ACM, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Accelerated approximation of the complex roots and factors of a univariate polynomial., and . Theor. Comput. Sci., (2017)Real polynomial root-finding by means of matrix and polynomial iterations., and . Theor. Comput. Sci., (2017)Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem., and . SODA, page 384-393. ACM/SIAM, (1991)New Techniques for Approximating Complex Polynomial Zeros.. SODA, page 260-270. ACM/SIAM, (1994)On the boolean complexity of real root refinement., and . ISSAC, page 299-306. ACM, (2013)Randomized preconditioning of the MBA algorithm., , and . ISSAC, page 281-288. ACM, (2011)How to Multiply Matrices Faster. Lecture Notes in Computer Science Springer, (1984)Inversion of Displacement Operators., and . SIAM J. Matrix Anal. Appl., 24 (3): 660-677 (2003)Solving a Polynomial Equation: Some History and Recent Progress.. SIAM Rev., 39 (2): 187-220 (1997)New Resultant Inequalities and Complex Polynomial Factorization.. ISTCS, volume 601 of Lecture Notes in Computer Science, page 122-136. Springer, (1992)