**Adam Wierman** is Professor of Computer Science in the Department of Computing and Mathematical Sciences at the California Institute of Technology. He is known for his work on scheduling (computing), heavy tails, green computing, queueing theory, and algorithmic game theory.

Wierman studied at Carnegie Mellon University, where he completed his BS in Computer Science and Mathematics in 2001 and his MS and PhD degrees in Computer Science in 2004 and 2007. His PhD work was supervised by Mor Harchol-Balter. His dissertation received the Carnegie Mellon School of Computer Science Distinguished Dissertation Award. He has been on the faculty of the California Institute of Technology since 2007.

Wierman's research has centred on resource allocation and scheduling decisions in computer systems and services. More specifically, his work has focused both on developing analytic techniques in stochastic modelling, queueing theory, scheduling theory, and game theory, and on applying these techniques to application domains such as energy-efficient computing, data centres, social networks, and electricity markets.

Wierman was the recipient of an NSF CAREER award in 2009 and the ACM SIGMETRICS Rising Star award in 2011. His work has received "Best Paper" awards at the ACM SIGMETRICS, IEEE INFOCOM, and IFIP Performance conferences, among others. An extension of his work was used in HP's Net-zero Data Center Architecture, which was named a 2013 Computerworld Honours Laureate. His work received the 2014 IEEE William R. Bennet Prize.