Searching for authors named "Rodrigo Rodrigues" – sorted by Relevance.
-
Large-scale Byzantine fault tolerance: Safe but not always live
- Large-Scale Byzantine Fault Tolerance: Safe but Not Always Live Rodrigo Rodrigues INESC
- Cited by 4 (0 self) – Add To MetaCart
-
A correctness proof for a byzantine-fault-tolerant read/write atomic memory with dynamic replica membership
- with Dynamic Replica Membership Rodrigo Rodrigues and Barbara Liskov MIT Computer Science and Artificial
- Add To MetaCart
-
When Multi-Hop Peer-to-Peer Routing Matters
- When Multi-Hop Peer-to-Peer Routing Matters Rodrigo Rodrigues Charles Blake rodrigo
- Cited by 8 (0 self) – Add To MetaCart
-
When Multi-Hop Peer-to-Peer Lookup Matters
- Abstract When Multi-Hop Peer-to-Peer Lookup Matters Rodrigo Rodrigues Charles Blake rodrigo
- Cited by 3 (0 self) – Add To MetaCart
-
Byzantine clients rendered harmless
- Byzantine Clients Rendered Harmless Barbara Liskov and Rodrigo Rodrigues MIT CSAIL and INESC-ID 32
- Cited by 7 (4 self) – Add To MetaCart
-
Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture
- Rodrigo Rodrigues and Barbara Liskov MIT Computer Science and Artificial Intelligence Laboratory
- Cited by 24 (7 self) – Add To MetaCart
-
Byzantine Fault Tolerance in Long-Lived Systems
- Byzantine Fault Tolerance in Long-Lived Systems Rodrigo Rodrigues and Barbara Liskov MIT Computer
- Cited by 5 (0 self) – Add To MetaCart
-
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
- with maintaining redundancy Charles Blake Rodrigo Rodrigues cb@(email omitted); rodrigo@(email omitted); MIT Laboratory
- Cited by 86 (5 self) – Add To MetaCart
-
High Availability in DHTs: Erasure Coding vs. Replication
- of the required redundancy. Section 5 outlines other positive and negative aspects of the two schemes. Rodrigo
- Cited by 31 (0 self) – Add To MetaCart
-
An Agenda for Robust Peer-to-Peer Storage
- An Agenda for Robust Peer-to-Peer Storage Rodrigo Rodrigues Massachusetts Institute of Technology
- Add To MetaCart

