Jump to content

Brenda Baker

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 14:32, 20 August 2018 (Undid revision 855736336 by Pushkar Ekbote (talk) that citeseerx copy is not based on a copy by an author of the paper, and so most likely fails WP:ELNEVER). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Brenda S. Baker
NationalityAmerican
Alma mater
Known for
Scientific career
FieldsComputer science
Doctoral advisorRonald V. Book

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.[1] 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.[2] Later she worked at Bell Laboratories, becoming a Distinguished Member of Technical Staff there.[3]

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.[1][4]

Selected publications

  • Baker, Brenda S.; Book, Ronald V. (1972), "Reversal-bounded multi-pushdown machines", Conference Record of 13th Annual Symposium on Switching and Automata Theory, Institute of Electrical & Electronics Engineers (IEEE), pp. 207–211, doi:10.1109/SWAT.1972.21.
  • Baker, Brenda S.; Coffman, E. G., Jr.; Rivest, Ronald L. (1980), "Orthogonal packings in two dimensions", SIAM Journal on Computing, 9 (4): 846–855, CiteSeerX 10.1.1.309.8883, doi:10.1137/0209064, MR 0592771{{citation}}: CS1 maint: multiple names: authors list (link)
  • Baker, Brenda S.; Grosse, Eric; Rafferty, Conor S. (1988), "Nonobtuse triangulation of polygons", Discrete and Computational Geometry, 3 (2): 147–168, doi:10.1007/BF02187904, MR 0920700.
  • Baker, Brenda S. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, MR 1369197.
  • Baker, Brenda S. (1995), "On finding duplication and near-duplication in large software systems", Proceedings of 2nd Working Conference on Reverse Engineering, Institute of Electrical & Electronics Engineers (IEEE), pp. 86–95, doi:10.1109/wcre.1995.514697.

References

  1. ^ a b Braun, Bob (May 18, 2003), "A matter of mind", The Star-Ledger.
  2. ^ Brenda Baker at the Mathematics Genealogy Project
  3. ^ Baker, Brenda S. (2011), Professional Background, retrieved 2016-03-19.
  4. ^ Grosse, Roger (2011), About me, retrieved 2016-03-19.