Udi Manber

Udi Manber

Udi Manber ( _he. אודי מנבר) is an Israeli computer scientist. He is one of the authors of agrep and GLIMPSE. As of April 2008, he is employed by Google as one of their vice presidents of engineering. [cite web | title = Google Management | publisher = Google | url = http://www.google.com/corporate/execs.html#udi | accessdate = 2008-04-23]

Biography

He earned both his bachelor's degree in 1975 in mathematics and his master's degree in 1978 from the Technion in Israel. At the University of Washington, he earned another master's degree in 1981 and his Ph.D. in computer science in 1982.

He has won a Presidential Young Investigator Award in 1985, 3 best-paperawards, and the Usenix annual Software Tools User Group Award software award in 1999.

He was a professor at the University of Arizona and authored several articles while there. He wrote "Introduction to Algorithms — A Creative Approach" (ISBN 0-201-12037-2), a book on algorithms.

He became the chief scientist at Yahoo! in 1998.

In 2002, he joined Amazon.com, where he became "chief algorithms officer" and a vice president. He later was appointed CEO of the Amazon subsidiary company A9.com. He filed a patent on behalf of Amazon. [patent|US|7287042|"Search engine system supporting inclusion of unformatted search string after domain name portion of URL" oldest priority March 3, 2004]

In 2006, he was hired by Google as one of their vice presidents of engineering. In December 2007, he announced Knol, Google's new project to create a knowledge repository. [cite web | last = Manber | first = Udi | authorlink = Udi Manber | title = Encouraging people to contribute knowledge | work = Official Google Blog | publisher = Google | date = 2007-12-13 | url = http://googleblog.blogspot.com/2007/12/encouraging-people-to-contribute.html | accessdate = 2008-04-23]

Notes

External links

* [http://manber.com/ http://manber.com/]
* [http://itc.conversationsnetwork.org/shows/detail3360.html IT Conversations ] podcast about Google search


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Googleknol — Knol Logo de Knol URL http://knol.google.com/k?hl=fr Slogan Une unité de savoi …   Wikipédia en Français

  • Knol —  Pour l’article homophone, voir Knoll. URL ht …   Wikipédia en Français

  • Agrep — (approximate grep) is a fuzzy string searching program, developed by Udi Manber and Sun Wu between 1988 and 1991, for use with the Unix operating system. It was later ported to OS/2, DOS, and Windows.It selects the best suited algorithm for the… …   Wikipedia

  • Suffix array — In computer science, a suffix array is an array giving the suffixes of a string in lexicographical order.DetailsConsider the string abracadabra , of length 11. It has eleven suffixes: abracadabra , bracadabra , racadabra , and so on down to a .… …   Wikipedia

  • Suffix-Array — In der Informatik ist ein Suffixarray ein Array, das die Suffixe eines Strings in lexikographischer Reihenfolge angibt. Inhaltsverzeichnis 1 Details 2 Algorithmen 3 Anwendungen 4 Geschichte …   Deutsch Wikipedia

  • Suffixarray — In der Informatik ist ein Suffixarray ein Array, das die Suffixe eines Strings in lexikographischer Reihenfolge angibt. Inhaltsverzeichnis 1 Details 2 Algorithmen 3 Anwendungen …   Deutsch 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

  • grep — [gɹɛp] ist ein Programm, das unter den Betriebssystemen Unix und Unix Derivaten der Suche und Filterung definierter Zeichenketten aus Dateien dient. Es wurde ursprünglich von Ken Thompson entwickelt.[1] Der Begriff grep steht für global/regular… …   Deutsch Wikipedia

  • Bitap algorithm — The bitap algorithm (also known as the shift or, shift and or Baeza Yates Gonnet algorithm) is a fuzzy string searching algorithm developed by Udi Manber and Sun Wu in 1991ref|Manber91ref|Manber92 based on work done by Ricardo Baeza Yates and… …   Wikipedia

  • Algorithme de Levenshtein — Distance de Levenshtein La distance de Levenshtein mesure la similarité entre deux chaînes de caractères. Elle est égale au nombre minimal de caractères qu il faut supprimer, insérer ou remplacer pour passer d’une chaîne à l’autre. Son nom… …   Wikipédia en Français

Share the article and excerpts

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