Babai László (Hungarian Wikipedia)

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

refsWebsite

Global rank Hungarian rank

3uchicago.edu

230^th place

405^th place

2web.archive.org

1^st place

1sigact.org

low place

1calendar.google.com

low place

1rjlipton.wordpress.com

low place

1technologyreview.com

1,943^rd place

5,021^st place

1youtube.com

9^th place

10^th place

1arxiv.org

69^th place

778^th place

1books.google.com

3^rd place

28^th place

1springer.com

274^th place

438^th place

1subwiki.org

low place

1stackexchange.com

1,983^rd place

3,510^th place

1mta.hu

low place

110^th place

arxiv.org

László Babai. Graph Isomorphism in Quasipolynomial Time, 84 pages / abstract // arXiv.org > cs > arXiv:1512.03547 / version 1 [v1] Fri, 11 Dec 2015 08:04:26 GMT

books.google.com

Definition 2.3. String Isomorphism, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan / Lecture Notes in Computer Science / Volume 5540, Springer Verlag, 2009

calendar.google.com

Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time I: The "Local Certificates Algorithm" // Combinatorics and Theoretical Computer Science seminar, 10 November 2015, 15:00 – 16:00

mta.hu

Babai László nyerte a Knuth-díjat, a számítástudomány rangos elismerését

rjlipton.wordpress.com

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

sigact.org

https://sigact.org/prizes/g%C3%B6del.html

springer.com

Definition 2.3. String Isomorphism, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan / Lecture Notes in Computer Science / Volume 5540, Springer Verlag, 2009

stackexchange.com

cstheory.stackexchange.com

Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange, asked Sep 25 2014 at 9:43

subwiki.org

groupprops.subwiki.org

Coset intersection problem // The Group Properties Wiki (beta)

technologyreview.com

Claimed Breakthrough Slays Classic Computing Problem Archiválva 2016. január 22-i dátummal a Wayback Machine-ben // MIT Technology Review, by Tom Simonite on November 13, 2015

uchicago.edu

people.cs.uchicago.edu

Curriculum Vitae a Chicagói Egyetem honlapján

math.uchicago.edu

Combinatorics and Theoretical Computer Science Archiválva 2015. december 22-i dátummal a Wayback Machine-ben calendar // Theoretical Computer Science at the University of Chicago. November 24, 2015, Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time II: The "Split-or-Johnson routine" (Combinatorics and TCS seminar)

theory.cs.uchicago.edu

Combinatorics and Theoretical Computer Science Archiválva 2015. december 22-i dátummal a Wayback Machine-ben calendar // Theoretical Computer Science at the University of Chicago. November 24, 2015, Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time II: The "Split-or-Johnson routine" (Combinatorics and TCS seminar)

web.archive.org

Combinatorics and Theoretical Computer Science Archiválva 2015. december 22-i dátummal a Wayback Machine-ben calendar // Theoretical Computer Science at the University of Chicago. November 24, 2015, Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time II: The "Split-or-Johnson routine" (Combinatorics and TCS seminar)
Claimed Breakthrough Slays Classic Computing Problem Archiválva 2016. január 22-i dátummal a Wayback Machine-ben // MIT Technology Review, by Tom Simonite on November 13, 2015

youtube.com

Graph Isomorphism in Quasipolynomial Time I, seminar lecture by László Babai on November 10, 2015. The University of Chicago // youtube, 1 год. 40 хв. Опубліковано 10 грудня 2015