Nathan Netanyahu

Nathan S. Netanyahu
נָתָן נְתַנְיָהוּ
Born (1951-11-28) November 28, 1951 (age 72)
Alma materUniversity of Maryland, College Park
Known forNearest neighbor search, k-means clustering, computer chess, image registration
Scientific career
FieldsComputer Science
InstitutionsBar-Ilan University
Doctoral advisorDavid Mount, Azriel Rosenfeld

Nathan S. Netanyahu (Hebrew: נָתָן נְתַנְיָהוּ; born 28 November 1951) is an Israeli computer scientist and a professor of computer science at Bar-Ilan University.[1]

Netanyahu is the son of mathematician Elisha Netanyahu and Supreme Court of Israel justice Shoshana Netanyahu, the nephew of historian Benzion Netanyahu, and the cousin of current Prime Minister of Israel Benjamin Netanyahu. He did his graduate studies at the University of Maryland, College Park, earning a Ph.D. in 1992 under the supervision of David Mount and Azriel Rosenfeld.[2]

Netanyahu has co-authored highly cited research papers on nearest neighbor search[3] and k-means clustering.[4] He has published many papers on computer chess, was the local organizer of the 12th World Computer Chess Championship in 2004, and was program co-chair for the 4th International Conference on Computers and Games, colocated with the WCCC. Another frequent topic in his research is image registration.

  1. ^ Faculty profile Archived 2019-02-12 at the Wayback Machine, Bar-Ilan University, retrieved 2012-02-29.
  2. ^ Nathan S. Netanyahu at the Mathematics Genealogy Project.
  3. ^ Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela Y. (1998), "An optimal algorithm for approximate nearest neighbor searching fixed dimensions", Journal of the ACM, 45 (6): 891–923, doi:10.1145/293347.293348, S2CID 8193729.
  4. ^ Kanungo, Tapas; Mount, David M.; Netanyahu, Nathan S.; Piatko, Christine D.; Silverman, Ruth; Wu, Angela Y. (2002), "An efficient k-means clustering algorithm: analysis and implementation", IEEE Trans. Pattern Anal. Mach. Intell., 24 (7): 881–892, doi:10.1109/TPAMI.2002.1017616, S2CID 12003435.