Sign In

Login

Password

Forgot Password ? Sign Up

Dependent random choice (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dependent random choice" in English language version.

refsWebsite
Global rank English rank
4doi.org
2nd place
2nd place
4worldcat.org
5th place
5th place
3semanticscholar.org
11th place
8th place
1handle.net
102nd place
76th place
1web.archive.org
1st place
1st place
1ucsd.edu
1,933rd place
1,342nd place
1psu.edu
207th place
136th place

doi.org

  • Fox, Jacob; Sudakov, Benny (2011). "Dependent random choice". Random Structures & Algorithms. 38 (1–2): 68–99. doi:10.1002/rsa.20344. hdl:1721.1/70097. ISSN 1098-2418. S2CID 2321395.
  • Kostochka, A. V.; Rödl, V. (2001). "On graphs with small Ramsey numbers*". Journal of Graph Theory. 37 (4): 198–204. CiteSeerX 10.1.1.225.1347. doi:10.1002/jgt.1014. ISSN 1097-0118. S2CID 12292577.
  • Sudakov, Benny (2003-05-01). "A few remarks on Ramsey–Turán-type problems". Journal of Combinatorial Theory. Series B. 88 (1): 99–106. doi:10.1016/S0095-8956(02)00038-2. ISSN 0095-8956.
  • Alon, Noga; Krivelevich, Michael; Sudakov, Benny (November 2003). "Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions". Combinatorics, Probability and Computing. 12 (5+6): 477–494. doi:10.1017/S0963548303005741. ISSN 1469-2163.

handle.net

hdl.handle.net

  • Fox, Jacob; Sudakov, Benny (2011). "Dependent random choice". Random Structures & Algorithms. 38 (1–2): 68–99. doi:10.1002/rsa.20344. hdl:1721.1/70097. ISSN 1098-2418. S2CID 2321395.

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • Fox, Jacob; Sudakov, Benny (2011). "Dependent random choice". Random Structures & Algorithms. 38 (1–2): 68–99. doi:10.1002/rsa.20344. hdl:1721.1/70097. ISSN 1098-2418. S2CID 2321395.
  • Verstraëte, Jacques (2015). "6 - Dependent Random Choice" (PDF). University of California San Diego. S2CID 47638896. Archived from the original (PDF) on 2017-05-19.
  • Kostochka, A. V.; Rödl, V. (2001). "On graphs with small Ramsey numbers*". Journal of Graph Theory. 37 (4): 198–204. CiteSeerX 10.1.1.225.1347. doi:10.1002/jgt.1014. ISSN 1097-0118. S2CID 12292577.

ucsd.edu

math.ucsd.edu

web.archive.org

worldcat.org

search.worldcat.org

  • Fox, Jacob; Sudakov, Benny (2011). "Dependent random choice". Random Structures & Algorithms. 38 (1–2): 68–99. doi:10.1002/rsa.20344. hdl:1721.1/70097. ISSN 1098-2418. S2CID 2321395.
  • Kostochka, A. V.; Rödl, V. (2001). "On graphs with small Ramsey numbers*". Journal of Graph Theory. 37 (4): 198–204. CiteSeerX 10.1.1.225.1347. doi:10.1002/jgt.1014. ISSN 1097-0118. S2CID 12292577.
  • Sudakov, Benny (2003-05-01). "A few remarks on Ramsey–Turán-type problems". Journal of Combinatorial Theory. Series B. 88 (1): 99–106. doi:10.1016/S0095-8956(02)00038-2. ISSN 0095-8956.
  • Alon, Noga; Krivelevich, Michael; Sudakov, Benny (November 2003). "Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions". Combinatorics, Probability and Computing. 12 (5+6): 477–494. doi:10.1017/S0963548303005741. ISSN 1469-2163.