Published numerous papers, see personal publication list. Involved in various research projects, including the development of new methods for centrality, similarity, and influence measures on large-scale graphs.
Research Experience
Was a member of the research staff at AT&T Bell Laboratories (later AT&T Labs Research) from 1991 to 2012; visited the Computer Science Division at UC Berkeley in 1997; served as a principal researcher at Microsoft Research (Silicon Valley) from 2012 to 2014; currently works as a research scientist at Google and is a full professor at the School of Computer Science, Tel Aviv University.
Education
Graduated from Tel Aviv University in 1985 with a degree in mathematics, physics, and computer science; obtained an M.Sc. in computer science in 1986 under the supervision of Michael Tarsi; earned a Ph.D. in Computer Science from Stanford University in 1991, supervised by Andrew Goldberg and Nimrod Megiddo.
Background
A computer scientist with interests in managing and mining massive data sets, networks, and information systems. Developed models and scalable algorithms in areas such as query processing and optimization, content search and delivery, caching, prefetching, routing, streaming, parallelization, and fundamental graph algorithms. Recently led the development of highly scalable algorithms for analyzing and mining massive graphs.
Miscellany
Has given presentations at multiple international conferences and workshops.