Searching for authors named "Jeffrey Considine" – sorted by Relevance.
21 documents found, showing 1 through 10.
Next 10 →
-
Deciding Isomorphisms of Simple Types in Polynomial Time
- …The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied - these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under…
- Cited by 5 (0 self) – Add To MetaCart
-
Cluster-based Optimizations for Distributed Hash Tables
- …Cluster-based Optimizations for Distributed Hash Tables Jeffrey Considine jconsidi…
- Cited by 1 (0 self) – Add To MetaCart
-
Generating Good Degree Distributions for Sparse Parity Check Codes using Oracles
- …Fast forward error correction codes are becoming an important component in bulk content delivery. They fit in naturally with multicast scenarios as a way to deal with losses and are now seeing use in peer to peer networks as a basis for distributing load. In particular, new irregular sparse parity c…
- Cited by 3 (2 self) – Add To MetaCart
-
Scalable Peer-to-Peer Indexing with Constant State
- …Abstract Scalable Peer-to-Peer Indexing with Constant State Jeffrey Considine jconsidi…
- Cited by 5 (1 self) – Add To MetaCart
-
Simple Load Balancing for Distributed Hash Tables
- …Simple Load Balancing for Distributed Hash Tables John Byers byers@(email omitted); Jeffrey Considine…
- Cited by 56 (1 self) – Add To MetaCart
-
Geometric Generalizations of the Power of Two Choices
- …A well-known paradigm for load balancing in distributed systems is the "power of two choices," whereby an item is stored at the less loaded of two (or more) random alternative servers. We investigate the power of two choices in natural settings for distributed computing where items and servers resid…
- Cited by 24 (3 self) – Add To MetaCart
-
Fast Approximate Reconciliation of Set Differences
- …We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In the approximate reconciliation problem, peers A and B respectively have subset…
- Cited by 11 (3 self) – Add To MetaCart
-
Approximate aggregation techniques for sensor databases
- …Approximate Aggregation Techniques for Sensor Databases Jeffrey Considine, Feifei Li, George…
- Cited by 151 (5 self) – Add To MetaCart
-
Byzantine agreement with faulty majority using bounded broadcast
- … Broadcast Abstract Jeffrey Considine, Leonid A. Levin ∗ , David Metcalf Boston University † Byzantine…
- Cited by 5 (0 self) – Add To MetaCart
-
A Constraint Satisfaction Approach to Testbed Embedding Services
- …A Constraint Satisfaction Approach to Testbed Embedding Services Jeffrey Considine John W. Byers…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
