Hammurabi Mendes

Orcid: 0000-0002-3741-5096

Affiliations:
  • Davidson College, Davidson, NC, USA
  • Brown University, Providence, RI, USA (PhD 2016)


According to our database1, Hammurabi Mendes authored at least 20 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Expiring Assets in Automated Market Makers.
CoRR, 2024

2023
Verifying MILP Certificates with SMT Solvers.
CoRR, 2023

2022
Using skip graphs for increased NUMA locality.
J. Parallel Distributed Comput., 2022

Seriema: RDMA-based Remote Invocation with a Case-Study on Monte-Carlo Tree Search.
Proceedings of the 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2022

2021
Seriema: RDMA-based Remote Invocationwith a Case-Study on Monte-Carlo Tree Search.
CoRR, 2021

2019
Layering Data Structures over Skip Graphs for Increased NUMA Locality.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2017
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016
Byzantine Computability and Combinatorial Topology.
PhD thesis, 2016

Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Preserving Happens-before in Persistent Memory.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

2015
Multidimensional agreement in Byzantine systems.
Distributed Comput., 2015

2014
Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding.
CoRR, 2014

The Adaptive Priority Queue with Elimination and Combining.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Distributed computability in Byzantine asynchronous systems.
Proceedings of the Symposium on Theory of Computing, 2014

2013
The Topology of Asynchronous Byzantine Colorless Tasks
CoRR, 2013

Multidimensional approximate agreement in Byzantine asynchronous systems.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
An architecture for P2P bag-of-tasks execution with multiple task allocation policies in desktop grids.
Clust. Comput., 2012

2009
A Concurrent Implementation of Skip Graphs.
Electron. Notes Discret. Math., 2009

Bag-of-Tasks Self-Scheduling over Range-Queriable Search Overlays.
Proceedings of the NPC 2009, 2009

2005
Obtaining possible execution histories on multiple memory consistency models.
Proceedings of the XXV International Conference of the Chilean Computer Science Society, 2005


  Loading...