Yahoo Search Búsqueda en la Web

Resultado de búsqueda

  1. László "Laci" Babai (born July 20, 1950, in Budapest) is a Hungarian professor of computer science and mathematics at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.

  2. László Babai, apodado Laci por sus colegas y nacido el 20 de julio de 1950 en Budapest, es catedrático de Matemática y Computación en la Universidad de Chicago. Su investigación se centra en la teoría de la complejidad computacional, algoritmos, combinatoria y los grupos finitos, haciendo hincapié en la interacción de estos campos.

  3. 9 de ene. de 2017 · Check the home page of the Computer Science Department at the University of Chicago. Contribute to Theory of Computing , a free online journal in theoretical computer science (free to readers and free to authors!), and see the number of citations to your work soar. Learn about Budapest Semesters in Mathematics, your passport to a career in ...

  4. László Babai. George and Elizabeth Yovovich Professor. Departments of Computer Science and Mathematics. Office: Ryerson 164. Office Phone: 773-702-3486. Department Email Address. laci@cs.uchicago.edu. Personal Website. http://people.cs.uchicago.edu/~laci/ Research.

  5. László Babai. Bruce V. and Diana M. Rauner Distinguished Service Professor of Computer Science, Mathematics. Overview. News. Contact Info. Email. laci@cs.uchicago.edu. Phone. (773) 702-3486. Office. Crerar 242. Website. https://people.cs.uchicago.edu/~laci. Research. Focus Areas: Discrete Mathematics, Theory.

  6. László Babai: Canonical form for graphs in quasipolynomial time: preliminary report In: Proc. 51st ACM STOC, 2019, pp 1237-1246. DOI: 10.1145/3313276.3316356 (NSF Grant #CCF-1718902) (© ACM Press) László Babai, Timothy J. F. Black, and Angela Wuu: List-Decoding Homomorphism Codes with Arbitrary Codomains.

  7. László Babai, apodado Laci por sus colegas y nacido el 20 de julio de 1950 en Budapest, es catedrático de Matemática y Computación en la Universidad de Chicago. Su investigación se centra en la teoría de la complejidad computacional, algoritmos, combinatoria y los grupos finitos, haciendo hincapié en la interacción de estos campos.