Loading AI tools
Israeli mathematician From Wikipedia, the free encyclopedia
Noga Alon (Hebrew: נוגה אלון; born 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
Noga Alon | |
|---|---|
נוגה אלון | |
Noga Alon | |
| Born | 1956 (age 67–68) Israel |
| Alma mater | Hebrew University of Jerusalem |
| Known for | Combinatorial Nullstellensatz |
| Awards | George Pólya Prize (2000) Gödel Prize (2005) Israel Prize in Mathematics (2008) Shaw Prize (2022) Wolf Prize in Mathematics (2024) |
| Scientific career | |
| Fields | Mathematics Theoretical computer science |
| Institutions | Tel Aviv University Institute for Advanced Study Microsoft Research, Herzeliya Princeton University |
| Thesis | Extremal Problems in Combinatorics (1983) |
| Doctoral advisor | Micha Perles |
| Doctoral students | |
| Website | www |
Alon was born in 1956 in Haifa, where he graduated from the Hebrew Reali School in 1974. He graduated summa cum laude from the Technion – Israel Institute of Technology in 1979, earned a master's degree in mathematics in 1980 from Tel Aviv University,[1] and received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 1983 with the dissertation Extremal Problems in Combinatorics supervised by Micha Perles.[2]
After postdoctoral research at the Massachusetts Institute of Technology he returned to Tel Aviv University as a senior lecturer in 1985, obtained a permanent position as an associate professor there in 1986, and was promoted to full professor in 1988. He was head of the School of Mathematical Science from 1999 to 2001, and was given the Florence and Ted Baumritter Combinatorics and Computer Science Chair,[1] before retiring as professor emeritus and moving to Princeton University in 2018.[3]
He was editor-in-chief of the journal Random Structures and Algorithms from 2008 through 2023.[4]
Alon has published more than five hundred research papers, mostly in combinatorics and in theoretical computer science, and one book, on the probabilistic method. He has also published under the pseudonym "A. Nilli", based on the name of his daughter Nilli Alon.[5]
His research contributions include the combinatorial Nullstellensatz, an algebraic tool with many applications in combinatorics; color-coding, a technique for fixed-parameter tractability of pattern-matching algorithms in graphs; and the Alon–Boppana bound in spectral graph theory.
Alon has received a number of awards, including the following:
Alon gave plenary addresses in the 1996 European Congress of Mathematics and in the 2002 International Congress of Mathematicians,[4] the 2009 Turán Memorial Lectures,[18] and a lecture in the 1990 International Congress of Mathematicians.[4] In 2015 he gave the Łojasiewicz Lecture (on the "Signrank and its applications in combinatorics and complexity") at the Jagiellonian University in Kraków.[19] He was given an honorary doctorate by ETH Zurich in 2013[20] and by the University of Waterloo in 2015.[21]
In addition, Alon has been a member of the Israel Academy of Sciences and Humanities since 1997.[22] He was elected to the Academia Europaea in 2008.[4] In 2015 he was elected as a fellow of the American Mathematical Society.[23] In 2017 he became a Fellow of the Association for Computing Machinery.[24] In 2019 he was named an honorary member of the Hungarian Academy of Sciences.[25]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
