Hammurabi Mendes

27 papers A* 3A 3B 3C 2Journal 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Satisfiability modulo theories for verifying MILP certificates. J. Symb. Comput. Kenan Wood, Runtian Zhou, Haoze Wu, Hammurabi Mendes, Jonad Pulaj
2025	J	`jnl`	An LLVM-Based Optimization Pipeline for SPDZ. CoRR Tianye Dai, Hammurabi Mendes, HeuiChan Lim
2024	J	`jnl`	An Optimal Multilevel Quorum System for Probabilistic Consensus. CoRR Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024	B	`conf`	Distributed Agreement in the Arrovian Framework. OPODIS Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024	J	`jnl`	Distributed Agreement in the Arrovian Framework. CoRR Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024	J	`jnl`	Expiring Assets in Automated Market Makers. CoRR Kenan Wood, Maurice Herlihy, Hammurabi Mendes, Jonad Pulaj
2024	B	`conf`	Optimal Multilevel Slashing for Blockchains. OPODIS Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2023	J	`jnl`	Verifying MILP Certificates with SMT Solvers. CoRR Runtian Zhou, Haoze Wu, Hammurabi Mendes, Jonad Pulaj
2022	C	`conf`	Seriema: RDMA-based Remote Invocation with a Case-Study on Monte-Carlo Tree Search. SBAC-PAD Hammurabi Mendes, Bryce Wiedenbeck, Aidan O'Neill
2022	J	`jnl`	Using skip graphs for increased NUMA locality. J. Parallel Distributed Comput. Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes
2021	J	`jnl`	Seriema: RDMA-based Remote Invocationwith a Case-Study on Monte-Carlo Tree Search. CoRR Hammurabi Mendes, Bryce Wiedenbeck, Aidan O'Neill
2020	C	`conf`	Using Skip Graphs for Increased NUMA Locality. SBAC-PAD Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes
2019	A*	`conf`	Layering Data Structures over Skip Graphs for Increased NUMA Locality. PODC Samuel Thomas, Hammurabi Mendes
2019	J	`jnl`	Layering Data Structures over Skip Graphs for Increased NUMA Locality. CoRR Samuel Thomas, Hammurabi Mendes
2017	A	`conf`	Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. DISC Hammurabi Mendes, Maurice Herlihy
2016	B	`conf`	Brief Announcement: Preserving Happens-before in Persistent Memory. SPAA Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott
2016	—	`—`	Byzantine Computability and Combinatorial Topology. Hammurabi Mendes
2016	A	`conf`	Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. DISC Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott
2015	J	`jnl`	Multidimensional agreement in Byzantine systems. Distributed Comput. Hammurabi Mendes, Maurice Herlihy, Nitin H. Vaidya, Vijay K. Garg
2015	J	`jnl`	Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. CoRR Hammurabi Mendes, Maurice Herlihy
2014	A*	`conf`	Distributed computability in Byzantine asynchronous systems. STOC Hammurabi Mendes, Christine Tasson, Maurice Herlihy
2014	A	`conf`	The Adaptive Priority Queue with Elimination and Combining. DISC Irina Calciu, Hammurabi Mendes, Maurice Herlihy
2014	J	`jnl`	The Adaptive Priority Queue with Elimination and Combining. CoRR Irina Calciu, Hammurabi Mendes, Maurice Herlihy
2014	J	`jnl`	Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding. CoRR Hammurabi Mendes, Sorin Istrail
2013	A*	`conf`	Multidimensional approximate agreement in Byzantine asynchronous systems. STOC Hammurabi Mendes, Maurice Herlihy
2013	J	`jnl`	The Topology of Asynchronous Byzantine Colorless Tasks CoRR Hammurabi Mendes, Christine Tasson, Maurice Herlihy
2009	J	`jnl`	A Concurrent Implementation of Skip Graphs. Electron. Notes Discret. Math. Hammurabi Mendes, Cristina G. Fernandes