Скот Аронсон (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Скот Аронсон" in Serbian language version.
refsWebsite
Global rank
Serbian rank
low place
low place
896th place
686th place
99th place
353rd place
low place
low place
412th place
901st place
low place
low place
3rd place
2nd place
305th place
325th place
arxiv.org
- Aaronson, Scott (2011). „Why Philosophers Should Care About Computational Complexity”. arXiv:1108.1791v3
[CC cs. CC].
bloomberg.com
- „Scott Aronson Profile”. www.bloomberg.com. Приступљено 2019-10-13.
books.google.com
- Automata, Computability and Complexity by Elaine Rich (2008) ISBN 0-13-228806-0, p. 589, section "The Complexity Zoo"
cambridge.org
- „Quantum Computing Democritus :: Quantum physics, quantum information and quantum computation”. cambridge.org. Приступљено 2014-01-23.
complexity-zoo.net
- The Complexity Zoo page (originally) at Qwiki (a quantum physics wiki, Stanford University)
nsf.gov
- „NSF Honors Two Early Career Researchers With Alan T. Waterman Award”. www.nsf.gov (на језику: енглески). Приступљено 2019-10-09.
scientificamerican.com
blogs.scientificamerican.com
- Horgan, John. „Scott Aaronson Answers Every Ridiculously Big Question I Throw at Him”. Scientific American Blog Network (на језику: енглески). Приступљено 2019-10-13.
scottaaronson.com
- „Shtetl-Optimized”. scottaaronson.com. Приступљено 2014-01-23.
- Aaronson, Scott. „Who Can Name the Bigger Number?”. academic personal website. Electrical Engineering and Computer Science, MIT. Приступљено 2014-01-02.
- „PHYS771 Quantum Computing Since Democritus”. scottaaronson.com. Приступљено 2014-01-23.
simonsfoundation.org
- „Simons Investigators”. Simons Foundation (на језику: енглески). Приступљено 2019-10-09.
theage.com.au
- Tadros, Edmund (2007-12-20). „Ad company settles plagiarism complaint”. The Age (на језику: енглески). Приступљено 2019-10-08.