Prabhakar Raghavan

Last updated

Prabhakar Raghavan
Prabhakar Raghavan.png
Prabhakar Raghavan receiving a Laurea honoris causa from the University of Bologna, 2009
Born (1960-09-25) September 25, 1960 (age 63)[ citation needed ]
Alma mater University of California Berkeley,
Indian Institute of Technology, Madras
Campion School, Bhopal
Scientific career
Institutions Google
University of California Berkeley,
Indian Institute of Technology, Madras
Yahoo! Labs
Stanford University
IBM
Thesis Randomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems (Integer Programming)  (1987)
Doctoral advisor Clark D. Thompson [1]
Website research.google.com/pubs/PrabhakarRaghavan.html

Prabhakar Raghavan is a senior vice president at Google, where he is responsible for Google Search, Assistant, Geo, Ads, Commerce, and Payments products. [2] His research spans algorithms, web search and databases. [3] He is the co-author of the textbooks Randomized Algorithms [4] with Rajeev Motwani [5] and Introduction to Information Retrieval. [6] [7] [8] [9] [10]

Contents

Early life and education

Prabhakar holds a Bachelor of Technology from the Indian Institute of Technology Madras and a Ph.D. from the University of California, Berkeley in Electrical Engineering and Computer Science. [3]

Career

Prabhakar worked at IBM Research in the 1990s. [11] According to a 2011 interview with The Guardian , Raghavan taught at Stanford University around the time the Google founders worked there. [12]

Later,[ when? ] he was senior vice president and chief technology officer at enterprise search vendor Verity.[ citation needed ]

Prabhakar ran Yahoo! Labs from 2005 to 2012, working on a variety of projects including search and advertsing. [12] [13] In 2012 Prabhakar joined Google. [14] In 2020 he was Head of Ads at Google and took over the role of Head of Search from Ben Gomes, [15] amid a push to increase advertising revenue from Google Search. [16]

Awards and honors

Prabhakar is a member of the National Academy of Engineering and a Fellow of both the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers (IEEE). [17] From 2003 to 2009, Prabhakar was the editor-in-chief of Journal of the ACM . [18]

In 1986, Prabhakar received the Machtey Award for Best Student Paper.[ citation needed ] In 2000, he was named a fellow of the IEEE; [19] received the Best Paper Award at the ACM Symposium on Principles of Database Systems; [20] and received the Best Paper Award at the Ninth International World Wide Web Conference (WWW9). [21] In 2002, Prabhakar was named a fellow of the ACM. [22] He received the 2006 Distinguished Alumnus Award, UC Berkeley Division of Computer Science. [23] In 2008, Prabhakar was made a member of the National Academy of Engineering, [24] and in 2009, he was awarded a Laurea honoris causa from the University of Bologna. In 2012, he was named a Distinguished Alumnus by the IIT Madras. In 2017, Prabhakar and co-authors received the Seoul test of time award for their 2000 paper “Graph Structure in the Web” at the WWW conference. [25]

Related Research Articles

The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, reporting nearly 110,000 student and professional members as of 2022. Its headquarters are in New York City.

<span class="mw-page-title-main">John Hopcroft</span> American computer scientist (born 1939)

John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation and data structures are regarded as standards in their fields. He is a professor emeritus at Cornell University, co-director of the Center on Frontiers of Computing Studies at Peking University, and the director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.

<span class="mw-page-title-main">John Cocke (computer scientist)</span> American computer scientist and mathematician

John Cocke was an American computer scientist recognized for his large contribution to computer architecture and optimizing compiler design. He is considered by many to be "the father of RISC architecture."

Shmuel Winograd was an Israeli-American computer scientist, noted for his contributions to computational complexity. He has proved several major results regarding the computational aspects of arithmetic; his contributions include the Coppersmith–Winograd algorithm and an algorithm for the fast Fourier transform which transforms it into a problem of computing convolutions which can be solved with another Winograd's algorithm.

<span class="mw-page-title-main">David Bader (computer scientist)</span> American computer scientist

