Andrei Zary Broder (born April 12, 1953 in Bucharest) 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.
Broder was born in Bucharest, Romania, in 1953. His parents were medical doctors, his father a noted oncological surgeon. They emigrated to Israel in 1973, when Broder was in the second year of college in Romania, in the Electronics department at the Bucharest Polytechnic.
He was accepted at Technion – Israel Institute of Technology, in the EE Department. Broder graduated from Technion in 1977, with a B.Sc. summa cum laude. He was then admitted to the PhD program at Stanford, where he initially planned to work in the systems area. His first adviser was Prof. John L. Hennessy. After receiving a "high pass" at the reputedly hard algorithms qual, Prof. Donald Knuth, already a Turing Award and National Medal winner, offered him the opportunity to become his advisee. Broder finished his PhD under Don Knuth in 1985. [1] He then joined the newly founded DEC Systems Research Center in Palo Alto. At DEC SRC, Andrei was involved with AltaVista from the very beginning, helping it deal with duplicate documents and spam. When AltaVista split from Compaq that bought DEC, Andrei became its CTO and then chief scientist and VP of research.
In 2002, he joined IBM Research in New York to build its enterprise search product. In 2005, he returned to Silicon Valley and the Web Industry, as a Yahoo Fellow and vice president. There, he put the bases of a new discipline, Computational advertising, the science of matching ads to users and contexts. At Yahoo, Broder also helped build Yahoo! Research into one of the leading Web research organizations.
Broder was elected a member of the National Academy of Engineering in 2010 for his contributions to the science and engineering of the World Wide Web.
In 2012, Broder joined Google as a distinguished scientist, where he switched focus to another aspect of the WWW experience, large-scale personalization. [2]
In 1989, he discovered (independently from David Aldous) an algorithm for generating a uniform spanning tree of a given graph. [3]
Over the last fifteen years,[ when? ] Broder pioneered several algorithms systems and concepts fundamental to the science and technology of the WWW. Some of the highlights include: In 1997, Broder led the development of the first practical solution for finding near-duplicate documents on web-scale using "shingling" to reduce the problem to a set-intersection problem and "min-hashing" or to construct "sketches" of sets. This was a pioneering effort in the area of locality-sensitive hashing. In 1998, he co-invented the first practical test to prevent robots from masquerading as human and access web sites, often referred to as CAPTCHA. [4] In 2000, Broder, then at AltaVista, together with colleagues from IBM and DEC SRC, conducted the first large-scale analysis of the Web graph, and identified the bow-tie model of the web graph. [5] Around 2001–2002, Broder published an opinion piece where he qualified the differences between classical information retrieval and Web search and introduced a now widely accepted classification of web queries into navigational, information, and transactional. [6]
He is a fellow of the Association for Computing Machinery, National Academy of Engineering and the IEEE. He was one of the recipients of the 2012 ACM Paris Kanellakis Award for his work on w-shingling and min-hashing, [7] and he won this award again in 2020, together with Yossi Azar, Anna Karlin, Michael Mitzenmacher, and Eli Upfal for their work on the power of two choices.
Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.
Andrey Petrovich Yershov was a Soviet computer scientist, notable as a pioneer in systems programming and programming language research.
AltaVista was a Web search engine established in 1995. It became one of the most-used early search engines, but lost ground to Google and was purchased by Yahoo! in 2003, which retained the brand, but based all AltaVista searches on its own search engine. On July 8, 2013, the service was shut down by Yahoo!, and since then the domain has redirected to Yahoo!'s own search site.
Paris Christos Kanellakis was a Greek American computer scientist.
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.
Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
Avi Wigderson is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science.
Michael Burrows, FRS is a British computer scientist and the creator of the Burrows–Wheeler transform, currently working for Google. Born in Britain, as of 2018 he lives in the United States, although he remains a British citizen.
Raymond Paul "Raymie" Stata is an American computer engineer and business executive.
Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003 he won the ACM Paris Kanellakis Award for the Miller–Rabin primality test. He was made an ACM Fellow in 2002 and won the Knuth Prize in 2013.
Eli Upfal is a computer science researcher, currently the Rush C. Hawkins Professor of Computer Science at Brown University. He completed his undergraduate studies in mathematics and statistics at the Hebrew University, Israel in 1978, received an M.Sc. in computer science from the Feinberg Graduate School of the Weizmann Institute of Science, Israel in 1980, and completed his PhD in computer science at the Hebrew University in 1983 under Eli Shamir. He has made contributions in a variety of areas. Most of his work involves randomized and/or online algorithms, stochastic processes, or the probabilistic analysis of deterministic algorithms. Particular applications include routing and communications networks, computational biology, and computational finance.
Peter A. Franaszek is an American information theorist, an IEEE Fellow, a research staff member emeritus at the IBM T.J. Watson Research Center and a former member of the IBM Academy of Technology. He received his Sc.B. from Brown University in 1962, and his Ph.D. from Princeton University in 1966.
Michael David Mitzenmacher is an American computer scientist working in algorithms. He is Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences and was area dean of computer science July 2010 to June 2013. He also runs My Biased Coin, a blog about theoretical computer science.
In computer science and data mining, MinHash is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997), and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results. It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.
Prabhakar Raghavan is a senior vice president at Google, where he is responsible for Google Search, Assistant, Geo, Ads, Commerce, and Payments products. His research spans algorithms, web search and databases and he is the co-author of the textbooks Randomized Algorithms with Rajeev Motwani and Introduction to Information Retrieval.
Ruchir Puri is an Indian American scientist, CTO and chief architect of IBM Watson, an IBM Fellow and currently Chief Scientist of IBM Research. He is a Fellow of the IEEE, a member of IBM Academy of Technology and IBM Master Inventor, an ACM Distinguished Speaker and IEEE Distinguished Lecturer. Ruchir received Semiconductor Research Corporation's outstanding mentor award. He was a visiting scientist at the Dept. of Computer Science, Stanford University, CA, and an adjunct professor at the Dept. of Electrical Engineering, Columbia University, NY and was awarded John Von-Neumann Chair at Institute of Discrete Mathematics at Bonn University, Germany. Ruchir received the 2014 Asian American Engineer of the Year Award. He has delivered numerous keynotes and invited talks at major software and hardware conferences. He is an inventor of over 50 United States patents and has authored over 100 publications as well as authored a book on Analyzing Analytics. Ruchir is an active proponent of technology among school children and has been evangelizing fun with electronics and FIRST LEGO League Robotics among middle schools children.
Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University. He was previously a professor at Princeton University. The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection.
Yoelle Maarek is a Tunisian-born Israeli computer scientist. She is the Vice President of Worldwide Research at Amazon, responsible for Amazon's Alexa Shopping Research. Maarek is a researcher in the field of search engines and data mining, and a former vice president at Yahoo! and Director of Yahoo! in Israel and in India. Maarek was the first engineer of Google Israel and established the first development center in Haifa in 2006.
Baruch M. Schieber is a Professor of the Department of Computer Science at the New Jersey Institute of Technology (NJIT) and Director of the Institute for Future Technologies.
Hugo Krawczyk is an Argentine-Israeli cryptographer best known for co-inventing the HMAC message authentication algorithm and contributing in fundamental ways to the cryptographic architecture of central Internet standards, including IPsec, IKE, and SSL/TLS. In particular, both IKEv2 and TLS 1.3 use Krawczyk’s SIGMA protocol as the cryptographic core of their key exchange procedures. He has also contributed foundational work in the areas of threshold and proactive cryptosystems and searchable symmetric encryption, among others.
{{cite book}}: |journal= ignored (help)| International | |
|---|---|
| National | |
| Academics | |
