Sign In

Login

Password

Forgot Password ? Sign Up

Algorithmic Lovász local lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algorithmic Lovász local lemma" in English language version.

refsWebsite
Global rank English rank
2arxiv.org
69th place
59th place
2doi.org
2nd place
2nd place
1semanticscholar.org
11th place
8th place
1hpi-web.de
low place
low place

arxiv.org (Global: 69th place; English: 59th place)

  • Moser, Robin A.; Tardos, Gábor (2010). "A constructive proof of the general lovász local lemma". Journal of the ACM. 57 (2): 1. arXiv:0903.0544. doi:10.1145/1667053.1667060. S2CID 2813462.
  • Moser, Robin A. (2008). "A constructive proof of the Lovász Local Lemma". arXiv:0810.4812 [cs.DS]..

doi.org (Global: 2nd place; English: 2nd place)

  • Moser, Robin A.; Tardos, Gábor (2010). "A constructive proof of the general lovász local lemma". Journal of the ACM. 57 (2): 1. arXiv:0903.0544. doi:10.1145/1667053.1667060. S2CID 2813462.
  • Beck, József (1991), "An algorithmic approach to the Lovász Local Lemma. I", Random Structures and Algorithms, 2 (4): 343–366, doi:10.1002/rsa.3240020402.

hpi-web.de (Global: low place; English: low place)

eccc.hpi-web.de

  • Piotr Berman, Marek Karpinski and Alexander D. Scott, Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT ], ECCC TR 03-022(2003).

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

  • Moser, Robin A.; Tardos, Gábor (2010). "A constructive proof of the general lovász local lemma". Journal of the ACM. 57 (2): 1. arXiv:0903.0544. doi:10.1145/1667053.1667060. S2CID 2813462.