James Aspnes

Professor of Computer Science


Research Summary

James Aspnes' research emphasizes the use of randomization to solve difficult core problems in the theory of distributed algorithms. His recent work has concentrated on tools for managing large-scale loosely structured systems as found in peer-to-peer networks and wireless sensor networks. These tools include novel distributed data structures supporting efficient range queries over large data sets scattered across many machines, new models of distributed computation that capture the limited resources of individual nodes in sensor systems, and mechanisms for providing security and fault-tolerance in large-scale systems with no restrictions on the arrival of new and possibly malevolent participants. His interests also include related problems in biology, economics, and learning theory.


Selected Publications

  • Aspnes, J., Yang, Y.R., and Yin, Y. (2007). Path-independent load balancing with unreliable machines. 18th Intl. ACM-SIAM Symp. on Disc. Alg:814-823.
  • Angluin, D., Aspnes, J., and Eisenstat, D. (2006). Fast computation by population protocols with a leader. Distributed Computing, 20th Intl. Symp:61-75.

Edit Profile