68 citations · 76 across the 4 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
math.OC2002★ 68 cited
Smoothed analysis of algorithms
Daniel A. Spielman, Shang-Hua Teng
Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could n…
cs.CG2002★ 6 cited
Parallel Delaunay Refinement: Algorithms and Analyses
Dan A. Spielman, Shang-hua Teng, Alper Ungor
In this paper, we analyze the complexity of natural parallelizations of Delaunay refinement methods for mesh generation. The parallelizations employ a simple strategy: at each iter…