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

Smoothed Analysis

Published:2003 Issue: Volume: Page:256-270
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Spielman Daniel A.,Teng Shang-Hua

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45078-8_23

Reference31 articles.

1. Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. In: 41st Annual Symposium on Foundations of Computer Science, pp. 240–250. IEEE, Los Alamitos (2000)

2. Alon, N., Krivelevich, M., Fischer, E., Szegedy, M.: Efficient testing of large graphs. In: 40th Annual Symposium on Foundations of Computer Science, pp. 656–666. IEEE, Los Alamitos (1999)

3. Alon, N.: Testing subgraphs in large graphs. In: IEEE (ed.) Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science: proceedings, pp. 434–439 (2001)

4. Blum, A., Dunagan, J.: Smoothed analysis of the perceptron algorithm for linear programming. In: Proceedings of the 13th Annual ACM SIAM Symposium On Discrete Mathematics (SODA 2002), pp. 905–914. ACM Press, New York (2002)

5. Lecture Notes in Computer Science;P. Bose,1998

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

1. Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder than Random;SIAM Journal on Computing;2024-09-05

2. Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs;Combinatorics, Probability and Computing;2016-03-14

4. Performance guarantees for scheduling algorithms under perturbed machine speeds;Discrete Applied Mathematics;2015-11

5. Smoothed Analysis of Local Search Algorithms;Lecture Notes in Computer Science;2015