Lably
Skip to content

James B. Saxe

  • 1 min read
  • 1 chapters

Related on Lably

Through Computer network

Lab · Class 12Networking Basics

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. 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. 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. He graduated from Union College in 1976,, and earned his Ph.D. in 1985 from Carnegie Mellon University, under the supervision of Jon Bentley.

More in Computing and communication

ISBNUnique numeric book identifier since 1970X (social network)American social networking serviceWayback MachineDigital archive by the Internet ArchivePython (programming language)General-purpose programming languageMacOSOperating system for Apple computersUnicodeCharacter encoding standard