9 citations · 20 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 4 cited
Applications of Continuous Amortization to Bisection-based Root Isolation
Michael A. Burr
Continuous amortization is a technique for computing the complexity of algorithms, and it was first presented by the author in Burr, Krahmer, & Yap (2009). Continuous amortization…
cs.DS2011★ 1 cited
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Michael Burr, Felix Krahmer
Let f be a univariate polynomial with real coefficients, f in R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for isol…