---
res:
  bibo_abstract:
  - Computing the topology of an algebraic plane curve C means computing a combinatorial
    graph that is isotopic to C and thus represents its topology in R2. We prove that,
    for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology
    of the induced curve can be computed with  bit operations ( indicates that we
    omit logarithmic factors). Our analysis improves the previous best known complexity
    bounds by a factor of n2. The improvement is based on new techniques to compute
    and refine isolating intervals for the real roots of polynomials, and on the consequent
    amortized analysis of the critical fibers of the algebraic curve.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Kerber, Michael
      foaf_surname: Kerber
      foaf_workInfoHomepage: http://www.librecat.org/personId=36E4574A-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-8030-9299
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Sagraloff, Michael
      foaf_surname: Sagraloff
  bibo_doi: 10.1016/j.jsc.2011.11.001
  bibo_issue: '3'
  bibo_volume: 47
  dct_date: 2012^xs_gYear
  dct_identifier:
  - UT:000300115300002
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: A worst case bound for topology computation of algebraic curves@
...