Andrei Broder

from Wikipedia, the free encyclopedia
Andrei Broder

Andrei Zary Broder is an Israeli computer scientist who deals with search engines and the algorithms required for them. He is a Distinguished Scientist at Google and Google .

Broder studied at the Technion with a bachelor's degree summa cum laude and received his doctorate in 1985 from Donald Knuth at Stanford University . He was at IBM Research, where he became a Distinguished Engineer and Chief Technical Officer (CTO) of the Institute for Search and Text Analysis at IBM. He then went to AltaVista , where he was Vice President Research, and then (2005) as Research Fellow and Vice President Computational Advertising at Yahoo before moving to Google in 2012.

With the problem of identifying websites with similar content (and generally closely related documents), he introduced a new hashing technique (Locality Sensitive Hashing, LSH) using Minhash functions in 1997/98 . This was extended by Piotr Indyk and Rajeev Motwani with further hash functions, whereby they found nearest-neighbor search algorithms with sub-linear response times, and Moses S. Charikar found another group of very efficient LSH functions (Simhash functions). The methods were widely used in computer science (computer vision, data mining, databases, machine learning, signal processing).

Broder is said to have been one of the first at AltaVista to introduce a captcha . He has published over 100 papers and holds 39 US patents (2013).

In 2012 he received the Paris Kanellakis Prize for LSH with Moses S. Charikar and Piotr Indyk . In 2007 he became a Fellow of the Association for Computing Machinery (ACM) and is an IEEE Fellow . Broder is a member of the National Academy of Engineering .

Web links

Individual evidence

  1. Broder On the resemblance and containment of documents , Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, 11. – 13. June, 1997, IEEE, pp. 21-29
  2. ^ AZ Broder, M. Charikar, AM Frieze, M. Mitzenmacher Min-wise independent permutations , Proceedings of the thirtieth annual ACM symposium on Theory of Computing, 1998, pp. 327-336