Andrew V. Goldberg
Andrew Goldberg | |
|---|---|
| Born | Andrew Vladislav Goldberg 1960 (age 64–65) |
| Alma mater | Massachusetts Institute of Technology (BS, PhD) University of California, Berkeley (MS) |
| Awards | ACM Fellow (2009) |
| Scientific career | |
| Institutions | Amazon Stanford University |
| Thesis | Efficient graph algorithms for sequential and parallel computers (1987) |
| Doctoral advisor | Charles E. Leiserson [1] |
| Doctoral students | Edith Cohen [1] |
| Website | avglab |
Andrew Vladislav Goldberg (born 1960) is an American computer scientist working primarily on design, analysis, and experimental evaluation of algorithms. He also worked on mechanism design, computer systems, and complexity theory.[2] Currently he is a senior principal scientist at Amazon.com.
Education and career
[edit ]Goldberg did his undergraduate studies at the Massachusetts Institute of Technology, graduating in 1982. After earning a master's degree at the University of California, Berkeley, he returned to MIT with funding from a prestigious Hertz Fellowship, finishing his doctorate there in 1987 with a thesis on the Efficient graph algorithms for sequential and parallel computers[3] supervised by Charles E. Leiserson.[G87] [1]
Career and research
[edit ]After completing his PhD, Goldberg was on the faculty of Stanford University and worked for NEC Research Institute, Intertrust STAR Laboratories, and Microsoft Research Silicon Valley Lab. He joined Amazon.com in 2014.[citation needed ]
Goldberg is best known for his research in the design and analysis of algorithms for graphs and networks, and particularly for his work on the maximum flow problem [GT88] [CG97] [GR98] and shortest path problem,[CGR96] [GH05] including the discovery of the push–relabel maximum flow algorithm.[GT88] He also worked on algorithmic game theory, where he was one of the first scientists to study worst-case mechanism design.
Selected publications
[edit ]Awards and honors
[edit ]Goldberg holds a number of awards, including a Hertz Fellowship in 1985, the 1988 A.W. Tucker Prize of the Mathematical Optimization Society,[4] 1988 National Science Foundation (NSF) Presidential Young Investigator Award, 1991 ONR Young Investigator Award, and 2011 INFORMS Optimization Society Farkas Prize.[5] In 2012–2013, Goldberg was a Founding Faculty Fellow of the Skolkovo Institute of Science and Technology.
Goldberg was nominated a Fellow of the Association for Computing Machinery (ACM) in 2009 "for contributions to fundamental theoretical and practical problems in the design and analysis of algorithms."[6] In 2013, he became a fellow of the Society for Industrial and Applied Mathematics.[7]
References
[edit ]- ^ a b c Andrew V. Goldberg at the Mathematics Genealogy Project Edit this at Wikidata
- ^ Andrew V. Goldberg publications indexed by Google Scholar Edit this at Wikidata
- ^ Goldberg, Andrew Vladislav (1987). Efficient graph algorithms for sequential and parallel computers (PhD thesis). MIT. hdl:1721.1/14912. Free access icon
- ^ A.W. Tucker Prize, Mathematical Optimization Soc., retrieved 2013年10月12日.
- ^ Farkas Prize, INFORMS, retrieved 2014年1月25日.
- ^ ACM Fellow award citation, retrieved 2013年10月12日.
- ^ SIAM Fellows, retrieved 2013年10月12日.
- 1960 births
- Living people
- American computer scientists
- Russian computer scientists
- Massachusetts Institute of Technology alumni
- University of California, Berkeley alumni
- Stanford University faculty
- Fellows of the Society for Industrial and Applied Mathematics
- 2009 fellows of the Association for Computing Machinery