| Optimizing All-to-All Data Transmission in WANs | 0 | 0.34 | 2021 |
| Deadline-Aware Cost Optimization for Spark | 0 | 0.34 | 2021 |
| Consistify - preserving correctness and SLA under weak consistency. | 0 | 0.34 | 2019 |
| Tutorial: Specifying, Implementing, and Verifying Algorithms for Persistent Memory | 0 | 0.34 | 2019 |
| Ocean Vista: Gossip-Based Visibility Control for Speedy Geo-Distributed Transactions. | 1 | 0.34 | 2019 |
| Shallow Overlay Trees Suffice for High-Throughput Consensus. | 0 | 0.34 | 2019 |
| Recoverable Mutual Exclusion Under System-Wide Failures. | 0 | 0.34 | 2018 |
| RCanopus: Making Canopus Resilient to Failures and Byzantine Faults. | 1 | 0.39 | 2018 |
| Computing k-Atomicity in Polynomial Time. | 0 | 0.34 | 2018 |
| Recoverable Consensus in Shared Memory. | 0 | 0.34 | 2018 |
| Adaptable SLA-Aware Consistency Tuning for Quorum-Replicated Datastores. | 1 | 0.38 | 2017 |
| Efficient Incremental Data Analytics With Apache Spark | 0 | 0.34 | 2017 |
| ALOHA-KV: high performance read-only and write-only distributed transactions. | 0 | 0.34 | 2017 |
| Smart Meter Data Analytics: Systems, Algorithms, and Benchmarking. | 8 | 0.54 | 2017 |
| Recoverable Mutual Exclusion in Sub-logarithmic Time. | 3 | 0.40 | 2017 |
| Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems. | 1 | 0.37 | 2017 |
| Benchmarking Smart Meter Data Analytics. | 0 | 0.34 | 2015 |
| Eventually Consistent: Not What You Were Expecting? | 8 | 0.52 | 2014 |
| Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms | 4 | 0.48 | 2013 |
| On the k-Atomicity-Verification Problem | 6 | 0.45 | 2013 |
| Client-Centric Benchmarking of Eventual Consistency for Cloud Storage Systems | 15 | 0.72 | 2013 |
| Toward a principled framework for benchmarking consistency | 27 | 1.09 | 2012 |
| Minuet: a scalable distributed multiversion B-tree | 13 | 0.64 | 2012 |
| Linearizable implementations do not suffice for randomized distributed computation | 7 | 0.49 | 2011 |
| A complexity separation between the cache-coherent and distributed shared memory models. | 1 | 0.36 | 2011 |
| Analyzing consistency properties for fun and profit | 28 | 1.17 | 2011 |
| Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors | 0 | 0.34 | 2010 |
| Closing the complexity gap between mutual exclusion and FCFS mutual exclusion | 5 | 0.45 | 2008 |
| Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion | 18 | 0.79 | 2008 |
| Review of DISC 2008 | 0 | 0.34 | 2008 |
| A practical scalable distributed B-tree | 40 | 1.96 | 2008 |
| Path selection in user-controlled circuit-switched optical networks | 4 | 0.42 | 2008 |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations | 19 | 0.85 | 2007 |
