Andrei Z. Broder is affiliated with Google in the United States and has contributed research primarily in the field of Computer Science. Their work spans several subfields, including Computer Networks and Communications, Software, and Marketing. The main topics covered by their research include Distributed systems and fault tolerance, Advanced Database Systems and Queries, Software Testing and Debugging Techniques, and Consumer Market Behavior and Pricing.
The scientist has published papers in notable venues such as arXiv (Cornell University) and the Leibniz-Zentrum für Informatik (Schloss Dagstuhl). Their recent papers include:
Frequent collaborators in their research include Ravi Kumar, Preston McAfee, Gerth Stølting Brodal, and Tami Tamir. These coauthors have contributed alongside Broder across various publications.
Their research has been recognized within the scientific community, as evidenced by several awards. Among them are the ACM Paris Kanellakis Theory and Practice Award received in 2012 for work on Locality-Sensitive Hashing, which has had applications across multiple computer science disciplines. They were named a Member of the National Academy of Engineering in 2010 for contributions to the science and engineering of the World Wide Web. Additional distinctions include being named an ACM Fellow in 2007 for contributions to algorithms and web technology and an IEEE Fellow in 2006 for work on the theory and application of randomized algorithms.
Andrei Broder;Ravi Kumar;Farzin Maghoul;Prabhakar Raghavan
Li Fan;Pei Cao;Jussara Almeida;Andrei Z. Broder
Andrei Z. Broder;Michael Mitzenmacher
Andrei Broder
A.Z. Broder
Andrei Z. Broder;Steven C. Glassman;Mark S. Manasse;Geoffrey Zweig
Andrei Z Broder;Moses Charikar;Alan M Frieze;Michael Mitzenmacher
Yossi Azar;Andrei Z. Broder;Anna R. Karlin;Eli Upfal
Andrei Z. Broder
Krishna Bharat;Andrei Z. Broder
Andrei Z. Broder;David Carmel;Michael Herscovici;Aya Soffer
A. Broder
Andrei Z. Broder;Moses Charikar;Alan M. Frieze;Michael Mitzenmacher
Andrei Broder;Marcus Fontoura;Vanja Josifovski;Lance Riedel
Andrei Z Broder
Mark D. Lillibridge;Martin Abadi;Krishna Bharat;Andrei Z. Broder
Andrei Z. Broder
Maria-Florina Balcan;Andrei Broder;Tong Zhang
A. Broder;M. Mitzenmacher
Krishna Bharat;Andrei Broder;Monika Henzinger;Puneet Kumar
Chin-Wan Chung;Andrei Broder;Kyuseok Shim;Torsten Suel
If you think any of the details on this page are incorrect, let us know.
Exploring online degrees can offer flexibility and affordability for those pursuing a future in computer science and related fields. For those interested in data analytics or artificial intelligence, an online masters for data science provides a strong technical foundation and is widely recognized by employers.
If your interests expand into the intersection of technology and the building industry, an accelerated online construction management degree could be a fast-track to leadership roles in construction or infrastructure development, blending project management and technical skills.
Looking to enhance business acumen or move into leadership? Consider one of the cheapest 1 year online mba programs. These programs focus on management skills, entrepreneurship, and business strategy—essential for tech professionals aiming for executive positions.
Additionally, many professionals choose 1 year masters programs in fields like information systems, cybersecurity, or software engineering to accelerate their career growth without a long-term commitment. Online learning options make it easier than ever to advance your education from anywhere in the world.
Huazhong University of Science and Technology
City University of New York
University of Southern California
SUNY Downstate Medical Center
University of New Hampshire
Harvard University
City University of New York
Spanish National Research Council
Purdue University West Lafayette
Emerson (United States)
Amazon (United States)
University of Manchester
Harvard University
Chinese University of Hong Kong
Innsbruck Medical University
Leibniz Institute for the Analysis of Biodiversity Change
