Sign In

Login

Password

Forgot Password ? Sign Up

Smoothed analysis (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Smoothed analysis" in English language version.

refsWebsite
Global rank English rank
10doi.org
2nd place
2nd place
5semanticscholar.org
11th place
8th place
3arxiv.org
69th place
59th place
1yale.edu
565th place
460th place
1psu.edu
207th place
136th place
1ams.org
451st place
277th place
1harvard.edu
18th place
17th place
1nbn-resolving.org
low place
low place
1cambridge.org
305th place
264th place
1utwente.nl
low place
8,900th place

ams.org

mathscinet.ams.org

arxiv.org

cambridge.org

doi.org

  • Spielman, Daniel; Teng, Shang-Hua (2009), "Smoothed analysis: an attempt to explain the behavior of algorithms in practice" (PDF), Communications of the ACM, 52 (10), ACM: 76–84, doi:10.1145/1562764.1562785, S2CID 7904807
  • Amenta, Nina; Ziegler, Günter (1999), "Deformed products and maximal shadows of polytopes", Contemporary Mathematics, 223, American Mathematical Society: 10–19, CiteSeerX 10.1.1.80.3241, doi:10.1090/conm/223, ISBN 9780821806746, MR 1661377
  • Shamir, Ron (1987), "The Efficiency of the Simplex Method: A Survey", Management Science, 33 (3): 301–334, doi:10.1287/mnsc.33.3.301
  • Spielman, Daniel; Teng, Shang-Hua (2001), "Smoothed analysis of algorithms", Proceedings of the thirty-third annual ACM symposium on Theory of computing, ACM, pp. 296–305, arXiv:cs/0111050, Bibcode:2001cs.......11050S, doi:10.1145/380752.380813, ISBN 978-1-58113-349-3, S2CID 1471
  • Dadush, Daniel; Huiberts, Sophie (2018), "A friendly smoothed analysis of the simplex method", Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 390–403, arXiv:1711.05667, doi:10.1145/3188745.3188826, ISBN 9781450355599, S2CID 11868079
  • Borgwardt, Karl-Heinz; Damm, Renate; Donig, Rudolf; Joas, Gabriele (1993), "Empirical studies on the average efficiency of simplex variants under rotation symmetry", ORSA Journal on Computing, 5 (3), Operations Research Society of America: 249–260, doi:10.1287/ijoc.5.3.249
  • Borgwardt, Karl-Heinz (1987), The Simplex Method: A Probabilistic Analysis, Algorithms and Combinatorics, vol. 1, Springer-Verlag, doi:10.1007/978-3-642-61578-8, ISBN 978-3-540-17096-9
  • Manthey, Bodo (2021), Roughgarden, Tim (ed.), "Smoothed Analysis of Local Search", Beyond the Worst-Case Analysis of Algorithms, Cambridge: Cambridge University Press, pp. 285–308, doi:10.1017/9781108637435.018, ISBN 978-1-108-49431-1, S2CID 221680879, retrieved 2022-06-15
  • Englert, Matthias; Röglin, Heiko; Vöcking, Berthold (2007), "Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP", Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 68: 190–264, arXiv:2302.06889, doi:10.1007/s00453-013-9801-4
  • Arthur, David; Manthey, Bodo; Röglin, Heiko (2011), "Smoothed Analysis of the k-Means Method" (PDF), Journal of the ACM, 58 (5): 1–31, doi:10.1145/2027216.2027217, S2CID 5253105

harvard.edu

ui.adsabs.harvard.edu

nbn-resolving.org

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • Spielman, Daniel; Teng, Shang-Hua (2009), "Smoothed analysis: an attempt to explain the behavior of algorithms in practice" (PDF), Communications of the ACM, 52 (10), ACM: 76–84, doi:10.1145/1562764.1562785, S2CID 7904807
  • Spielman, Daniel; Teng, Shang-Hua (2001), "Smoothed analysis of algorithms", Proceedings of the thirty-third annual ACM symposium on Theory of computing, ACM, pp. 296–305, arXiv:cs/0111050, Bibcode:2001cs.......11050S, doi:10.1145/380752.380813, ISBN 978-1-58113-349-3, S2CID 1471
  • Dadush, Daniel; Huiberts, Sophie (2018), "A friendly smoothed analysis of the simplex method", Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 390–403, arXiv:1711.05667, doi:10.1145/3188745.3188826, ISBN 9781450355599, S2CID 11868079
  • Manthey, Bodo (2021), Roughgarden, Tim (ed.), "Smoothed Analysis of Local Search", Beyond the Worst-Case Analysis of Algorithms, Cambridge: Cambridge University Press, pp. 285–308, doi:10.1017/9781108637435.018, ISBN 978-1-108-49431-1, S2CID 221680879, retrieved 2022-06-15
  • Arthur, David; Manthey, Bodo; Röglin, Heiko (2011), "Smoothed Analysis of the k-Means Method" (PDF), Journal of the ACM, 58 (5): 1–31, doi:10.1145/2027216.2027217, S2CID 5253105

utwente.nl

ris.utwente.nl

yale.edu

cs-cs.yale.edu

  • Spielman, Daniel; Teng, Shang-Hua (2009), "Smoothed analysis: an attempt to explain the behavior of algorithms in practice" (PDF), Communications of the ACM, 52 (10), ACM: 76–84, doi:10.1145/1562764.1562785, S2CID 7904807