1.4k citations
- Karlsruhe Institute of TechnologyDE6 papers
- Massachusetts Institute of TechnologyUS6 papers
- University of California, Santa BarbaraUS5 papers
- California Institute of TechnologyUS3 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Goethe University FrankfurtDE3 papers
- Laboratoire de physique des SolidesFR3 papers
- Université Paris-SudFR3 papers
- University of California, BerkeleyUS3 papers
- University of ChicagoUS3 papers
- Albert Einstein College of MedicineUS2 papers
- Center for Theoretical Biological PhysicsUS2 papers
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2003
Compositional competitiveness for distributed algorithms
James Aspnes, Orli Waarts
We define a measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This n…
cs.DS2003★ 1 cited
Fault-tolerant routing in peer-to-peer systems
James Aspnes, Zoe Diamadi, Gauri Shah
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing appro…