James Aspnes

American computer scientist

James Aspnes
Alma materCarnegie Mellon University
Scientific career
FieldsComputer Science;
InstitutionsYale University
Thesis Wait-Free Consensus  (1992)
Doctoral advisorSteven Rudich[1]

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.

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.[3]

Awards

  • Dijkstra Prize, 2020.
  • Dylan Hixon '88 Prize for Teaching Excellence in the Natural Sciences, Yale College, 2000.
  • IBM Graduate Fellowship, 1991–1992.
  • NSF Graduate Fellowship, 1987–1990.
  • Phi Beta Kappa, 1987.

References

  1. ^ James Aspnes at the Mathematics Genealogy Project
  2. ^ "James Aspnes". ACM SIGACT Theoretical Computer Science genealogy database. Archived from the original on September 8, 2005. Retrieved February 16, 2008.
  3. ^ "James Aspnes - Yale School of Engineering & Applied Science | Yale School of Engineering & Applied Science". seas.yale.edu.

External links

  • James Aspnes's Home Page at Yale
Authority control databases Edit this at Wikidata
International
  • VIAF
National
  • Israel
  • Czech Republic
Academics
  • DBLP
  • MathSciNet
  • Mathematics Genealogy Project


Flag of United StatesScientist icon

This article about an American scientist in academia is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e
Stub icon

This biographical article relating to a computer specialist in the United States is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e
Stub icon

This MUD-related article is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e
P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e