David A. Bader is a Distinguished Professor and Director of the Institute for Data Science at the New Jersey Institute of Technology. Previously, he served as the Chair of the Georgia Institute of Technology School of Computational Science & Engineering, where he was also a founding professor, and the executive director of High-Performance Computing at the Georgia Tech College of Computing. In 2007, he was named the first director of the Sony Toshiba IBM Center of Competence for the Cell Processor at Georgia Tech.

<span class="mw-page-title-main">Ricardo Baeza-Yates</span>

Ricardo A. Baeza-Yates is a Chilean-Catalan-American computer scientist that currently is the Director of Research of the Institute for Experiential AI at Northeastern University in the Silicon Valley campus. He is also part-time professor at Universitat Pompeu Fabra in Barcelona and Universidad de Chile in Santiago. He is an expert member of the Global Partnership on Artificial Intelligence, a member of the Association for Computing Machinery's US Technology Policy Committee as well as IEEE's Ethics Committee.

In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs of constant query complexity and logarithmic randomness complexity.

<span class="mw-page-title-main">Andrei Broder</span> American computer scientist

Andrei Zary Broder is a distinguished scientist at Google. Previously, he was a research fellow and vice president of computational advertising for Yahoo!, and before that, the vice president of research for AltaVista. He has also worked for IBM Research as a distinguished engineer and was CTO of IBM's Institute for Search and Text Analysis.

<span class="mw-page-title-main">Rajeev Motwani</span> Indian computer scientist (1962–2009)

Rajeev Motwani was an Indian American professor of Computer Science at Stanford University whose research focused on theoretical computer science. He was a special advisor to Sequoia Capital. He was a winner of the Gödel Prize in 2001.

<span class="mw-page-title-main">Ronald Fagin</span> American mathematician and computer scientist

Ronald Fagin is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge.

The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.

Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

Philip S. Yu is an American computer scientist and professor of information technology at the University of Illinois at Chicago. He is a prolific author, holds over 300 patents, and is known for his work in the field of data mining.

Nancy Marie Amato is an American computer scientist noted for her research on the algorithmic foundations of motion planning, computational biology, computational geometry and parallel computing. Amato is the Abel Bliss Professor of Engineering and Head of the Department of Computer Science at the University of Illinois at Urbana-Champaign. Amato is noted for her leadership in broadening participation in computing, and is currently a member of the steering committee of CRA-WP, of which she has been a member of the board since 2000.

<span class="mw-page-title-main">Martin Farach-Colton</span> American computer scientist

Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures. He is the Leonard J. Shustek Professor of Computer Science and chair of the Department of Computer Science and Engineering at New York University. Formerly, he was a Distinguished Professor of Computer Science at Rutgers University. He co-founded the storage technology startup company Tokutek.

Jianchang (JC) Mao is a Chinese-American computer scientist and Vice President, Google Assistant Engineering at Google. His research spans artificial intelligence, machine learning, computational advertising, data mining, and information retrieval. He was named a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2012 for his contributions to pattern recognition, search, content analysis, and computational advertising.

<span class="mw-page-title-main">Jelani Nelson</span> American computer scientist (born 1984)

Jelani Osei Nelson is an Ethiopian-American Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.

<span class="mw-page-title-main">Prabhat Mishra</span> American computer scientist

Prabhat Mishra is a Professor in the Department of Computer and Information Science and Engineering and a UF Research Foundation Professor at the University of Florida. Prof. Mishra's research interests are in hardware security, quantum computing, embedded systems, system-on-chip validation, formal verification, and machine learning.

<span class="mw-page-title-main">Philip N. Klein</span> American computer scientist

Philip N. Klein is an American computer scientist and professor at Brown University. His research focuses on algorithms for optimization problems in graphs. 

<span class="mw-page-title-main">Ashish Goel</span> American computer science professor

Ashish Goel is an American professor whose research focuses on the design, analysis and applications of algorithms. He is a professor of Management Science and Engineering at Stanford University.

