1 citations · 1 across the 5 of their papers we have counts for
Showing 2003Show all
3 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
Skip Graphs
James Aspnes, Gauri Shah
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored i…
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…