Project Website http://groups.csail.mit.edu/tds/algs.html
The Theory of Distributed Systems (TDS) Group carries out a substantial amount of research on the development of efficient distributed algorithms and data structures, and the proof of lower bound and impossibility results.
Some highlights of prior work include algorithms and impossibility results for distributed consensus, resource allocation, leader election, clock synchronization, self-stabilizing computation, reliable communication over unreliable networks, admission control and routing.