Top Qs
Timeline
Chat
Perspective
Noga Alon
Israeli mathematician From Wikipedia, the free encyclopedia
Remove ads
Noga M. 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.
Remove ads
Education and career
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, Alon 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 awarded the Florence and Ted Baumritter Combinatorics and Computer Science Chair.[1] He retired as professor emeritus from Tel Aviv and became a professor at Princeton University in 2018.[3]
He was editor-in-chief of the journal Random Structures and Algorithms from 2008 through 2023.[4]
Remove ads
Research
Alon has published more than five hundred research papers, mostly in combinatorics and in theoretical computer science, and one book, on the probabilistic method.[5][6]He has also published under the pseudonym "A. Nilli", based on the name of his daughter Nilli Alon.[7]
His research contributions include the combinatorial Nullstellensatz, an algebraic tool with 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.
Remove ads
Selected works
Book
- The Probabilistic Method, with Joel Spencer, Wiley, 1992. 2nd ed., 2000; 3rd ed., 2008; 4th ed., 2016.[8]
Research articles
- Alon, N. (1986). "Eigenvalues and expanders". Combinatorica. 6 (2): 83–96. doi:10.1007/BF02579166. MR 0875835. S2CID 41083612.
- Alon, N.; Boppana, R. B. (1987). "The monotone circuit complexity of Boolean functions". Combinatorica. 7 (1): 1–22. doi:10.1007/BF02579196. MR 0905147. S2CID 17397273.
- Alon, Noga (1987). "Splitting necklaces". Advances in Mathematics. 63 (3): 247–253. doi:10.1016/0001-8708(87)90055-7. MR 0877785.
- Alon, Noga; Kleitman, Daniel J (1992). "Piercing convex sets and the Hadwiger–Debrunner (p, q)-problem". Advances in Mathematics. 96 (1): 103–112. doi:10.1016/0001-8708(92)90052-M. MR 1185788.
- Alon, Noga; Yuster, Raphael; Zwick, Uri (1995). "Color-coding". Journal of the ACM. 42 (4): 844–856. doi:10.1145/210332.210337. MR 1411787. S2CID 208936467.
- Alon, Noga; Matias, Yossi; Szegedy, Mario (1999). "The space complexity of approximating the frequency moments". Journal of Computer and System Sciences. 58 (1, part 2): 137–147. doi:10.1006/jcss.1997.1545. MR 1688610. Previously in the ACM Symposium on Theory of Computing (STOC), 1996.
- Alon, Noga (1999). "Combinatorial Nullstellensatz". Combinatorics, Probability and Computing. 8 (1–2): 7–29. doi:10.1017/S0963548398003411. MR 1684621. S2CID 209877602.
Awards
Summarize
Perspective
 |
Alon has received a number of awards, including the following:
- 1989 – Erdős Prize;[9]
- 2000 – George Pólya Prize in Applied Combinatorics of the Society for Industrial and Applied Mathematics[10]
- 2001 – Michael Bruno Memorial Award of the Israel Institute for Advanced Studies;[11]
- 2005 – Gödel Prize, with Yossi Matias and Mario Szegedy, for their paper "The space complexity of approximating the frequency moments" on streaming algorithms[12]
- 2008 – Israel Prize, for mathematics.[13][14]
- 2011 – EMET Prize, with Saharon Shelah, for mathematics.[15]
- 2019 – Paris Kanellakis Award, with Phillip Gibbons, Yossi Matias and Mario Szegedy, "for foundational work on streaming algorithms and their application to large scale data analytics"[16]
- 2021 – Leroy P. Steele Prize for Mathematical Exposition, with Joel Spencer, for The Probabilistic Method[17]
- 2022 – Shaw Prize in Mathematical Sciences, with Ehud Hrushovski, "for their remarkable contributions to discrete mathematics and model theory with interaction notably with algebraic geometry, topology and computer sciences"[18]
- 2022 – Knuth Prize, "for foundational contributions in combinatorics and graph theory and applications to fundamental topics in computer science"[19]
- 2024 – Wolf Prize in Mathematics "for his fundamental contributions to Combinatorics and Theoretical Computer Science”.[citation needed]
Alon gave plenary addresses at the 1996 European Congress of Mathematics, at the 2002 International Congress of Mathematicians,[4] at the 2009 Turán Memorial Lectures,[20] 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.[21] He was given an honorary doctorate by ETH Zurich in 2013[22] and by the University of Waterloo in 2015.[23]
In addition, Alon has been a member of the Israel Academy of Sciences and Humanities since 1997.[24] He was elected to the Academia Europaea in 2008.[4] In 2015 he was elected as a fellow of the American Mathematical Society.[25] In 2017 he became a Fellow of the Association for Computing Machinery.[26] In 2019 he was named an honorary member of the Hungarian Academy of Sciences.[27]
In 2024, Alon gave the opening plenary talk on "Distance problems for typical norms" at the 33rd Cumberland Conference on Combinatorics, Graph Theory, and Computing at Mississippi State University.[28]
Remove ads
See also
References
External links
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads