Maurice P Herlihy

About

Maurice Herlihy is the An Wang Professor of Computer Science at Brown University. He holds an A.B. in Mathematics from Harvard University and a Ph.D. in Computer Science from MIT. He has served on the faculty of Carnegie Mellon University and the staff of DEC Cambridge Research Lab. Herlihy is a distinguished researcher recognized with numerous prestigious awards, including the 2003 Dijkstra Prize in Distributed Computing, the 2004 Gödel Prize in theoretical computer science, the 2008 ISCA influential paper award, the 2012 Edsger W. Dijkstra Prize, and the 2013 Wallace McDowell award. He received a 2012 Fulbright Distinguished Chair in the Natural Sciences and Engineering Lecturing Fellowship. He is a fellow of the ACM, the National Academy of Inventors, the National Academy of Engineering, and the National Academy of Arts and Sciences. In 2022, he won his third Dijkstra Prize. Between 2022 and 2025, he was appointed Fellow-Ambassadeur of the Centre national de recherche scientifique (CNRS) in France. In 2025, he received honorary doctorates from the Università della Svizzera italiana and from Technion (Israel Institute of Technology).

Research topics

• Computer Science
• Computer Security
• Theoretical computer science
• Database
• Programming language
• Business
• Parallel computing

Selected publications

• The Art of Multiprocessor Programming

  Elsevier eBooks · 2020 · 1115 citations

  1st authorCorresponding
  DOI

• Privacy-Preserving Cross-Chain Atomic Swaps

  Lecture notes in computer science · 2020 · 86 citations

  Senior authorCorresponding
  DOI

• HybriDS

  2022-07-10 · 9 citations

  article

  In recent years, the ever-increasing impact of memory access bottlenecks has brought forth a renewed interest in near-memory processing (NMP) architectures. In this work, we propose and empirically evaluate hybrid data structures, which are concurrent data structures custom-designed for these new NMP architectures. We focus on cache-optimized data structures, such as skiplists and B+ trees, that are often used as index structures in online transaction processing (OLTP) systems to enable fast key…

  PublisherDOI

• Methods to Encrypt and Authenticate Digital Files in Distributed Networks and Zero-Trust Environments

  Axioms · 2023-05-29 · 8 citations

  articleOpen accessSenior author

  The methods proposed in this paper are leveraging Challenge–Response–Pair (CRP) mechanisms that are directly using each digital file as a source of randomness. Two use cases are considered: the protection and verification of authenticity of the information distributed in storage nodes and the protection of the files kept in terminal devices operating in contested zero-trust environments comprised of weak signals in the presence of obfuscating electromagnetic noise. With the use of nonces, the me…

  PublisherOA PDFDOI

• Dynamic scheduling in distributed transactional memory

  Distributed Computing · 2021-11-20 · 5 citations

  article
  PublisherDOI

Recent grants

• SHF: Medium: Collaborative Research: Run-Time Support for Scalable Concurrent Programming

  NSF · $540k · 2016–2019

• FMitF:Collaborative Research:Track I:Formal Techniques for Monitoring Low-level Cross-chain Functions

  NSF · $375k · 2019–2023

• Combinatorial Topology and Concurrent Computation

  NSF · $300k · 2009–2014

Frequent coauthors

• R. Iris Bahar

  Brown University

  65 shared

• Sergio Rajsbaum

  59 shared

• Nir Shavit

  56 shared

• Costas Busch

  48 shared

• Victor Luchangco

  43 shared

• Tali Moreshet

  41 shared

• Eric Koskinen

  37 shared

• Jack Dongarra

  35 shared

Labs

• Maurice Herlihy's Personal PagePI

Education

• B.A., Math

  Harvard

• Ph.D., CS

  MIT

Similar researchers at Brown University

• Michael L. Littmanh-83
• Roberto Tamassiah-69
• Eli Upfalh-66