On the public citation graph
Rudiments of an average case complexity theory for piecewise-linear path following algorithms
0 signed · 21 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/bf01580679openalex-snapshot
On triangulations for computing fixed points
inferredcites →https://doi.org/10.1007/bf01582051openalex-snapshot
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
inferredcites →https://doi.org/10.1007/bf01582052openalex-snapshot
On the cost of approximating all roots of a complex polynomial
inferredcites →https://doi.org/10.1007/bf01585104openalex-snapshot
On the computational complexity of piecewise-linear homotopy algorithms
inferredcites →https://doi.org/10.1007/bf02612355openalex-snapshot
On the cost of computing roots of polynomials
inferredcites →https://doi.org/10.1007/bf02612356openalex-snapshot
Computational complexity of a piecewise linear homotopy algorithm
inferredcites →https://doi.org/10.1017/cbo9780511617331openalex-snapshot
Integral Geometry and Geometric Probability
inferredcites →https://doi.org/10.1017/cbo9780511617331.004openalex-snapshot
Integral Geometry and Geometric Probability
inferredcites →https://doi.org/10.1287/moor.12.1.121openalex-snapshot
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
inferredcites →https://doi.org/10.1287/moor.9.3.363openalex-snapshot
Equivalence of Surface Density and Average Directional Density
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_79openalex-snapshot
Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-642-61257-2openalex-snapshot
Numerical Continuation Methods
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1016/0885-064x(89)90017-4openalex-snapshot
Exponential lower bounds for finding Brouwer fix points
inferred← citeshttps://doi.org/10.1016/s1570-8659(97)80002-6openalex-snapshot
Numerical path following
inferred← citeshttps://doi.org/10.1017/s0962492900002336openalex-snapshot
Continuation and path following
inferred← citeshttps://doi.org/10.1109/icca.2009.5410219openalex-snapshot
A homotopy-like simplicial method for approximating fixed points of an increasing mapping from Rn+ into itself
inferred← citeshttps://doi.org/10.1109/ieem.2010.5674387openalex-snapshot
Computing fixed points of an increasing mapping from a finite lattice formed by integer points of a box into itself
inferred← citeshttps://doi.org/10.1109/sfcs.1987.24openalex-snapshot
Exponential lower bounds for finding Brouwer fixed points
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.