activity
20132021
most citedTight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DC2021

Seriema: RDMA-based Remote Invocationwith a Case-Study on Monte-Carlo Tree Search

Hammurabi Mendes, Bryce Wiedenbeck, Aidan O'Neill

We introduce Seriema, a middleware that integrates RDMA-based remote invocation, asynchronous data transfer, NUMA-aware automatic management of registered memory, and message aggre…

cs.DC2019

Using Skip Graphs for Increased NUMA Locality

Samuel Thomas, Ana Hayne, Jonad Pulaj +1

We present a data partitioning technique performed over skip graphs that promotes significant quantitative and qualitative improvements on NUMA locality in concurrent data structur…

cs.DC2015★ 1 cited

Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems

Hammurabi Mendes, Maurice Herlihy

In this paper, we show that the protocol complex of a Byzantine synchronous system can remain -connected for up to rounds, where is the maximum num…

cs.DC2014

The Adaptive Priority Queue with Elimination and Combining

Irina Calciu, Hammurabi Mendes, Maurice Herlihy

Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations a…

cs.CE2014

Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding

Hammurabi Mendes, Sorin Istrail

Protein Folding is concerned with the reasons and mechanism behind a protein's tertiary structure. The thermodynamic hypothesis of Anfinsen postulates an universal energy function…

cs.DC2013★ 1 cited

Distributed Computability in Byzantine Asynchronous Systems

Hammurabi Mendes, Christine Tasson, Maurice Herlihy

In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give th…