Hoon Hong

Jiaqi Meng

CoRR, 2024

Conditions for eigenvalue configurations of two real symmetric matrices: a signature approach.

[BibT_eX]

[DOI]

Daniel Profili

J. Rafael Sendra

CoRR, 2024

Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials.

[BibT_eX]

[DOI]

CoRR, 2024

Conditions for eigenvalue configurations of two real symmetric matrices: a symmetric function approach.

[BibT_eX]

[DOI]

Daniel Profili

J. Rafael Sendra

CoRR, 2024

2023

Improving Angular Speed Uniformity by Piecewise Radical Reparameterization.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automated Deduction in Geometry, 2023

Symbolic-Numeric Parameter Estimation Software Package in Julia.

[BibT_eX]

[DOI]

CoRR, 2023

Parametric "Non-nested" Discriminants for Multiplicities of Univariate Polynomials.

[BibT_eX]

[DOI]

CoRR, 2023

2021

A condition for multiplicity structure of univariate polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Subresultant of several univariate polynomials.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Connectivity in Semi-Algebraic Sets I.

[BibT_eX]

[DOI]

CoRR, 2020

2019

SIAN: a tool for assessing structural identifiability of parametric ODEs.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2019

SIAN: software for structural identifiability analysis of ODE models.

[BibT_eX]

[DOI]

Bioinform., 2019

2018

Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling.

[BibT_eX]

[DOI]

Owen Coss

Jonathan D. Hauenstein

Daniel K. Molzahn

SIAM J. Appl. Algebra Geom., 2018

Improving root separation bounds.

[BibT_eX]

[DOI]

Aaron Herman

Elias P. Tsigaridas

J. Symb. Comput., 2018

Positive Solutions of Systems of Signed Parametric Polynomial Inequalities.

[BibT_eX]

[DOI]

Thomas Sturm

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017

Resultants over commutative idempotent semirings I: Algebraic aspect.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

Algorithm for computing μ-bases of univariate polynomials.

[BibT_eX]

[DOI]

Zachary Hough

Irina A. Kogan

J. Symb. Comput., 2017

Open weak CAD and its applications.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

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

[BibT_eX]

[DOI]

Adam W. Strzebonski

CoRR, 2017

2016

On using Lazard's projection in CAD construction.

[BibT_eX]

[DOI]

Scott McCallum

J. Symb. Comput., 2016

Quality of positive root bounds.

[BibT_eX]

[DOI]

Aaron Herman

J. Symb. Comput., 2016

Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation).

[BibT_eX]

[DOI]

Madalina Erascu

J. Symb. Comput., 2016

2015

Special algorithm for stability analysis of multistable biological regulatory systems.

[BibT_eX]

[DOI]

Xiaoxian Tang

Bican Xia

J. Symb. Comput., 2015

An algebraic method for constructing stable and consistent autoregressive filters.

[BibT_eX]

[DOI]

John Harlim

Jacob L. Robbins

J. Comput. Phys., 2015

Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves.

[BibT_eX]

[DOI]

Eunjeong Lee

Hyang-Sook Lee

Finite Fields Their Appl., 2015

2014

The Secant-Newton Map is Optimal Among Contracting $n^{th}$ Degree Maps for $n^{th}$ Root Computation.

[BibT_eX]

[DOI]

Kayla Bishop

CoRR, 2014

Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation).

[BibT_eX]

[DOI]

Madalina Erascu

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation.

[BibT_eX]

[DOI]

Madalina Erascu

Reliab. Comput., 2013

Reducing Pairing Inversion to Exponentiation Inversion using Non-degenerate Auxiliary Pairing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Simple and exact formula for minimum loop length in Ate i pairing based on Brezing-Weng curves.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

Object-Image Correspondence for Algebraic Curves under Projections

[BibT_eX]

[DOI]

Joseph M. Burdis

Irina A. Kogan

CoRR, 2013

A framework for improving uniformity of parameterizations of curves.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2013

Improving angular speed uniformity by reparameterization.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2013

Pairing Inversion via Non-degenerate Auxiliary Pairings.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

2012

Variant quantifier elimination.

[BibT_eX]

[DOI]

Mohab Safey El Din

J. Symb. Comput., 2012

Real solution formulas of cubic and quartic equations applied to generate dynamic diagrams with inequality constraints.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Applied Computing, 2012

Improving Angular Speed Uniformity by Optimal C 0 Piecewise Reparameterization.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2012

Improving Angular Speed Uniformity by C 1 Piecewise Reparameterization.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

2011

Solution formulas for cubic equations without or with constraints.

[BibT_eX]

[DOI]

Ting Zhao

J. Symb. Comput., 2011

Simple and Exact Formula for Minimum Loop Length in Ate<sub>i</sub> Pairing based on Brezing-Weng Curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

2010

Connectivity in Semi-algebraic Sets.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

2009

