Noga Alon

Noga Alon
Noga Alon

Noga Alon
Born 1956
Nationality Israeli
Fields Mathematics
Theoretical computer science
Institutions Tel-Aviv University
Institute for Advanced Study
Microsoft Research, Herzeliya
Alma mater Hebrew University of Jerusalem
Doctoral advisor M. Perles
Doctoral students Yossi Azar
Uri Zwick
Michael Krivelevich
Benny Sudakov
Known for Combinatorial Nullstellensatz
Notable awards Israel Prize in Mathematics (2008)

Noga Alon (born 1956) (Hebrew: נוגה אלון‎) is an Israeli mathematician noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.


Academic background

Alon is a Baumritter Professor of Mathematics and Computer Science in Tel Aviv University, Israel. He received his Ph. D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Laboratories, Bellcore and Microsoft Research. He serves on the editorial boards of more than a dozen international journals, since 2008 he is the editor-in-chief of Random Structures and Algorithms. He has given lectures in many conferences, including plenary addresses in the 1996 European Congress of Mathematics and in the 2002 International Congress of Mathematicians, and a lecture in the 1990 International Congress of Mathematicians. He published more than four hundred research papers, mostly in Combinatorics and in Theoretical Computer Science, and one book.

Alon is the principal founder of the Combinatorial Nullstellensatz which has many applications in combinatorics and number theory.


Alon has received a number of awards, including the following:

  • the Erdős Prize in 1989;
  • the Feher prize in 1991;
  • the Pólya Prize in 2000;
  • the Bruno Memorial Award in 2001;
  • the Landau Prize in 2005;
  • the Gödel Prize in 2005;
  • the Israel Prize, for mathematics, in 2008[1][2]; and
  • the EMET Prize, for mathematics, in 2011.

In addition, Alon has been a member of the Israel Academy of Sciences and Humanities since 1997.

See also


External links

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Noga Alon — 2008 Noga Alon (hebräisch ‏נוגה אלון‎; Pseudonym Alon Nilli; * 1956) ist ein israelischer Mathematiker (Kombinatorik) und Informatiker. Alon promovierte 1983 an der Hebräischen Universität Jerusalem bei Micha Perle …   Deutsch Wikipedia

  • Noga Alon — Nacimiento 1956  Israel Nacio …   Wikipedia Español

  • Alon — can be several things: * Alon (אַלוֹן (Hebrew)), a Hebrew name meaning oak as in oak tree * Alon Corporation, an aircraft manufacturer * Alon USA Corporation, Oil Company * aluminium oxynitride (AlON), known under the trade name ALON * Noga Alon …   Wikipedia

  • Alon — ist der Nachname von mehreren Personen: Nir Alon (* 1964), israelischer Installationskünstler Noga Alon (* 1956), israelischer Mathematiker Roy Alon (1942–2006), britischer Stuntman und Schauspieler Sonstiges Alon Israel Oil Company, israelisches …   Deutsch Wikipedia

  • Restricted sumset — In additive number theory and combinatorics, a restricted sumset has the form where are finite nonempty subsets of a field F and is a polynomial over F. When …   Wikipedia

  • Necklace splitting problem — In mathematics, and in particular combinatorics, the necklace splitting problem arises in a variety of contexts including exact division; its picturesque name is due to mathematicians Noga Alon [1] and Douglas B. West.[2] Suppose a necklace, open …   Wikipedia

  • Théorème de Borsuk-Ulam — En mathématiques, le théorème de Borsuk Ulam est un résultat de topologie algébrique. Il indique que pour toute fonction f continue d une sphère de dimension n, c est à dire la frontière de la boule euclidienne de Rn+1, dans un espace euclidien… …   Wikipédia en Français

  • Prix Gödel — Nommé en l honneur du logicien Kurt Gödel, le prix Gödel a été créé en 1992 par l European Association for Theoretical Computer Science (EATCS), l Association for Computing Machinery (ACM) et le groupe de l ACM sur l algorithmique et la théorie… …   Wikipédia en Français

  • Color-coding — For other uses, see Color code. In computer science and graph theory, the method of color coding[1][2] efficiently finds k vertex simple paths, k vertex cycles, and other small subgraphs within a given graph using probabilistic algorithms, which… …   Wikipedia

  • Testeur de propriété — En mathématiques, un testeur de propriété est un algorithme probabiliste qui a pour objectif de déterminer si un objet donné (un graphe, ou une fonction par exemple) possède une propriété fixée. Sommaire 1 Définition formelle 2 Intérêt 3… …   Wikipédia en Français

Share the article and excerpts

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

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.