Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHammurabi Mendes
Person information
- affiliation: Davidson College, Davidson, NC, USA
- affiliation (PhD 2016): Brown University, Providence, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Hammurabi Mendes:
Byzantine Computability and Combinatorial Topology. Brown University, USA, 2016
Journal Articles
- 2022
- [j4]Samuel Thomas, Roxana Hayne, Jonad Pulaj
, Hammurabi Mendes:
Using skip graphs for increased NUMA locality. J. Parallel Distributed Comput. 167: 31-49 (2022) - 2015
- [j3]Hammurabi Mendes, Maurice Herlihy, Nitin H. Vaidya, Vijay K. Garg:
Multidimensional agreement in Byzantine systems. Distributed Comput. 28(6): 423-441 (2015) - 2012
- [j2]Alessandro Ferreira Leite, Hammurabi das Chagas Mendes, Weigang Li, Alba Cristina Magalhaes Alves de Melo, Azzedine Boukerche:
An architecture for P2P bag-of-tasks execution with multiple task allocation policies in desktop grids. Clust. Comput. 15(4): 351-361 (2012) - 2009
- [j1]Hammurabi Mendes, Cristina G. Fernandes:
A Concurrent Implementation of Skip Graphs. Electron. Notes Discret. Math. 35: 263-268 (2009)
Conference and Workshop Papers
- 2022
- [c11]Hammurabi Mendes, Bryce Wiedenbeck, Aidan O'Neill:
Seriema: RDMA-based Remote Invocation with a Case-Study on Monte-Carlo Tree Search. SBAC-PAD 2022: 11-20 - 2020
- [c10]Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes:
Using Skip Graphs for Increased NUMA Locality. SBAC-PAD 2020: 157-166 - 2019
- [c9]Samuel Thomas, Hammurabi Mendes:
Layering Data Structures over Skip Graphs for Increased NUMA Locality. PODC 2019: 422-424 - 2017
- [c8]Hammurabi Mendes, Maurice Herlihy:
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. DISC 2017: 35:1-35:16 - 2016
- [c7]Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott:
Brief Announcement: Preserving Happens-before in Persistent Memory. SPAA 2016: 157-159 - [c6]Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott:
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. DISC 2016: 313-327 - 2014
- [c5]Hammurabi Mendes, Christine Tasson, Maurice Herlihy:
Distributed computability in Byzantine asynchronous systems. STOC 2014: 704-713 - [c4]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. DISC 2014: 406-420 - 2013
- [c3]Hammurabi Mendes, Maurice Herlihy:
Multidimensional approximate agreement in Byzantine asynchronous systems. STOC 2013: 391-400 - 2009
- [c2]Hammurabi das Chagas Mendes, Weigang Li, Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo:
Bag-of-Tasks Self-Scheduling over Range-Queriable Search Overlays. NPC 2009: 109-116 - 2005
- [c1]Alba Cristina Magalhaes Alves de Melo, Nilo S. B. Silva, Hammurabi das Chagas Mendes, Diego F. Aranha:
Obtaining possible execution histories on multiple memory consistency models. SCCC 2005: 93-100
Informal and Other Publications
- 2024
- [i8]Kenan Wood, Maurice Herlihy, Hammurabi Mendes, Jonad Pulaj:
Expiring Assets in Automated Market Makers. CoRR abs/2401.04289 (2024) - 2023
- [i7]Runtian Zhou, Haoze Wu, Hammurabi Mendes, Jonad Pulaj:
Verifying MILP Certificates with SMT Solvers. CoRR abs/2312.10420 (2023) - 2021
- [i6]Hammurabi Mendes, Bryce Wiedenbeck, Aidan O'Neill:
Seriema: RDMA-based Remote Invocationwith a Case-Study on Monte-Carlo Tree Search. CoRR abs/2109.09819 (2021) - 2019
- [i5]Samuel Thomas, Hammurabi Mendes:
Layering Data Structures over Skip Graphs for Increased NUMA Locality. CoRR abs/1902.06891 (2019) - 2015
- [i4]Hammurabi Mendes, Maurice Herlihy:
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. CoRR abs/1505.04224 (2015) - 2014
- [i3]Hammurabi Mendes, Sorin Istrail:
Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding. CoRR abs/1404.0672 (2014) - [i2]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. CoRR abs/1408.1021 (2014) - 2013
- [i1]Hammurabi Mendes, Christine Tasson, Maurice Herlihy:
The Topology of Asynchronous Byzantine Colorless Tasks. CoRR abs/1302.6224 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-25 19:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
