諾加·阿隆（；）是以色列數學家和普林斯頓大學數學教授，以對組合學和理論計算機科學的貢獻著稱。
現為美國普林斯頓大學數學教授
他是以色列科學與人文學院 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.
: 3rd, 2008.
文章
- 1996. The space complexity of approximating the frequency moments. (with Yossi Matias and Mario Szegedy) [http://dl.acm.org/citation.cfm?id=237823 ACM STOC '96].
: won their Gödel Prize in 2005.
- 1987. The monotone circuit complexity of Boolean functions. (with Ravi B Boppana). [https://link.springer.com/article/10.1007/BF02579196 Combinatorica 1987, Volume 7, Issue 1]
- 1986. Eigenvalues and expanders. [http://www.tau.ac.il/~nogaa/PDFS/Publications2/Eigenvalues%20and%20expanders.pdf Combinatorica 1986, Volume 6, Issue 2] .
獎項
參見
- Necklace splitting problem
- Color-coding
- List of Israel Prize recipients
- Alon–Boppana bound
參考文獻
外部鏈接
- [http://www.math.tau.ac.il/~nogaa/ 諾加阿隆的主頁]
*
- [https://zbmath.org/authors/?q=ai:alon.noga 數學文摘數據庫中作者的簡介]
- [https://scholar.google.com/citations?user=vOYlml40wAAAAJ&hl=en&oi=ao 其 Google 學術搜索], 其H指數有九十八。
评论 (0)