Alkiviadis G. Akritas

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