default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlkiviadis G. Akritas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j19]Alkiviadis G. Akritas:
Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials. J. Univers. Comput. Sci. 15(3): 523-537 (2009)- 2007
- [j18]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): 455-467 (2007) - 2006
- [j17]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
- [j16]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
- [j15]Alkiviadis G. Akritas, Gennadi I. Malaschonok:
Applications of singular-value decomposition (SVD). Math. Comput. Simul. 67(1-2): 15-31 (2004) - 1995
- [j14]Alkiviadis G. Akritas, Evgenia K. Akritas, Gennadi I. Malaschonok:
Matrix computation of subresultant polynomial remainder sequences in integral domains. Reliab. Comput. 1(4): 375-381 (1995) - 1987
- [j13]Alkiviadis G. Akritas:
A note on a paper by M. Mignotte. SIGSAM Bull. 21(4): 23 (1987) - [j12]Alkiviadis G. Akritas:
A simple proof of the validity of the reduced prs algorithm. Computing 38(4): 369-372 (1987) - 1985
- [j11]Alkiviadis G. Akritas, Stylianos D. Danielopoulos:
A converse rule of signs for polynomials. Computing 34(3): 283-286 (1985) - 1983
- [j10]Alkiviadis G. Akritas, H. Ng King:
Exact algorithms for polynomial real root approximation using continued fractions. Computing 30(1): 63-76 (1983) - [j9]Alkiviadis G. Akritas, S. S. Iyengar, A. A. Rampuria:
Computationally efficient algorithms for a one-time pad scheme. Int. J. Parallel Program. 12(4): 285-316 (1983) - 1982
- [j8]Alkiviadis G. Akritas:
Application of Vincent's Theorem in Cryptography or One-Time Pads Made Practical. Cryptologia 6(4): 312-318 (1982) - 1981
- [j7]Alkiviadis G. Akritas:
On the Budan-Fourier controversy. SIGSAM Bull. 15(1): 8-10 (1981) - 1980
- [j6]Alkiviadis G. Akritas:
A remark on the proposed syllabus for an AMS short course on computer algebra. SIGSAM Bull. 14(2): 24-25 (1980) - [j5]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): 32 (1980) - [j4]Alkiviadis G. Akritas, Stylianos D. Danielopoulos:
On the complexity of algorithms for the translation of polynomials. Computing 24(1): 51-60 (1980) - [j3]Alkiviadis G. Akritas:
The fastest exact algorithms for the isolation of the real roots of a polynomial equation. Computing 24(4): 299-313 (1980) - 1979
- [j2]Alkiviadis G. Akritas:
On the Solution of Polynomial Equations Using Continued Fractions. Inf. Process. Lett. 9(4): 182-184 (1979) - 1978
- [j1]Alkiviadis G. Akritas:
A short note on a new method for polynomial real root isolation. SIGSAM Bull. 12(4): 12-13 (1978)
Conference and Workshop Papers
- 2007
- [c7]Alkiviadis G. Akritas, Gennadi I. Malaschonok:
Computations in Modules over Commutative Domains. CASC 2007: 11-23 - [c6]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 - 2006
- [c5]Alkiviadis G. Akritas, Gennadi I. Malaschonok:
Computation of the Adjoint Matrix. International Conference on Computational Science (2) 2006: 486-489 - 1989
- [c4]Alkiviadis G. Akritas:
Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method. Computers and Mathematics 1989: 145-155 - 1986
- [c3]Alkiviadis G. Akritas:
There is no "Uspensky's method.". SYMSAC 1986: 88-90 - 1978
- [c2]Alkiviadis G. Akritas:
A new method for polynomial real root isolation. ACM-SE 1978: 39-43 - 1976
- [c1]George E. Collins, Alkiviadis G. Akritas:
Polynomial real root isolation using Descarte's rule of signs. SYMSACC 1976: 272-275
Informal and Other Publications
- 2017
- [i1]Alkiviadis G. Akritas, Gennadi I. Malaschonok:
Computation of the Adjoint Matrix. CoRR abs/1711.09450 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
