Alkiviadis G. Akritas

According to our database, Alkiviadis G. Akritas authored at least 26 papers between 1976 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

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

Alkiviadis G. Akritas

J. Univers. Comput. Sci., 2009

2007

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

Alkiviadis G. Akritas, Panagiotis S. Vigklas

J. Univers. Comput. Sci., 2007

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

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

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

Computations in Modules over Commutative Domains.

Alkiviadis G. Akritas, Gennadi I. Malaschonok

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006

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

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

Computing, 2006

Computation of the Adjoint Matrix.

Alkiviadis G. Akritas, Gennadi I. Malaschonok

Proceedings of the Computational Science, 2006

2005

Foreword to the special issue on Applications of computer algebra.

Ilias S. Kotsireas, Alkiviadis G. Akritas, Stanly L. Steinberg, Michael J. Wester

J. Symb. Comput., 2005

2004

Applications of singular-value decomposition (SVD).

Alkiviadis G. Akritas, Gennadi I. Malaschonok

Math. Comput. Simul., 2004

1995

Matrix computation of subresultant polynomial remainder sequences in integral domains.

Alkiviadis G. Akritas, Evgenia K. Akritas, Gennadi I. Malaschonok

Reliab. Comput., 1995

1989

Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method.

Alkiviadis G. Akritas

Proceedings of the Computers and Mathematics, 1989

1987

A simple proof of the validity of the reduced prs algorithm.

Alkiviadis G. Akritas

Computing, 1987

A note on a paper by M. Mignotte.

Alkiviadis G. Akritas

SIGSAM Bull., 1987

1986

There is no "Uspensky's method.".

Alkiviadis G. Akritas

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

1985

A converse rule of signs for polynomials.

Alkiviadis G. Akritas, Stylianos D. Danielopoulos

Computing, 1985

1983

Computationally efficient algorithms for a one-time pad scheme.

Alkiviadis G. Akritas, S. S. Iyengar, A. A. Rampuria

Int. J. Parallel Program., 1983

Exact algorithms for polynomial real root approximation using continued fractions.

Alkiviadis G. Akritas, H. Ng King

Computing, 1983

1982

Application of Vincent's Theorem in Cryptography or One-Time Pads Made Practical.

Alkiviadis G. Akritas

Cryptologia, 1982

1981

On the Budan-Fourier controversy.

Alkiviadis G. Akritas

SIGSAM Bull., 1981

1980

On the complexity of algorithms for the translation of polynomials.

Alkiviadis G. Akritas, Stylianos D. Danielopoulos

Computing, 1980

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

Alkiviadis G. Akritas

Computing, 1980

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

SIGSAM Bull., 1980

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

Alkiviadis G. Akritas

SIGSAM Bull., 1980

1979

On the Solution of Polynomial Equations Using Continued Fractions.

Alkiviadis G. Akritas

Inf. Process. Lett., 1979

1978

A short note on a new method for polynomial real root isolation.

Alkiviadis G. Akritas

SIGSAM Bull., 1978

A new method for polynomial real root isolation.

Alkiviadis G. Akritas

Proceedings of the 16th Annual Southeast Regional Conference, 1978

1976

Polynomial real root isolation using Descarte's rule of signs.

George E. Collins, Alkiviadis G. Akritas

Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976