Adam Wierman | |
|---|---|
 | |
| Born | May 1979 (age 45) |
| Nationality | American |
| Alma mater | Carnegie Mellon University |
| Known for | Scheduling (computing), Heavy tails, Green computing, Queueing Theory, Algorithmic Game Theory |
| Awards | Carnegie Mellon School of Computer Science Distinguished Dissertation Award (2007), ACM SIGMETRICS Rising Star award (2011), IEEE William R. Bennet Prize (2014) |
| Scientific career | |
| Fields | computer science, operations research |
| Institutions | California Institute of Technology |
| Thesis | Scheduling for Today's Computer Systems: Bridging Theory and Practice (2007) |
| Doctoral advisor | Mor Harchol-Balter |
| Website | www |
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.