Smoothed analysis-Reference-Cited by-同舟云学术

Smoothed analysis

Published:2009-10 Issue:10 Volume:52 Page:76-84
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Spielman Daniel A.¹,Teng Shang-Hua²

Affiliation:

1. Yale University, New Haven, CT

2. Boston University and Akamai Technologies, Inc.

Abstract

This Gödel Prize-winning work traces the steps toward modeling real data.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1562764.1562785

Reference40 articles.

1. Adler I. The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method. Technical report University of California at Berkeley (May 1983). Adler I. The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method. Technical report University of California at Berkeley (May 1983).

2. The Smoothed Complexity of Edit Distance

3. How slow is the k-means method?

4. Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

5. Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm

Cited by 114 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. “Intelligent Heuristics Are the Future of Computing”;ACM Transactions on Intelligent Systems and Technology;2023-11-14

2. Quantifying Grover speed-ups beyond asymptotic analysis;Quantum;2023-10-10

3. The Smoothed Complexity of Policy Iteration for Markov Decision Processes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Phase transition of degeneracy in minor-closed families;Advances in Applied Mathematics;2023-05

5. Efficient Computation of the Zeros of the Bargmann Transform Under Additive White Noise;Foundations of Computational Mathematics;2022-09-27