120 citations · 472 across the 33 of their papers we have counts for
Showing 2011 · cs.SCShow all
2 papers · 2 filters
cs.SC2011★ 2 cited
A Worst-case Bound for Topology Computation of Algebraic Curves
Michael Kerber, Michael Sagraloff
Computing the topology of an algebraic plane curve means to compute a combinatorial graph that is isotopic to and thus represents its topology in $\math…
cs.SC2011★ 5 cited
Root Refinement for Real Polynomials
Michael Kerber, Michael Sagraloff
We consider the problem of approximating all real roots of a square-free polynomial . Given isolating intervals, our algorithm refines each of them to a width of or les…