Smoothed analysis of the perceptron algorithm for linear programming
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Journal of Complexity
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
On smoothed analysis in dense graphs and formulas
Random Structures & Algorithms
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Journal of Complexity
Smoothed analysis of binary search trees
Theoretical Computer Science
The condition number of a randomly perturbed matrix
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Smoothed analysis of binary search trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We survey the progress that has been made in the smoothed analysis of algorithms.