László Babai (Uzbek Wikipedia)

Analysis of information sources in references of the Wikipedia article "László Babai" in Uzbek language version.

refsWebsite

Global rank Uzbek rank

2^nd place

3^rd place

230^th place

399^th place

1web.archive.org

1^st place

1^st place

1quantamagazine.org

6,413^th place

5,682^nd place

1theoryofcomputing.org

low place

low place

1rjlipton.wordpress.com

low place

low place

69^th place

186^th place

1semanticscholar.org

11^th place

82^nd place

3,464^th place

6,953^rd place

amacad.org

American Academy of Arts and Sciences. 2015 Fellows and Their Affiliations

arxiv.org

Babai, László (2016), „Graph Isomorphism in Quasipolynomial Time [Extended Abstract]“, Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, 684–697-bet, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

doi.org

Babai, László; Moran, Shlomo (1988), „Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class“, J. Comput. Syst. Sci., 36-jild, № 2, 254–276-bet, doi:10.1016/0022-0000(88)90028-1.
Cho, Adrian (November 10, 2015), „Mathematician claims breakthrough in complexity theory“, Science, doi:10.1126/science.aad7416
Babai, László (2016), „Graph Isomorphism in Quasipolynomial Time [Extended Abstract]“, Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, 684–697-bet, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

quantamagazine.org

Klarreich. „Landmark Algorithm Breaks 30-Year Impasse“. quantamagazine.org. Quanta Magazine (2015-yil 14-dekabr).

rjlipton.wordpress.com

A Big Result On Graph Isomorphism // November 4, 2015, A Fast Graph Isomorphism Algorithm // November 11, 2015

semanticscholar.org

api.semanticscholar.org

Babai, László (2016), „Graph Isomorphism in Quasipolynomial Time [Extended Abstract]“, Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, 684–697-bet, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

theoryofcomputing.org

Theory of Computing editors, retrieved 2010-07-30.

uchicago.edu

people.cs.uchicago.edu

Babai, László (1979), Monte-Carlo algorithms in graph isomorphism testing (PDF), Tech. Report, Université de Montréal.
László Babai: Fixing the UPCC case of Split-or-Johnson, posted on 14 January 2017

web.archive.org

Curriculum vitae from Babai’s web site, retrieved 2016-01-28.