Miklós Ajtai

Miklós Ajtai
Miklós Ajtai
Nacimiento 2 de junio, 1946
Budapest, Bandera de Hungría Hungría
Nacionalidad Húngara
Campo Ciencias de la computación
Instituciones IBM Almaden Research Center
Alma máter Universidad Eötvös Loránd
Sociedades Academia de Ciencias de Hungría
Premios
destacados		 Premio Knuth

Miklós Ajtai (n. 2 de julio, 1946 en Budapest, Hungría), Ajtai Miklós en húngaro, es un informático teórico del Almaden Research Center de IBM. En 2003 recibió el Premio Knuth por sus numerosas contribuciones en el área de las ciencias de la computación.

Ajtai recibió su Ph.D. en 1976 en la Universidad Eötvös Loránd,[1] y desde 1995 ha sido miembro externo de la Academia de Ciencias de Hungría.

Artículos científicos destacables

  1. Ajtai, M. (1979), «Isomorphism and higher order equivalence», Annals of Mathematical Logic 16 (3): 181–203, doi:10.1016/0003-4843(79)90001-9 .
  2. Ajtai, M.; Komlós, J.; Szemerédi, E. (1982), «Largest random component of a k-cube», Combinatorica 2 (1): 1–7, doi:10.1007/BF02579276 .

Referencias

  1. ↑ Miklós Ajtai en el Mathematics Genealogy Project.

Enlaces externos


Wikimedia foundation. 2010.

Игры ⚽ Поможем сделать НИР

Mira otros diccionarios:

  • Miklós Ajtai — Miklos Ajtai Born 2 July 1946 Budapest, Second Republic of Hungary Residence San Jose, California, United States of America …   Wikipedia

  • Miklós Ajtai — (* 2. Juli 1946 in Budapest) ist ein ungarischer Informatiker. Ajtai wurde 1976 an der Loránd Eötvös Universität bei Andras Hajnal promoviert und lehrte dann selbst an der Universität. Er ist Wissenschaftler am IBM Almaden Research Center in San… …   Deutsch Wikipedia

  • Miklós Ajtai — (2 juillet 1946, Budapest, Hongrie ) est un chercheur en informatique au IBM Almaden Research Center. En 2003, il reçoit le prix Knuth pour ses nombreuses contributions au domaine, notamment un algorithme de tri par réseau, développé avec János… …   Wikipédia en Français

  • Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… …   Wikipedia

  • Премия Кнута — Гэри Миллер вручает премию 2008 года Фолькеру Штрассену Премия Кнута (англ.  …   Википедия

  • Knuth Prize — Gary Miller presents Volker Strassen with the 2008 Knuth Prize at SODA 2009. The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after Donald E. Knuth. Contents …   Wikipedia

  • Corners theorem — In mathematics, the corners theorem is an important result, proved by Miklós Ajtai and Endre Szemerédi, of a statement in arithmetic combinatorics. It states that for every ε > 0 there exists N such that given at least εN2 points in… …   Wikipedia

  • Covering problem of Rado — The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado. Formulation …   Wikipedia

  • Combinatorica — is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors in chief with Paul Erdős as honorary editor in chief. The… …   Wikipedia

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

Compartir el artículo y extractos

Link directo
… Do a right-click on the link above
and select “Copy Link”