1 citations · 1 across the 5 of their papers we have counts for
8 papers
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…
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…
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…
Randomized protocols for asynchronous consensus
James Aspnes
The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if e…
Fast Deterministic Consensus in a Noisy Environment
James Aspnes
It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, c…
Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model
James Aspnes, Julia Hartling, Ming-Yang Kao +2
In modern biology, one of the most important research problems is to understand how protein sequences fold into their native 3D structures. To investigate this problem at a high le…