On the public citation graph
Cauchy index computation
0 signed · 36 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.1007/3-540-11607-9_1openalex-snapshot
Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients
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/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.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.1137/0212001openalex-snapshot
The Computational Complexity of Continued Fractions
inferredcites →https://doi.org/10.1145/1089310.1089312openalex-snapshot
Computer algebra symbolic and algebraic computation
inferredcites →https://doi.org/10.1515/9783110811117.1openalex-snapshot
Basic algorithms in real algebraic geometry and their complexity: from Sturm's theorem to the existential theory of reals
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
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.1006/jsco.1999.0322openalex-snapshot
New Structure Theorem for Subresultants
inferred← citeshttps://doi.org/10.1006/jsco.2000.0427openalex-snapshot
Sylvester–Habicht Sequences and Fast Cauchy Index Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-03891-8_6openalex-snapshot
Symbolic Recipes for Real Solutions
inferred← citeshttps://doi.org/10.1016/b978-0-444-52730-1.00008-4openalex-snapshot
Stability Considerations
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.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.2018.04.017openalex-snapshot
On the complexity of the Lickteig–Roy subresultant algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.015openalex-snapshot
Polynomial equation solving by lifting procedures for ramified fibers
inferred← citeshttps://doi.org/10.1016/s0022-4049(98)00081-4openalex-snapshot
Optimizations of the subresultant algorithm
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10088-5openalex-snapshot
A hybrid approach to the computation of the inertia of a parametric family of Bezoutians with application to some stability problems for bivariate polynomials
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00135-9openalex-snapshot
An elementary approach to subresultants theory
inferred← citeshttps://doi.org/10.1093/qmath/haz008openalex-snapshot
Quantitative fundamental theorem of algebra
inferred← citeshttps://doi.org/10.1145/258726.258792openalex-snapshot
Asymptotically fast computation of subresultants
inferred← citeshttps://doi.org/10.1145/3208976.3209020openalex-snapshot
On Computing the Resultant of Generic Bivariate Polynomials
inferred← citeshttps://doi.org/10.1145/384101.384122openalex-snapshot
A generalized Graeffe's iteration for evaluating polynomials and rational functions
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.