Real-Time Algorithm for Minimizing THD in Multilevel Inverters With Unequal or Varying Voltage Steps Under Staircase Modulation.

[BibT_eX]

[DOI]

Yu Liu

Alex Q. Huang

IEEE Trans. Ind. Electron., 2009

Real-Time Calculation of Switching Angles Minimizing THD for Multilevel Inverters With Step Modulation.

[BibT_eX]

[DOI]

Yu Liu

Alex Q. Huang

IEEE Trans. Ind. Electron., 2009

Sylvester's double sums: The general case.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

Variant real quantifier elimination: algorithm and application.

[BibT_eX]

[DOI]

Mohab Safey El Din

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Corrigendum to "Are Buchberger's criteria necessary for the chain condition?" [J. Symbolic Comput. 42(2007) 717-732].

[BibT_eX]

[DOI]

John Perry

J. Symb. Comput., 2008

Connectivity in semialgebraic sets (abstract only).

[BibT_eX]

[DOI]

Robert Quinn

ACM Commun. Comput. Algebra, 2008

2007

Foreword.

[BibT_eX]

[DOI]

Chee-Keng Yap

Math. Comput. Sci., 2007

Are Buchberger's criteria necessary for the chain condition?

[BibT_eX]

[DOI]

John Perry

J. Symb. Comput., 2007

An elementary proof of Sylvester's double sums for subresultants.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

2006

Bruno Buchberger - A life devoted to symbolic computation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Solving Dynamic Geometric Constraints Involving Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

2004

Note on Jacobi's method for approximating dominant roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

2002

Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case.

[BibT_eX]

[DOI]

Manfred Minimair

J. Symb. Comput., 2002

2001

Ore Subresultant Coefficients in Solutions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

Ore Principal Subresultant Coefficients in Solutions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

2000

Editorial.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

1999

East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Michael F. Singer

SIGSAM Bull., 1999

1998

Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization).

[BibT_eX]

[DOI]

Josef Schicho

J. Symb. Comput., 1998

Groebner Basis Under Composition I.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

Bounds for Absolute Positiveness of Multivariate Polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

Testing Positiveness of Polynomials.

[BibT_eX]

[DOI]

Dalibor Jakus

J. Autom. Reason., 1998

1997

Testing Stability by Quantifier Elimination.

[BibT_eX]

[DOI]

Richard Liska

Stanly L. Steinberg

J. Symb. Comput., 1997

Subresultants Under Composition.

[BibT_eX]

[DOI]

J. Symb. Comput., 1997

Implicitization of Nested Circular Curves.

[BibT_eX]

[DOI]

J. Symb. Comput., 1997

Heuristic Search and Pruning in Polynomial Constraints Satisfaction.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1997

1996

The Exact Region of Stability for MacCormack Scheme.

[BibT_eX]

[DOI]

Computing, 1996

Groebner Basis Under Composition II.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

The Design of the SACLIB/PACLIB Kernels.

[BibT_eX]

[DOI]

Andreas Neubacher

J. Symb. Comput., 1995

Bernstein Form is Inclusion Monotone.

[BibT_eX]

[DOI]

Volker Stahl

Computing, 1995

Implicitization of Curves Parameterized by Generalized Trigonometric Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1995

1994

Safe starting regions by fixed points and tightening.

[BibT_eX]

[DOI]

Volker Stahl

Computing, 1994

RISC-CLP(CF) Constraint Logic Programming over Complex Functions.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Parallel Computation of Modular Multivariate Polynominal Resultants on a Shared Memory Machine.

[BibT_eX]

[DOI]

Hans-Wolfgang Loidl

Proceedings of the Parallel Processing: CONPAR 94, 1994

1993

Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants.

[BibT_eX]

[DOI]

Comput. J., 1993

Special Issue Editorial: Computational Quantifier Elimination.

[BibT_eX]

[DOI]

Comput. J., 1993

A New Library for Parallel Algebraic Computation.

[BibT_eX]

Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

Quantifier Elimination for Formulas Constrained by Quadratic Equations.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

The Design of the PACLIB Kernel for Parallel Algebraic Computation.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computation, 1993

Parallelization of Quantifier Elimination on a Workstation Network.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

Programming in PACLIB.

[BibT_eX]

[DOI]

SIGSAM Bull., 1992

Simple Solution Formula Construction in Cylindrical Algebraic Decomposition Based Quantifier Elimination.

[BibT_eX]

[DOI]

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Non-linear Real Constraints in Constraint Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 1992

Heuristic Search Strategies for Cylindrical Algebraic Decomposion.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Mathematical Computation, 1992

1991

Partial Cylindrical Algebraic Decomposition for Quantifier Elimination.

[BibT_eX]

[DOI]

George E. Collins

J. Symb. Comput., 1991

RISC-CLP(Real): Logic Programming with Non-linear Constraints over the Reals.

[BibT_eX]

Proceedings of the Constraint Logic Programming, 1991

1990

An Improvement of the Projection Operator in Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]