 | 2009 |
| 11 |  | Alkiviadis G. Akritas:
Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials.
J. UCS 15(3): 523-537 (2009) |
| 2007 |
| 10 |  | Alkiviadis G. Akritas,
Gennadi I. Malaschonok:
Computations in Modules over Commutative Domains.
CASC 2007: 11-23 |
| 9 |  | Alkiviadis G. Akritas,
Adam W. Strzebonski,
Panagiotis S. Vigklas:
Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds.
CASC 2007: 24-30 |
| 8 |  | Alkiviadis G. Akritas,
Panagiotis S. Vigklas:
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials.
J. UCS 13(4): 455-467 (2007) |
| 2006 |
| 7 |  | Alkiviadis G. Akritas,
Gennadi I. Malaschonok:
Computation of the Adjoint Matrix.
International Conference on Computational Science (2) 2006: 486-489 |
| 6 |  | 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): 355-367 (2006) |
| 2005 |
| 5 |  | 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): 1129-1130 (2005) |
| 2004 |
| 4 |  | Alkiviadis G. Akritas,
Gennadi I. Malaschonok:
Applications of singular-value decomposition (SVD).
Mathematics and Computers in Simulation 67(1-2): 15-31 (2004) |
| 1983 |
| 3 |  | Alkiviadis G. Akritas,
H. Ng King:
Exact algorithms for polynomial real root approximation using continued fractions.
Computing 30(1): 63-76 (1983) |
| 2 |  | Alkiviadis G. Akritas,
S. S. Iyengar,
A. A. Rampuria:
Computationally efficient algorithms for a one-time pad scheme.
International Journal of Parallel Programming 12(4): 285-316 (1983) |
| 1979 |
| 1 |  | Alkiviadis G. Akritas:
On the Solution of Polynomial Equations Using Continued Fractions.
Inf. Process. Lett. 9(4): 182-184 (1979) |