James B. Saxe

Last updated

James Benjamin Saxe is an American computer scientist who has worked for many years at the DEC Systems Research Center [1] and its successors, the Compaq Systems Research Center and the Systems Research Center of HP Labs.

Saxe is known for his highly-cited publications on automated theorem proving, [DNS] circuit complexity, [FSS] retiming in synchronous circuit design, [LS] computer networks, [AOS] and static program analysis. [FLL] His work on program analysis from PLDI 2002 won the Most Influential PLDI Paper Award for 2012. [2] In addition, he is one of the authors of the master theorem for divide-and-conquer recurrences. [BHS]

While a high school student, Saxe won the United States of America Mathematical Olympiad. [3] In 1974, as a student at Union College, Saxe took part in the William Lowell Putnam Mathematical Competition; his place in the top five scores earned him a Putnam Fellowship. [4] He graduated from Union College in 1976, [3] , and earned his Ph.D. in 1985 from Carnegie Mellon University, under the supervision of Jon Bentley. [5]

Selected publications

References

  1. ↑ Who's Who at SRC (PDF), DEC Systems Research Center, 1993, p. 14
  2. ↑ Most Influential PLDI Paper Award, retrieved 2017-06-17
  3. 1 2 A History of the Mathematics Department Archived 2016-12-18 at the Wayback Machine , Union College, retrieved 2017-06-17
  4. ↑ Putnam Competition Individual and Team Winners Archived 2014-03-12 at the Wayback Machine , Mathematical Association of America, retrieved 2017-06-17
  5. ↑ James B. Saxe at the Mathematics Genealogy Project
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.