“Nati Linial”的意思、由来-开放百科全书

词条

Nati Linial

释义

Selected publications
References

{{Use dmy dates|date=October 2013}}Nathan (Nati) Linial (born 1953 in Haifa, Israel)^[1] is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem,^[1] and an ISI highly cited researcher.^[2]

Linial did his undergraduate studies at the Technion, and received his PhD in 1978 from the Hebrew University under the supervision of Micha Perles.^[1]^[3] He was a postgraduate researcher at the University of California, Los Angeles before returning to the Hebrew University as a faculty member.^[1]

In 2012 he became a fellow of the American Mathematical Society.^[4]

Selected publications

{{citation

{{citation

| last1 = Borodin | first1 = Allan | author1-link = Allan Borodin
| last2 = Linial | first2 = Nathan
| last3 = Saks | first3 = Michael E. | author3-link = Michael Saks (mathematician)
| doi = 10.1145/146585.146588
| issue = 4
| journal = J. ACM
| pages = 745–763
| title = An optimal on-line algorithm for metrical task system
| volume = 39
| year = 1992}}. This paper on competitive analysis of online algorithms studies metrical task systems, a very general model of tasks where decisions on how to service a sequence of requests must be made without knowledge of future requests. It introduces the metrical task system model, describes how to use it to model various scheduling problems, and develops an algorithm that in many situations can be shown to perform optimally.

{{citation

| last1 = Linial | first1 = Nathan
| last2 = Mansour | first2 = Yishay
| last3 = Nisan | first3 = Noam | author3-link = Noam Nisan
| doi = 10.1145/174130.174138
| issue = 3
| journal = J. ACM
| pages = 607–620
| title = Constant depth circuits, Fourier transform, and learnability
| volume = 40
| year = 1993}}. By performing harmonic analysis on functions in the complexity class AC⁰ (a class representing highly parallelizable computational problems), Linial and his co-authors show that these functions behave poorly as pseudorandom number generators, can be approximated well by polynomials, and can be learned efficiently by machine learning systems.

{{citation

| last1 = Linial | first1 = Nathan
| last2 = London | first2 = Eran
| last3 = Rabinovich | first3 = Yuri
| doi = 10.1007/BF01200757
| issue = 2
| journal = Combinatorica
| pages = 215–245
| title = The geometry of graphs and some of its algorithmic applications
| volume = 15
| year = 1995}}. Linial's most-cited paper according to Google scholar, this paper explores connections between graph-theoretic problems such as the multi-commodity flow problem and low-distortion embeddings of metric spaces into low-dimensional spaces such as those given by the Johnson–Lindenstrauss lemma.

{{citation

| last1 = Hoory | first1 = Shlomo
| last2 = Linial | first2 = Nathan
| last3 = Wigderson | first3 = Avi | author3-link = Avi Wigderson
| doi = 10.1090/S0273-0979-06-01126-8
| mr = 2247919
| issue = 4
| journal = Bulletin of the American Mathematical Society
| pages = 439–561
| title = Expander graphs and their applications
| volume = 43
| year = 2006}}. In 2008 Linial and his co-authors won the Levi L. Conant Prize of the American Mathematical Society for best mathematical exposition for this article, a survey on expander graphs.^[6]

References

1. ^Linial's home page at the Hebrew University, retrieved 2010-09-08.
2. ^ISI Web of Knowledge, retrieved 2010-09-08.
3. ^{{mathgenealogy|id=63895|name=Nati Linial}}
4. ^List of Fellows of the American Mathematical Society, retrieved 2013-01-27.
5. ^2013 Edsger W. Dijkstra Prize in Distributed Computing
6. ^¹²³{{citation | issue = 4 | journal = Notices of the American Mathematical Society | pages = 491–493 | title = 2008 Conant Prize | url = http://www.ams.org/notices/200804/tx080400491p.pdf | volume = 55 | year = 2008}}.

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。