Michael Sipser (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Michael Sipser" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

3mit.edu

415^th place

327^th place

2semanticscholar.org

11^th place

8^th place

2ams.org

451^st place

277^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1web.archive.org

1^st place

1amacad.org

3,464^th place

2,377^th place

1acm.org

1,185^th place

840^th place

1berkeley.edu

580^th place

462^nd place

1yale.edu

565^th place

460^th place

1worldcat.org

5^th place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1nih.gov

4^th place

acm.org

ACM Recognizes 2017 Fellows for Making Transformative Contributions and Advancing Technology in the Digital Age, Association for Computing Machinery, December 11, 2017, retrieved 2017-11-13

amacad.org

"Membership". American Academy of Arts and Sciences. Retrieved 23 September 2014.

ams.org

2016 Class of the Fellows of the AMS, American Mathematical Society, retrieved 2015-11-16.

mathscinet.ams.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.

arxiv.org

Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam; Sipser, Michael (2000-01-28). "Quantum Computation by Adiabatic Evolution". arXiv:quant-ph/0001106.

berkeley.edu

simons.berkeley.edu

"Research Vignette: Hard Problems All The Way Up | Simons Institute for the Theory of Computing". simons.berkeley.edu. 30 July 2015. Retrieved 2015-09-17.

doi.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.
Sipser, Michael (1986). "Expanders, randomness, or time versus space". Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986. Lecture Notes in Computer Science. Vol. 223. pp. 325–329. doi:10.1007/3-540-16486-3_108. ISBN 978-3-540-16486-9.
Sipser, Michael; Spielman, Daniel (1996). "Expander Codes" (PDF). IEEE Transactions on Information Theory. 42 (6): 1710–1722. doi:10.1109/18.556667.
Lichtenstein, David; Sipser, Michael (1980-04-01). "GO Is Polynomial-Space Hard". J. ACM. 27 (2): 393–401. doi:10.1145/322186.322201. ISSN 0004-5411. S2CID 29498352.
Pavlus, John (2012-01-01). "Machines of the Infinite". Scientific American. 307 (3): 66–71. Bibcode:2012SciAm.307c..66P. doi:10.1038/scientificamerican0912-66. PMID 22928263.

harvard.edu

ui.adsabs.harvard.edu

Pavlus, John (2012-01-01). "Machines of the Infinite". Scientific American. 307 (3): 66–71. Bibcode:2012SciAm.307c..66P. doi:10.1038/scientificamerican0912-66. PMID 22928263.

mathgenealogy.org

Michael Sipser at the Mathematics Genealogy Project

mit.edu

nih.gov

pubmed.ncbi.nlm.nih.gov

Pavlus, John (2012-01-01). "Machines of the Infinite". Scientific American. 307 (3): 66–71. Bibcode:2012SciAm.307c..66P. doi:10.1038/scientificamerican0912-66. PMID 22928263.

semanticscholar.org

api.semanticscholar.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.
Lichtenstein, David; Sipser, Michael (1980-04-01). "GO Is Polynomial-Space Hard". J. ACM. 27 (2): 393–401. doi:10.1145/322186.322201. ISSN 0004-5411. S2CID 29498352.

web.archive.org

MIT Mathematics | People Directory Archived 2008-12-18 at the Wayback Machine

worldcat.org

Lichtenstein, David; Sipser, Michael (1980-04-01). "GO Is Polynomial-Space Hard". J. ACM. 27 (2): 393–401. doi:10.1145/322186.322201. ISSN 0004-5411. S2CID 29498352.

yale.edu

cs.yale.edu

Sipser, Michael; Spielman, Daniel (1996). "Expander Codes" (PDF). IEEE Transactions on Information Theory. 42 (6): 1710–1722. doi:10.1109/18.556667.

Michael Sipser (English Wikipedia)

acm.org

amacad.org

ams.org

ams.org

mathscinet.ams.org

arxiv.org

berkeley.edu

simons.berkeley.edu

doi.org

harvard.edu

ui.adsabs.harvard.edu

mathgenealogy.org

mit.edu

newsoffice.mit.edu

www-math.mit.edu

libraries.mit.edu

nih.gov

pubmed.ncbi.nlm.nih.gov

semanticscholar.org

api.semanticscholar.org

web.archive.org

worldcat.org

yale.edu

cs.yale.edu