836 citations · 912 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
Exponential algorithmic speedup by quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto +3
We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a c…
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…