Alkiviadis G. Akritas

发表

Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials

Alkiviadis G. Akritas, A. Akritas, 2009, J. Univers. Comput. Sci..

Applications of singular-value decomposition (SVD)

Alkiviadis G. Akritas, Gennadi I. Malaschonok, 2004, Math. Comput. Simul..

A remark on the proposed syllabus for an AMS short course on computer algebra

Alkiviadis G. Akritas, 1980, SIGS.

The fastest exact algorithms for the isolation of the real roots of a polynomial equation

Alkiviadis G. Akritas, A. Akritas, 1980, Computing.

Exact algorithms for polynomial real root approximation using continued fractions

Alkiviadis G. Akritas, H. Ng King, A. Akritas, 1983, Computing.

Polynomial real root isolation using Descarte's rule of signs

Alkiviadis G. Akritas, George E. Collins, G. E. Collins, 1976, SYMSAC '76.

Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials

Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas, 2006, Computing.

A note on a paper by M. Mignotte

Alkiviadis G. Akritas, 1987, SIGS.

Computationally efficient algorithms for a one-time pad scheme

S. S. Iyengar, Alkiviadis G. Akritas, A. A. Rampuria, 2004, International Journal of Computer & Information Sciences.

A new method for polynomial real root isolation

Alkiviadis G. Akritas, 1978, ACM-SE 16.

On the Budan-Fourier controversy

Alkiviadis G. Akritas, 1981, SIGS.

There is no “Uspensky's method.”

Alkiviadis G. Akritas, A. Akritas, 1986, SYMSAC '86.

A simple proof of the validity of the reduced prs algorithm

Alkiviadis G. Akritas, A. Akritas, 1987, Computing.

Implementation of real root isolation algorithms in Mathematica

Alkiviadis G. Akritas, A. V. Bocharov, Adam Strzebonski, 1994 .

Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds

Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas, 2007, CASC.

A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials

Alkiviadis G. Akritas, Panagiotis S. Vigklas, 2007, J. Univers. Comput. Sci..

A complete list of references for the paper: "a remark on the proposed syllabus for an AMS short course on computer algebra"

Alkiviadis G. Akritas, 1980, SIGS.

A Comparative Study of Two Real Root Isolation Methods

Alkiviadis G. Akritas, Adam Strzebonski, A. Strzebonski, 2005 .

A converse rule of signs for polynomials

Alkiviadis G. Akritas, Stylianos D. Danielopoulos, 2005, Computing.

Matrix computation of subresultant polynomial remainder sequences in integral domains

Alkiviadis G. Akritas, Gennadi I. Malaschonok, Evgenia K. Akritas, 1995, Reliab. Comput..

Computation of the Adjoint Matrix pdf

Alkiviadis G. Akritas, Gennadi I. Malaschonok, A. Akritas, 2006, International Conference on Computational Science.

Foreword to the special issue on Applications of computer algebra

Ilias S. Kotsireas, Alkiviadis G. Akritas, Michael J. Wester, 2005, J. Symb. Comput..

Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method

Alkiviadis G. Akritas, 1989, Computers and Mathematics.

On the complexity of algorithms for the translation of polynomials

Alkiviadis G. Akritas, Stylianos D. Danielopoulos, A. Akritas, 1980, Computing.

On the Solution of Polynomial Equations Using Continued Fractions

Alkiviadis G. Akritas, 1979, Inf. Process. Lett..

Computations in Modules over Commutative Domains

Alkiviadis G. Akritas, Gennadi I. Malaschonok, A. Akritas, 2007, CASC.

Polynomial real root approximation using continued fractions

Alkiviadis G. Akritas, King N. Ng, 1983 .

Exact algorithms for the implementation of cauchy's rule

Alkiviadis G. Akritas, A. Akritas, 1981 .

STURM SEQUENCES AND MODIFIED SUBRESULTANT POLYNOMIAL REMAINDER SEQUENCES

Alkiviadis G. Akritas, Gennadi I. Malaschonok, Panagiotis S. Vigklas, 2014 .

Sylvester’s form of the Resultant and the Matrix-Triangularization Subresultant PRS Method

Alkiviadis G. Akritas, 1991 .

A Correction on a Theorem By Uspensky

Alkiviadis G. Akritas, 1978 .

On the forgotten theorem of Mr. Vincent

Alkiviadis G. Akritas, Stylianos D. Danielopoulos, 1978 .

A new method for computing polynomial greates common divisors and polynomial remainder sequences

Alkiviadis G. Akritas, 1988 .

Reflections on a Pair of Theorems by Budan and Fourier

Alkiviadis G. Akritas, 1982 .

Elements of Computer Algebra with Applications

Alkiviadis G. Akritas, A. Akritas, 1989 .

Vincent’s theorem of 1836: overview and future research

Alkiviadis G. Akritas, A. Akritas, 2010 .

The SVD-Fundamental Theorem of Linear Algebra

Alkiviadis G. Akritas, Gennadi I. Malaschonok, Panagiotis S. Vigklas, 2006 .

Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots

Alkiviadis G. Akritas, Panagiotis S. Vigklas, Adam Strzebonski, 2008 .

An implementation of Vincent's theorem

Alkiviadis G. Akritas, A. Akritas, 1980 .