Andrei Broder

Andrei Broder

Andrei Zary Broder ( _he. אנדרי זרי ברודר) is a Research Fellow and Vice President of Emerging Search Technology for Yahoo!. He previously has worked for AltaVista as the vice president of research, and for IBM Research as a Distinguished Engineer and CTO of IBM's Institute for Search and Text Analysis.

Broder's research centers around the internet, and internet searching. He is credited with being one of the first people to develop a CAPTCHA, while working for AltaVista. He also participated in the development of a near-duplicate detection algorithm, and of the bow-tie model of the web graph.

Broder earned his bachelor's degree ("summa cum laude") from the Technion in Israel, and a master's degree and Ph.D. (1985) from Stanford University, where his advisor was Donald Knuth. He is a fellow of ACM and IEEE.

References

*cite web
last = Broder
first = Andrei
year = 2006
url = http://www.ysearchblog.com/archives/000257.html
title = Interview: "Search without a Box"
format =
publisher = Yahoo! Search Blog
accessdate = 2006-03-04
*cite web
year = 2005
url = http://docs.yahoo.com/docs/pr/release1271.html
title = Yahoo! Appoints Dr. Andrei Broder as Research Fellow
format =
publisher = Yahoo! Press Release
accessdate = 2006-03-04
*cite web
year = 2006
url = http://www.youtube.com/watch?v=Z-v6Oxg_nS8
title = Interview in Barcelona: Workshop The Future of Web Search
format = Video
publisher = OJObuscador
accessdate = 2006-05-20


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Broder — is the surname of: * Andrei Broder * Andrew Broder * Berl Broder * David S. Broder * Gavin Broder * Henryk Broder * Samuel Broderee also* Broder singer * Brod, Broda, Brode, Braude …   Wikipedia

  • Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… …   Wikipedia

  • MinHash — In computer science, MinHash (or the min wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997),[1] and initially used… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Slowsort — (von engl. slow: langsam) ist ein langsamer, rekursiver Sortieralgorithmus, der nach dem Prinzip Vervielfache und kapituliere (engl. Multiply and surrender, eine Parodie auf Teile und herrsche) arbeitet. Er wurde 1986 von Andrei Broder und Jorge… …   Deutsch Wikipedia

  • Walsersort — Slowsort (von engl. slow: langsam) oder auch Walsersort ist ein langsamer, rekursiver, stabiler Sortieralgorithmus, der nach dem Prinzip Vervielfache und kapituliere (engl. Multiply and surrender, eine Parodie auf Teile und herrsche) arbeitet. Er …   Deutsch Wikipedia

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

  • Liste de personnes par nombre d'Erdos — Liste de personnes par nombre d Erdős Liste des personne avec un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Liens externes // …   Wikipédia en Français

  • Donald Knuth — Donald Ervin Knuth Donald Knuth at a reception for the Open Content Alliance, October 25, 2005 Born …   Wikipedia

  • Technion – Israel Institute of Technology — Infobox University name = Technion ndash; Israel Institute of Technology native name = הטכניון ndash; מכון טכנולוגי לישראל established = 1924 type = Public endowment = staff = faculty = president = Yitzhak Apeloig provost = principal = rector =… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”