search
Get Started
search

Best Smoothed Analysis

Filter by Tags

Rankings use category fit, feature coverage, pricing signals, public reception, and recency. Affiliate relationships do not affect scores.

0.0 - 10.0
Best 1 Daniel Spielman

Daniel Spielman is an American theoretical computer scientist and professor at Yale University. He co-developed the concept of smoothed analysis of algorithms with Shang-Hua Teng, providing a mathematical framework to explain the practical performance of algorithms like the simplex method. His broad...

9.12 Excellent
Why this score?

Smoothed analysis, spectral graph theory, and coding contributions are foundational; major awards support elite consensus.

Scoring methodology
2 Shang-Hua Teng

Shang-Hua Teng is a Chinese-American theoretical computer scientist at the University of Southern California. He co-developed smoothed analysis of algorithms with Daniel Spielman, a framework for analyzing algorithm performance under slight perturbations of worst-case inputs. This work was recognize...

8.45 Great
Why this score?

Smoothed analysis with Spielman earned major awards; strong algorithms reputation with broad theoretical significance.

Scoring methodology
You've reached the end — 2 items

Save to your list

Save your favorites and follow how their scores change over time.

Save favorites
Track changes
Compare scores

Already have an account? Sign in

Compare Items

See how they stack up against each other

Comparing
VS
Select 1 more item to compare