Brenda Baker
Brenda Sue Baker is an American computer scientist. She is known for Baker's technique for approximation algorithms on planar graphs, for her early work on duplicate code detection, and for her research on two-dimensional bin packing problems. Baker did her undergraduate studies at Radcliffe College. She earned a Ph.D. from Harvard University in 1973; her dissertation concerned automata theory and formal languages, and was supervised by Ronald V. Book. Early in her career she was an instructor and Vinton-Hayes Research Fellow at Harvard's Division of Engineering and Applied Physics, a visiting lecturer in the  Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, and an assistant professor in the Department of Computer and Communication Sciences at the University of Michigan. Later she worked at Bell Laboratories, becoming a Distinguished Member of Technical Staff there. Baker married another Bell Labs computer scientist, Eric Grosse, who would later become Google's Vice President for Security & Privacy Engineering. Their son, Roger Baker Grosse, is also a computer science researcher. Research. Her research interests principally include algorithm and software tools. Specifically, she has worked on problems involving string pattern matching, combinatorial algorithms, and approximation  algorithms for NP-hard problems. In the software tools domain, she designed tools to analyze and compare source code and compiled executables. These tools include "Dup" and "Pdiff", which compare regions of source code to determine if there are any repeated segments, as well as "Exediff", which enables the creation of small patches for executables without requiring access to the source code they were compiled from.