Follow
Doru Stefanescu
Doru Stefanescu
Professor of Mathematics, University of Bucharest
Verified email at rms.unibuc.ro
Title
Cited by
Cited by
Year
Polynomials: An algorithmic approach
M Mignotte, D Ștefănescu
(No Title), 1999
2151999
New bounds for positive roots of polynomials
D Stefanescu
Journal of Universal Computer Science 11 (12), 2125-2131, 2005
622005
On an estimation of polynomial roots by Lagrange
M Mignotte, D Stefanescu
362002
Strong determinism vs. computability
DS Cristian Calude, Douglas I. Campbell, Karl Svozil
Vienna Circle Institute Yearbook 3, 115-131, 1995
23*1995
On the generalized difference polynomials
L Panaitopol, D Stefanescu
Pacific Journal of Mathematics 143 (2), 341-348, 1990
171990
On meromorphic formal power series
D Ştefănescu
Bulletin mathématique de la Société des Sciences Mathématiques de la …, 1983
171983
Improvements of Lagrange's bound for polynomial roots
P Batra, M Mignotte, D Ştefănescu
Journal of symbolic computation 82, 19-25, 2017
152017
A method to obtain algebraic elements over K ((T)) in positive characteristic
D STEFǍNESCU
Bulletin mathématique de la Société des Sciences Mathématiques de la …, 1982
131982
Bounds for real roots and applications to orthogonal polynomials
D Ştefănescu
International Workshop on Computer Algebra in Scientific Computing, 377-391, 2007
122007
Estimates for polynomial roots
M Mignotte, D Ştefănescu
Applicable Algebra in Engineering, Communication and Computing 12, 437-453, 2001
112001
Some criteria for irreducibility of polynomials
L PANITOPOL, D ŞTEFǍNESCU
Bulletin mathématique de la Société des Sciences Mathématiques de la …, 1985
111985
A resultant condition for the irreducibility of polynomials
Panaitopol
10*
On the factorization of polynomials over discrete valuation domains
D Ştefănescu
Analele ştiinţifice ale Universităţii" Ovidius" Constanţa. Seria Matematică …, 2014
92014
Inequalities on upper bounds for real polynomial roots
D Ştefănescu
International Workshop on Computer Algebra in Scientific Computing, 284-294, 2006
92006
The Constructive Implicit Function Theorem and Applications in Mechanics
DS Bridges, C Calude, B Pavlov, D Stefanescu
CDMTCS Research Reports CDMTCS-070, 1997
81997
Linear recurrent sequences and polynomial roots
M Mignotte, D Ştefănescu
Journal of Symbolic Computation 35 (6), 637-649, 2003
72003
Computation of dominant real roots of polynomials
D Ştefănescu
Programming and Computer Software 34, 69-74, 2008
62008
La première méthode générale de factorisation des polynômes. Autour d'un mémoire de FT Schubert
M Mignotte, D Ştefănescu
Revue d'histoire des mathématiques 7 (1), 67-89, 2001
62001
A new polynomial bound and its efficiency
D Ştefănescu
International Workshop on Computer Algebra in Scientific Computing, 457-467, 2015
52015
A Lower Bound for Computing Lagrange’s Real Root Bound
VS Swaroop N. Prabhakar
Lecture Notes in Computer Science 9890, 444-456, 2016
4*2016
The system can't perform the operation now. Try again later.
Articles 1–20