Crystal Kahn

Learn More
By restricting the input to a problem, it often becomes possible to design more accurate or more efficient algorithms to solve that problem. In this thesis we restrict our attention to planar graphs and achieve both these goals. Planar graphs exhibit many structural and combinatorial properties that enable the design of good algorithms. These properties(More)
Peer-to-peer systems have been proposed for a wide variety of applications, such as file-sharing, distributed storage, and distributed computation. These systems seek the benefits of a decentralized design—chiefly, the ability of a system to self-scale as new participants join, since participants are motivated to contribute resources that oset the added(More)
  • 1