Polynomial real root isolation using Descarte's rule of signs. - George E. Collins; Alkiviadis G. Akritas (SYMSACC, 1976)

A new method for polynomial real root isolation. - Alkiviadis G. Akritas (ACM-SE, 1978)

A short note on a new method for polynomial real root isolation. - Alkiviadis G. Akritas (SIGSAM Bull., 1978)

On the Solution of Polynomial Equations Using Continued Fractions. - Alkiviadis G. Akritas (Inf. Process. Lett., 1979)

A remark on the proposed syllabus for an AMS short course on computer algebra. - Alkiviadis G. Akritas (SIGSAM Bull., 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)

The fastest exact algorithms for the isolation of the real roots of a polynomial equation. - Alkiviadis G. Akritas (Computing, 1980)

On the complexity of algorithms for the translation of polynomials. - Alkiviadis G. Akritas; Stylianos D. Danielopoulos (Computing, 1980)

On the Budan-Fourier controversy. - Alkiviadis G. Akritas (SIGSAM Bull., 1981)

Application of Vincent's Theorem in Cryptography or One-Time Pads Made Practical. - Alkiviadis G. Akritas (Cryptologia, 1982)

Exact algorithms for polynomial real root approximation using continued fractions. - Alkiviadis G. Akritas; H. Ng King (Computing, 1983)

Computationally efficient algorithms for a one-time pad scheme. - Alkiviadis G. Akritas; S. S. Iyengar 001; A. A. Rampuria (Int. J. Parallel Program., 1983)

A converse rule of signs for polynomials. - Alkiviadis G. Akritas; Stylianos D. Danielopoulos (Computing, 1985)

There is no "Uspensky's method.". - Alkiviadis G. Akritas (SYMSAC, 1986)

A note on a paper by M. Mignotte. - Alkiviadis G. Akritas (SIGSAM Bull., 1987)

A simple proof of the validity of the reduced prs algorithm. - Alkiviadis G. Akritas (Computing, 1987)

Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method. - Alkiviadis G. Akritas (Computers and Mathematics, 1989)

Matrix computation of subresultant polynomial remainder sequences in integral domains. - Alkiviadis G. Akritas; Evgenia K. Akritas; Gennadi I. Malaschonok (Reliab. Comput., 1995)

Applications of singular-value decomposition (SVD). - Alkiviadis G. Akritas; Gennadi I. Malaschonok (Math. Comput. Simul., 2004)

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)

Computation of the Adjoint Matrix. - Alkiviadis G. Akritas; Gennadi I. Malaschonok (International Conference on Computational Science (2), 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)

Computations in Modules over Commutative Domains. - Alkiviadis G. Akritas; Gennadi I. Malaschonok (CASC, 2007)

Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds. - Alkiviadis G. Akritas; Adam W. Strzebonski; Panagiotis S. Vigklas (CASC, 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)

Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials. - Alkiviadis G. Akritas (J. Univers. Comput. Sci., 2009)