On the public citation graph
Sylvester–Habicht Sequences and Fast Cauchy Index Computation
0 signed · 102 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jsco.1994.1066openalex-snapshot
Solving Hankel Systems over the Integers
inferredcites →https://doi.org/10.1006/jsco.1996.0001openalex-snapshot
The Habicht Approach to Subresultants
inferredcites →https://doi.org/10.1007/978-3-322-85033-1openalex-snapshot
Einführung in die reelle Algebra
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_9openalex-snapshot
Generalized Polynomial Remainder Sequences
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1openalex-snapshot
Quantifier Elimination and Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/bf00289520openalex-snapshot
Schnelle Berechnung von Kettenbruchentwicklungen
inferredcites →https://doi.org/10.1007/bf01436917openalex-snapshot
On computing reciprocals of power series
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1007/bf02242389openalex-snapshot
An algorithm for division of powerseries
inferredcites →https://doi.org/10.1007/bf02568028openalex-snapshot
Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
inferredcites →https://doi.org/10.1007/bf02575814openalex-snapshot
Computing the inertia of bezout and Hankel matrices
inferredcites →https://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot
Fast solution of toeplitz systems of equations and computation of Padé approximants
inferredcites →https://doi.org/10.1051/ita/1990240605611openalex-snapshot
Spécialisation de la suite de Sturm et sous-résultants (I)
inferredcites →https://doi.org/10.1051/ita/1994280100011openalex-snapshot
Spécialisation de la suite de Sturm
inferredcites →https://doi.org/10.1051/ita/1996300403191openalex-snapshot
Algorithme de Bareiss, algorithme des sous-résultants
inferredcites →https://doi.org/10.1080/03081088108817420openalex-snapshot
The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
inferredcites →https://doi.org/10.1098/rstl.1853.0018openalex-snapshot
XVIII. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s functions, and that of the greatest algebraical common measure
inferredcites →https://doi.org/10.1137/0212001openalex-snapshot
The Computational Complexity of Continued Fractions
inferredcites →https://doi.org/10.1137/0707044openalex-snapshot
Upper Bounds for the Abscissa of Stability of a Stable Polynomial
inferredcites →https://doi.org/10.1145/1089310.1089312openalex-snapshot
Computer algebra symbolic and algebraic computation
inferredcites →https://doi.org/10.1145/258726.258792openalex-snapshot
Asymptotically fast computation of subresultants
inferredcites →https://doi.org/10.1145/321371.321381openalex-snapshot
Subresultants and Reduced Polynomial Remainder Sequences
inferredcites →https://doi.org/10.1145/321662.321664openalex-snapshot
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
inferredcites →https://doi.org/10.1145/321662.321665openalex-snapshot
On Euclid's Algorithm and the Theory of Subresultants
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
inferredcites →https://doi.org/10.5860/choice.38-1000openalex-snapshot
Fundamental problems of algorithmic algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1999.0528openalex-snapshot
A Fast Version of the Schur–Cohn Algorithm
inferred← citeshttps://doi.org/10.1006/jcom.2000.0571openalex-snapshot
A Gröbner Free Alternative for Polynomial System Solving
inferred← citeshttps://doi.org/10.1007/978-0-387-78133-4_6openalex-snapshot
SYNAPS: A Library for Dedicated Applications in Symbolic Numeric Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-85521-7_4openalex-snapshot
Real Algebraic Numbers: Complexity Analysis and Experimentation
inferred← citeshttps://doi.org/10.1007/978-3-662-03891-8_6openalex-snapshot
Symbolic Recipes for Real Solutions
inferred← citeshttps://doi.org/10.1007/978-3-662-05355-3_9openalex-snapshot
Complexity of Basic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_8openalex-snapshot
Amortized Bound for Root Isolation via Sturm Sequences
inferred← citeshttps://doi.org/10.1007/s10013-023-00652-0openalex-snapshot
Computing the Non-properness Set of Real Polynomial Maps in the Plane
inferred← citeshttps://doi.org/10.1007/s11786-010-0044-3openalex-snapshot
On the Topology of Real Algebraic Plane Curves
inferred← citeshttps://doi.org/10.1007/s11786-011-0071-8openalex-snapshot
A General Approach to Isolating Roots of a Bitstream Polynomial
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.06.043openalex-snapshot
A parametric representation of totally mixed Nash equilibria
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.10.003openalex-snapshot
Exact, efficient, and complete arrangement computation for cubic curves
inferred← citeshttps://doi.org/10.1016/j.jco.2004.03.004openalex-snapshot
On solving univariate sparse polynomials in logarithmic time
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.008openalex-snapshot
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
inferred← citeshttps://doi.org/10.1016/j.jco.2014.08.002openalex-snapshot
On the complexity of computing with planar algebraic curves
inferred← citeshttps://doi.org/10.1016/j.jco.2016.07.002openalex-snapshot
Solving bivariate systems using Rational Univariate Representations
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.09.005openalex-snapshot
Birational properties of the gap subresultant varieties
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.07.001openalex-snapshot
Fast computation of special resultants
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.07.001openalex-snapshot
Symmetric subresultants and applications
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.04.009openalex-snapshot
On the asymptotic and practical complexity of solving bivariate systems over the reals
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.05.003openalex-snapshot
Automatic computation of the complete root classification for a parametric polynomial
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.022openalex-snapshot
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.003openalex-snapshot
New fast euclidean algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.08.009openalex-snapshot
Separating linear forms and Rational Univariate Representations of bivariate systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.01.007openalex-snapshot
Continuous amortization and extensions: With applications to bisection-based root isolation
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.01.004openalex-snapshot
Bivariate triangular decompositions in the presence of asymptotes
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.12.001openalex-snapshot
Univariate real root isolation in an extension field and applications
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.04.017openalex-snapshot
On the complexity of the Lickteig–Roy subresultant algorithm
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.06.005openalex-snapshot
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.10.003openalex-snapshot
Subresultants of $(x-\alpha)^m$ and $(x-\beta)^n$, Jacobi polynomials and complexity
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.08.012openalex-snapshot
PTOPO: Computing the geometry and the topology of parametric curves
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102520openalex-snapshot
Relations among multi-polynomial subresultants
inferred← citeshttps://doi.org/10.1016/j.laa.2013.09.010openalex-snapshot
Zero–nonzero and real–nonreal sign determination
inferred← citeshttps://doi.org/10.1016/j.laa.2022.04.002openalex-snapshot
Efficient sampling in spectrahedra and volume approximation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.009openalex-snapshot
Real algebraic numbers and polynomial systems of small degree
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00135-9openalex-snapshot
An elementary approach to subresultants theory
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00093-2openalex-snapshot
Towards faster real algebraic numbers
inferred← citeshttps://doi.org/10.1016/s0885-064x(02)00028-6openalex-snapshot
Systems of rational polynomial equations have polynomial size approximate zeros on the average
inferred← citeshttps://doi.org/10.1080/00207160802322340openalex-snapshot
Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
inferred← citeshttps://doi.org/10.1090/s0002-9939-05-07850-0openalex-snapshot
D-resultant and subresultants
inferred← citeshttps://doi.org/10.1134/s0361768816020031openalex-snapshot
Parameterization of the discriminant set of a polynomial
inferred← citeshttps://doi.org/10.1145/1145768.1145786openalex-snapshot
Almost tight recursion tree bounds for the Descartes method
inferred← citeshttps://doi.org/10.1145/1277548.1277567openalex-snapshot
On the complexity of real solving bivariate systems
inferred← citeshttps://doi.org/10.1145/1542362.1542424openalex-snapshot
On the topology of planar algebraic curves
inferred← citeshttps://doi.org/10.1145/1576702.1576711openalex-snapshot
Faster real feasibility via circuit discriminants
inferred← citeshttps://doi.org/10.1145/1837934.1837980openalex-snapshot
Random polynomials and expected complexity of bisection methods for real solving
inferred← citeshttps://doi.org/10.1145/1993886.1993938openalex-snapshot
A simple but exact and efficient algorithm for complex root isolation
inferred← citeshttps://doi.org/10.1145/2442829.2442854openalex-snapshot
On the complexity of solving a bivariate polynomial system
inferred← citeshttps://doi.org/10.1145/2442829.2442875openalex-snapshot
Near optimal tree size bounds on a simple real root isolation algorithm
inferred← citeshttps://doi.org/10.1145/2461217.2461243openalex-snapshot
On exact rasterization of real algebraic plane curves
inferred← citeshttps://doi.org/10.1145/2465506.2465519openalex-snapshot
Rational univariate representations of bivariate systems and applications
inferred← citeshttps://doi.org/10.1145/2465506.2465956openalex-snapshot
Fast algorithms for l -adic towers over finite fields
inferred← citeshttps://doi.org/10.1145/3373207.3404062openalex-snapshot
On the geometry and the topology of parametric curves
inferred← citeshttps://doi.org/10.1145/3476446.3535480openalex-snapshot
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients
inferred← citeshttps://doi.org/10.1145/780506.780535openalex-snapshot
Towards faster real algebraic numbers
inferred← citeshttps://doi.org/10.1201/9781584888239-c17openalex-snapshot
Algebraic and Numerical Algorithms
inferred← citeshttps://doi.org/10.17323/1609-4514-2007-7-3-425-452openalex-snapshot
Extremal Real Algebraic Geometry and A-Discriminants
inferred← citeshttps://doi.org/10.22028/d291-26404openalex-snapshot
Harnessing the power of GPUs for problems in real algebraic geometry
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.119.09.715openalex-snapshot
The Fundamental Theorem of Algebra Made Effective: An Elementary Real-algebraic Proof via Sturm Chains
inferred← citeshttps://doi.org/10.48550/arxiv.0901.3786openalex-snapshot
Refined Asymptotics for Multigraded Sums of Squares
inferred← citeshttps://doi.org/10.48550/arxiv.1011.0344openalex-snapshot
On the Complexity of Real Root Isolation
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2642openalex-snapshot
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5266openalex-snapshot
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5991openalex-snapshot
Applications of Continuous Amortization to Bisection-based Root Isolation
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3731openalex-snapshot
Chapter 10: Algebraic Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00795openalex-snapshot
Méthodes Matricielles Introduction à la Complexité Algébrique
inferred← citeshttps://doi.org/10.48550/arxiv.2010.03817openalex-snapshot
Efficient Sampling from Feasible Sets of SDPs and Volume Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0106225openalex-snapshot
On Solving Fewnomials Over Intervals in Fewnomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411107openalex-snapshot
First Steps in Algorithmic Fewnomial Theory
inferred← citeshttps://doi.org/10.70675/20c4db5az6bf5z4d03za9d9z5e6cd5011246openalex-snapshot
Certified Polynomial Optimization Based on Exact Sum of Squares Decompositions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.