University of Toronto
Department of Computer Science

A Distinguished Lecture on Computer Science

Prabhakar Raghavan

Chief Scientist and Vice President of Emerging Technologies
Verity, Inc.

Networks and Sub-Networks in the World-Wide Web

Abstract

We discuss several structural properties of graphs arising from the world-wide web including the graph of hyperlinks, and the graph induced by connections between distributed search servents. We review a number of algorithmic investigations of the structure of these networks, and conclude by proposing stochastic models for the evolution of these networks.

Biography

Dr. Prabhakar Raghavan is the Chief Scientist and Vice President of Emerging Technologies of Verity, Inc., a leading provider of enterprise and Internet knowledge retrieval solutions

Most recently the head of the Computer Science Principles department at IBM's Almaden Research Center (San Jose, CA), Dr. Raghavan has 14 years of extensive experience in creating innovative technologies in Web, security and cryptography, and storage architecture. Prior to joining Verity, Dr. Raghavan headed the Computer Science Principles (CSP) department at IBM's Almaden Research Center. Under Raghavan's leadership, CSP achieved global recognition for its application of fundamental ideas in creating new technologies for the Web, security and cryptography, and storage architecture. Raghavan also led IBM's Clever project on Web search and mining, highly touted in the press and scientific literature for its influential ideas in Web information and community discovery. He also worked at IBM's T.J. Watson Research Center.

Dr. Raghavan is Consulting Professor of Computer Science at Stanford University, and has also taught at Yale. He has authored over 80 papers in various fields including algorithms, optimization, Web search and databases, a recent article on Web Search in Scientific American, a popular textbook on Randomized Algorithms, and several patents. He serves on the editorial boards of several prestigious scientific journals including the Journal of the ACM and the SIAM Journal on Computing, on the external advisory boards of leading universities, on National Science Foundation panels, and on the executive board of ACM's Special Interest Group on Algorithms and Computation. He is a frequent speaker at conferences and technical events, and will give the plenary talk at the prestigious ACM SIGMOD Symposium on Principles of Database Systems, May 2000 in Dallas, where he is also co-winner of the Best Paper prize for his work on privacy in databases. Dr. Raghavan holds a PhD from the University of California at Berkeley and an undergraduate degree in electrical engineering from IIT in Madras.


Host: contact Prof. Borodin regarding the speaker's schedule.

Time and Location: return to the 2000 Colloquia Series main page.