诺加·阿隆

诺加·阿隆（希伯来语：נוגה אלון；1956年2月17日出生）是以色列数学家和普林斯顿大学数学教授，以对组合学和理论计算机科学的贡献著称。

诺加·阿隆
出生	(1956-02-17) 1956年2月17日（69岁）  以色列海法
国籍	以色列
母校	耶路撒冷希伯来大学
知名于	Combinatorial Nullstellensatz
奖项	George Pólya Prize (2000) Gödel Prize (2005) Israel Prize in Mathematics (2008) Shaw Prize (2022)
网站	www.math.tau.ac.il/~nogaa/
科学生涯
研究领域	数学 理论计算机科学
机构	特拉维夫大学 普林斯顿高等研究院 海尔兹利亚微软研究院
论文	Extremal Problems in Combinatorics（1983）
博士导师	米查·珀尔斯（英语：Micha Perles）
博士生	Gregory Gutin Michael Krivelevich Benny Sudakov Uri Zwick

现为美国普林斯顿大学数学教授^[1]和以色列特拉维夫大学数学和计算机科学鲍姆里特荣休教授。^[1]

他是以色列科学与人文学院^[1]和欧洲科学院院士。^[1]

他亦是匈牙利科学院荣誉院士。^[1]

学术背景

已隐藏部分未翻译内容，欢迎参与翻译。

Alon is a Professor of Mathematics at Princeton University and a Baumritter Professor Emeritus of Mathematics and Computer Science at Tel Aviv University, Israel. He graduated from the Hebrew Reali School in 1974 and 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 Labs, 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, the 2009 Turán Memorial Lectures,^[2] and a lecture in the 1990 International Congress of Mathematicians.

研究

已隐藏部分未翻译内容，欢迎参与翻译。

Alon has published more than five hundred research papers, mostly in combinatorics and in theoretical computer science, and one book. He has also published under the pseudonym "A. Nilli".

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

精选作品

书籍

已隐藏部分未翻译内容，欢迎参与翻译。

• 1992. The Probabilistic Method. (with Joel Spencer) Wiley.

2nd, 2004. ISBN 978-0-471-65398-1

3rd, 2008. ISBN 978-0-470-17020-5

文章

已隐藏部分未翻译内容，欢迎参与翻译。

• 1996. The space complexity of approximating the frequency moments. (with Yossi Matias and Mario Szegedy) ACM STOC '96.

won their Gödel Prize in 2005.

• 1987. The monotone circuit complexity of Boolean functions. (with Ravi B Boppana). Combinatorica 1987, Volume 7, Issue 1 （页面存档备份，存于互联网档案馆）
• 1986. Eigenvalues and expanders. Combinatorica 1986, Volume 6, Issue 2 （页面存档备份，存于互联网档案馆）.

奖项

参见

已隐藏部分未翻译内容，欢迎参与翻译。

• Necklace splitting problem
• Color-coding
• List of Israel Prize recipients
• Alon–Boppana bound