James Aspnes
James Aspnes is a professor in Computer Science at Yale University. He earned his Ph.D. in computer science from Carnegie Mellon University in 1992.[2] His main research interest is distributed algorithms.
James Aspnes | |
|---|---|
| Alma mater | Carnegie Mellon University |
| Scientific career | |
| Fields | Computer Science; |
| Institutions | Yale University |
| Thesis | Wait-Free Consensus (1992) |
| Doctoral advisor | Steven Rudich[1] |
In 1989, he wrote and operated TinyMUD, one of the first "social" MUDs that allowed players to build a shared virtual world.
He is the son of David E. Aspnes, Distinguished University Professor at North Carolina State University.
Awards
- The Dylan Hixon '88 Prize for Teaching Excellence in the Natural Sciences. Awarded by Yale College, 2000.
- IBM Graduate Fellowship, 1991–1992.
- NSF Graduate Fellowship, 1987–1990.
- Phi Beta Kappa, 1987.
- Dijkstra Prize, 2020
References
- James Aspnes at the Mathematics Genealogy Project
- "James Aspnes". ACM SIGACT Theoretical Computer Science genealogy database. Archived from the original on September 8, 2005. Retrieved 2008-02-16.
External links
| Major branches | |
|---|---|
| Minor branches, codebases, libraries | |
| Concepts, terminology |
|
| Publications | |
| Companies, organizations | |
 Category:MUDs | |
Authority control  |
|---|
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.