J
Jeff Erickson
Researcher at University of Illinois at Urbana–Champaign
Publications - 166
Citations - 5407
Jeff Erickson is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 43, co-authored 166 publications receiving 5136 citations. Previous affiliations of Jeff Erickson include National Center for Supercomputing Applications & Eindhoven University of Technology.
Papers
More filters
Proceedings ArticleDOI
Global minimum cuts in surface embedded graphs
TL;DR: In this paper, the authors gave a deterministic O(g)n log log n time algorithm to find the minimum cut in a surface-embedded graph in near-linear time.
Proceedings Article
Reconfiguring Convex Polygons.
Oswin Aichholzer,Erik D. Demaine,Jeff Erickson,Ferran Hurtado,Mark H. Overmars,Michael Soss,Godfried T. Toussaint +6 more
TL;DR: It is proved that there is a motion from any convex polygon to any conveX polygon with the same counterclockwise sequence of edge lengths, that preserves the lengths of the edges, and keeps the polygon convex at all times.
Journal ArticleDOI
Recognizing Weakly Simple Polygons
TL;DR: An O(n\log n)$$O(nlogn)-time algorithm that determines whether a given n-gon in the plane is weakly simple, which improves upon an earlier algorithm by Chang et al.
Proceedings ArticleDOI
Smoothing the gap between NP and ER
TL;DR: In this paper, it was shown that for a wide class of existential theory of the reals (ER) complete problems, their witness can be represented with logarithmic input-precision by using smoothed analysis on its real RAM verification algorithm.
Proceedings ArticleDOI
On the least median square problem
TL;DR: This work considers the exact and approximate computational complexity of the multivariate LMS linear regression estimator, and provides nearly matching lowerbounds for these problems, under the assumption that deciding whether n given points in ℝ d are affinely nondegenerate requires Ω(nd) time.