References

  1. ↑ "Randomized Rounding And Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems". UC Berkeley. Retrieved 19 May 2014. Advisor: Clark D. Thompson
  2. ↑ "Prabhakar Raghavan – Google Research". Google Research. Retrieved 2021-01-14.
  3. 1 2 "Prabhakar Raghavan". Executive Profile. Bloomberg Businessweek. Retrieved 1 May 2024.
  4. ↑ Raghavan, Prabhakar; Motwani, Rajeev (1995). Randomized algorithms. Cambridge, UK: Cambridge University Press. ISBN   978-0-521-47465-8.
  5. ↑ Raghavan, Prabhakar (2012). "Rajeev Motwani (1962-2009)" (PDF). Theory of Computing. 8: 55–57. doi: 10.4086/toc.2012.v008a003 .
  6. ↑ Schütze, Hinrich; Christopher D. Manning; Raghavan, Prabhakar (2008). Introduction to information retrieval. Cambridge, UK: Cambridge University Press. ISBN   978-0-521-86571-5.
  7. ↑ Prabhakar Raghavan at DBLP Bibliography Server OOjs UI icon edit-ltr-progressive.svg
  8. ↑ Broder, A.; Kumar, R.; Maghoul, F.; Raghavan, P.; Rajagopalan, S.; Stata, R.; Tomkins, A.; Wiener, J. (2000). "Graph structure in the Web". Computer Networks. 33 (1–6): 309–320. doi:10.1016/S1389-1286(00)00083-9.
  9. ↑ Prabhakar Raghavan author profile page at the ACM Digital Library OOjs UI icon edit-ltr-progressive.svg
  10. ↑ Prabhakar Raghavan's publications indexed by the Scopus bibliographic database. (subscription required)
  11. ↑ Farber, Dan. "Yahoo's new search master". Between the Lines Blog. ZDNet. Retrieved 28 October 2011.
  12. 1 2 Kiss, Jemima (26 April 2011). "Yahoo's secret weapon: the ex-IBMer who worked with Google's founders". The Guardian. Retrieved 23 April 2024.
  13. ↑ Reisinger, Don (2012-03-05). "Yahoo Labs chief, strategist jumps to Google, report says". CNET. Retrieved 2024-04-24.
  14. ↑ Swisher, Kara (2012-03-04). "Yahoo Labs Head Raghavan Departing to Google". AllThingsD. Retrieved 2024-04-24.
  15. ↑ Sterling, Greg (2020-06-04). "Google promotes Prabhakar Raghavan to lead Search, replacing Ben Gomes". Search Engine Land. Retrieved 2024-04-24.
  16. ↑ AdExchanger (2024-04-24). "The Fin Tech Ad Tech Boom; Temu Tops Meta's Charts (But At What Cost?)". AdExchanger. Retrieved 2024-04-25.
  17. ↑ "Dr. Prabhakar Raghavan". Company Info. Yahoo! News Center. Retrieved 28 October 2011.
  18. ↑ "History". Journal of the ACM. Archived from the original on 26 October 2011. Retrieved 28 October 2011.
  19. ↑ "IEEE Fellows: R". IEEE Fellows. IEEE. Retrieved 28 October 2011.
  20. ↑ "Department of Computer Science 1999-2000 Annual Report". Cornell University. Retrieved 28 October 2011.
  21. ↑ "2000 IBM Research Computer Science Best Paper Awards". IBM Computer Science. IBM. Retrieved 28 October 2011.
  22. ↑ "Verity Executive Prabhakar Raghavan Inducted as an ACM Fellow". News & Events. Autonomy.com. Retrieved 28 October 2011.
  23. ↑ "Distinguished Alumni". Electrical Engineering and Computer Sciences. Retrieved 28 October 2011.
  24. ↑ "National Academy of Engineering Elects 65 Members and Nine Foreign Associates". News. National Academies. Retrieved 28 October 2011.
  25. ↑ https://www.iw3c2.org/ToT/PressRelease-3rdToT-20170405.pdf [ bare URL PDF ]
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.