Alkiviadis G. Akritas

Publication Activity (10 Years)

Years Active: 1976-2017
Publications (10 Years): 1

Top Topics

Matrix Representation

Top Venues

Publications

Alkiviadis G. Akritas, Gennadi I. Malaschonok
Computation of the Adjoint Matrix. CoRR (2017)
Alkiviadis G. Akritas
Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials. J. Univers. Comput. Sci. 15 (3) (2009)
Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas
Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds. CASC (2007)
Alkiviadis G. Akritas, Panagiotis S. Vigklas
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials. J. Univers. Comput. Sci. 13 (4) (2007)
Alkiviadis G. Akritas, Gennadi I. Malaschonok
Computations in Modules over Commutative Domains. CASC (2007)
Alkiviadis G. Akritas, Gennadi I. Malaschonok
Computation of the Adjoint Matrix. International Conference on Computational Science (2) (2006)
Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas
Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials. Computing 78 (4) (2006)
Ilias S. Kotsireas, Alkiviadis G. Akritas, Stanly L. Steinberg, Michael J. Wester
Foreword to the special issue on Applications of computer algebra. J. Symb. Comput. 40 (4-5) (2005)
Alkiviadis G. Akritas, Gennadi I. Malaschonok
Applications of singular-value decomposition (SVD). Math. Comput. Simul. 67 (1-2) (2004)
Alkiviadis G. Akritas, Evgenia K. Akritas, Gennadi I. Malaschonok
Matrix computation of subresultant polynomial remainder sequences in integral domains. Reliab. Comput. 1 (4) (1995)
Alkiviadis G. Akritas
Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method. Computers and Mathematics (1989)
Alkiviadis G. Akritas
A note on a paper by M. Mignotte. SIGSAM Bull. 21 (4) (1987)
Alkiviadis G. Akritas
A simple proof of the validity of the reduced prs algorithm. Computing 38 (4) (1987)
Alkiviadis G. Akritas
There is no "Uspensky's method.". SYMSAC (1986)
Alkiviadis G. Akritas, Stylianos D. Danielopoulos
A converse rule of signs for polynomials. Computing 34 (3) (1985)
Alkiviadis G. Akritas, S. S. Iyengar, A. A. Rampuria
Computationally efficient algorithms for a one-time pad scheme. Int. J. Parallel Program. 12 (4) (1983)
Alkiviadis G. Akritas, H. Ng King
Exact algorithms for polynomial real root approximation using continued fractions. Computing 30 (1) (1983)
Alkiviadis G. Akritas
Application of Vincent's Theorem in Cryptography or One-Time Pads Made Practical. Cryptologia 6 (4) (1982)
Alkiviadis G. Akritas
On the Budan-Fourier controversy. SIGSAM Bull. 15 (1) (1981)
Alkiviadis G. Akritas
The fastest exact algorithms for the isolation of the real roots of a polynomial equation. Computing 24 (4) (1980)
Alkiviadis G. Akritas, Stylianos D. Danielopoulos
On the complexity of algorithms for the translation of polynomials. Computing 24 (1) (1980)
Alkiviadis G. Akritas
A complete list of references for the paper: "a remark on the proposed syllabus for an AMS short course on computer algebra". SIGSAM Bull. 14 (3) (1980)
Alkiviadis G. Akritas
A remark on the proposed syllabus for an AMS short course on computer algebra. SIGSAM Bull. 14 (2) (1980)
Alkiviadis G. Akritas
On the Solution of Polynomial Equations Using Continued Fractions. Inf. Process. Lett. 9 (4) (1979)
Alkiviadis G. Akritas
A short note on a new method for polynomial real root isolation. SIGSAM Bull. 12 (4) (1978)
Alkiviadis G. Akritas
A new method for polynomial real root isolation. ACM-SE (1978)
George E. Collins, Alkiviadis G. Akritas
Polynomial real root isolation using Descarte's rule of signs. SYMSACC (1976)