Adam W. Strzebonski

Orcid: 0000-0003-1282-4640

According to our database1, Adam W. Strzebonski authored at least 23 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Univariate real root isolation in an extension field and applications.
J. Symb. Comput., 2019

Asymptotic Solutions of Polynomial Equations with Exp-Log Coefficients.
CoRR, 2019

2018
Comparison of CAD-based Methods for Computation of Rational Function Limits.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Algorithm for computing semi-Fourier sequences of expressions involving exponentiations and integrations.
CoRR, 2017

CAD Adjacency Computation Using Validated Numerics.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Cylindrical algebraic decomposition using local projections.
J. Symb. Comput., 2016

2014
Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition.
CoRR, 2014

2012
Real root isolation for exp-log-arctan functions.
J. Symb. Comput., 2012

Univariate real root isolation in multiple extension fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Cylindrical decomposition for systems transcendental in the first variable.
J. Symb. Comput., 2011

Univariate real root isolation in an extension field.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Computation with semialgebraic sets represented by cylindrical algebraic formulas.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Black-box/white-box simplification and applications to quantifier elimination.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009
Real root isolation for tame elementary functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Real root isolation for exp-log functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006
Cylindrical Algebraic Decomposition using validated numerics.
J. Symb. Comput., 2006

Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials.
Computing, 2006

2005
Applications of Algorithms for Solving Equations and Inequalities in Mathematica.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2000
Solving Systems of Strict Polynomial Inequalities.
J. Symb. Comput., 2000

1999
A Real Polynomial Decision Algorithm Using Arbitrary-Precision Floating Point Arithmetic.
Reliab. Comput., 1999

1997
Computing in the Field of Complex Algebraic Numbers.
J. Symb. Comput., 1997


  Loading...