Sanjeev Arora (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sanjeev Arora" in English language version.

refsWebsite

Global rank English rank

741^st place

577^th place

3web.archive.org

1^st place

1^st place

7,948^th place

5,350^th place

1,185^th place

840^th place

207^th place

136^th place

2^nd place

2^nd place

1simonsfoundation.org

low place

low place

acm.org

fellows.acm.org

ACM: Fellows Award / Sanjeev Arora Archived 2011-08-23 at the Wayback Machine

doi.org

Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009). "Expander flows, geometric embeddings and graph partitioning". Journal of the ACM. 56 (2): 1–37. CiteSeerX 10.1.1.310.2258. doi:10.1145/1502793.1502794.

ias.edu

Institute for Advanced Study: A Community of Scholars Archived 2013-01-06 at the Wayback Machine

princeton.edu

cs.princeton.edu

"Sanjeev Arora". www.cs.princeton.edu.
"Professor Sanjeev Arora Elected to the National Academy of Sciences - Computer Science Department at Princeton University". www.cs.princeton.edu.
"Sanjeev Arora". www.cs.princeton.edu. Retrieved 2023-11-02.
Arora, S, Barak, B, Brunnemeier, M 2011 "Computational Complexity and Information Asymmetry in Financial Products" Communications of the ACM, Issue 5 see FAQ Archived 2012-12-02 at the Wayback Machine

intractability.princeton.edu

"Video Archive". intractability.princeton.edu.

psu.edu

citeseerx.ist.psu.edu

Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009). "Expander flows, geometric embeddings and graph partitioning". Journal of the ACM. 56 (2): 1–37. CiteSeerX 10.1.1.310.2258. doi:10.1145/1502793.1502794.

simonsfoundation.org

Simons Investigators Awardees, The Simons Foundation

web.archive.org

Institute for Advanced Study: A Community of Scholars Archived 2013-01-06 at the Wayback Machine
ACM: Fellows Award / Sanjeev Arora Archived 2011-08-23 at the Wayback Machine
Arora, S, Barak, B, Brunnemeier, M 2011 "Computational Complexity and Information Asymmetry in Financial Products" Communications of the ACM, Issue 5 see FAQ Archived 2012-12-02 at the Wayback Machine