Ramanujan graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ramanujan graph" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
69th place
59th place
11th place
8th place
451st place
277th place
5th place
5th place
4th place
4th place
6,111th place
3,868th place
513th place
537th place
18th place
17th place
8,783rd place
low place
741st place
577th place
565th place
460th place
3,707th place
2,409th place
6,413th place
4,268th place
5,032nd place
3,357th place
6,934th place
4,192nd place

ams.org

mathscinet.ams.org

arxiv.org

bham.ac.uk

pure-oai.bham.ac.uk

doi.org

harvard.edu

ui.adsabs.harvard.edu

iacr.org

eprint.iacr.org

mathnet.ru

nih.gov

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

princeton.edu

annals.math.princeton.edu

projecteuclid.org

quantamagazine.org

queensu.ca

mast.queensu.ca

semanticscholar.org

api.semanticscholar.org

  • Alexander Lubotzky; Ralph Phillips; Peter Sarnak (1988). "Ramanujan graphs". Combinatorica. 8 (3): 261–277. doi:10.1007/BF02126799. S2CID 206812625.
  • Lubetzky, Eyal; Peres, Yuval (2016-07-01). "Cutoff on all Ramanujan graphs". Geometric and Functional Analysis. 26 (4): 1190–1216. arXiv:1507.04725. doi:10.1007/s00039-016-0382-7. ISSN 1420-8970. S2CID 13803649.
  • Lubetzky, Eyal; Sly, Allan (2011-01-01). "Explicit Expanders with Cutoff Phenomena". Electronic Journal of Probability. 16 (none). arXiv:1003.3515. doi:10.1214/EJP.v16-869. ISSN 1083-6489. S2CID 9121682.
  • Eisenträger, Kirsten; Hallgren, Sean; Lauter, Kristin; Morrison, Travis; Petit, Christophe (2018), "Supersingular isogeny graphs and endomorphism rings: Reductions and solutions" (PDF), in Nielsen, Jesper Buus; Rijmen, Vincent (eds.), Advances in Cryptology – EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018, Proceedings, Part III (PDF), Lecture Notes in Computer Science, vol. 10822, Cham: Springer, pp. 329–368, doi:10.1007/978-3-319-78372-7_11, ISBN 978-3-319-78371-0, MR 3794837, S2CID 4850644

wolfram.com

mathworld.wolfram.com

worldcat.org

search.worldcat.org

yale.edu

cs.yale.edu