Skip to content

Maurice Herlihy

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

135

Venues

36

Active years

1983–2026

Best venue rank

A*

Where they publish

Papers

135 indexed papers, newest first.

YearVenueTitleAuthors
2026SIROCCOByzantine Approximate Agreement Cross-chain Task.Maurice Herlihy, Bo Pan, Maria Potop-Butucaru, Liuba Shrira
2025SIROCCOAsynchronous Byzantine Consensus with Trusted Monotonic Counters.Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop-Butucaru
2025SSSBrief Announcement: Cross-Chain Consensus.Sucharita Jayanti, Maurice Herlihy
2024SSSByzantine Reliable Broadcast with One Trusted Monotonic Counter.Yackolley Amoussou-Guenou, Lionel Beltrando, Maurice Herlihy, Maria Potop-Butucaru
2024SSSInvited Paper: The Smart Contract Model.Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop-Butucaru, Sergio Rajsbaum
2023ICDCNInvited Paper: Fault-tolerant and Expressive Cross-Chain Swaps.Yingjie Xue, Di Jin, Maurice Herlihy
2022ICDCSDistributed Runtime Verification of Metric Temporal Properties for Cross-Chain Protocols.Ritam Ganguly, Yingjie Xue, Aaron Jonckheere, Parker Ljung, Benjamin Schornstein, Borzoo Bonakdarpour, Maurice Herlihy
2022SPAAHybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures.Jiwon Choe, Andrew Crotty, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
2022SSSFlexible Scheduling of Transactional Memory on Trees.Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma
2022SSSInvited Paper: Cross-Chain State Machine Replication.Yingjie Xue, Maurice Herlihy
2021AFTComposing networks of automated market makers.Daniel Engel, Maurice Herlihy
2021PODCBrief Announcement: Linearizability: A Typo.Gal Sela, Maurice Herlihy, Erez Petrank
2021PODCHedging Against Sore Loser Attacks in Cross-Chain Transactions.Yingjie Xue, Maurice Herlihy
2021SPAAVBR: Version Based Reclamation.Gali Sheffi, Maurice Herlihy, Erez Petrank
2021SSSFailure is (literally) an Option: Atomic Commitment vs Optionality in Decentralized Finance.Daniel Engel, Maurice Herlihy, Yingjie Xue
2020FCPrivacy-Preserving Cross-Chain Atomic Swaps.Apoorvaa Deshpande, Maurice Herlihy
2020HPDCFFT-based Gradient Sparsification for the Distributed Training of Deep Neural Networks.Linnan Wang, Wei Wu, Junyu Zhang, Hang Liu, George Bosilca, Maurice Herlihy, Rodrigo Fonseca
2019APLASConflict Abstractions and Shadow Speculation for Optimistic Transactional Objects.Thomas D. Dickerson, Eric Koskinen, Paul Gazzillo, Maurice Herlihy
2019SPAAConcurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation.Jiwon Choe, Amy Huang, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
2018FCProof-Carrying Smart Contracts.Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Vikram Saraph, Eric Koskinen
2018ICFPAuthenticated modular maps in Haskell.Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy
2018PODCAtomic Cross-Chain Swaps.Maurice Herlihy
2018PPoPPA persistent lock-free queue for non-volatile memory.Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank
2018SSSClairvoyant State Machine Replications.Rida A. Bazzi, Maurice Herlihy
2018SSSLoad Balanced Distributed Directories.Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy
2017OPODISThe Teleportation Design Pattern for Hardware Transactional Memory.Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2017PODCBrief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures.Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
2017PODCAdding Concurrency to Smart Contracts.Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
2017PODCBlockchains and the Future of Distributed Computing.Maurice Herlihy
2017PPoPPPOSTER: State Teleportation via Hardware Transactional Memory.Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2017SPAAFast Scheduling in Distributed Transactional Memory.Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma
2017SPAAConcurrent Data Structures for Near-Memory Computing.Zhiyu Liu, Irina Calciu, Maurice Herlihy, Onur Mutlu
2016CASESThrifty-malloc: A HW/SW codesign for the dynamic management of hardware transactional memory in embedded multicore systems.Thomas Carle, Dimitra Papagiannopoulou, Tali Moreshet, Andrea Marongiu, Maurice Herlihy, R. Iris Bahar
2016LICSBlockchains and the Logic of Accountability: Keynote Address.Maurice Herlihy, Mark Moir
2016SPAAFast and Robust Memory Reclamation for Concurrent Data Structures.Oana Balmau, Rachid Guerraoui, Maurice Herlihy, Igor Zablotchi
2015EuroParA Practical Transactional Memory Interface.Shahar Timnat, Maurice Herlihy, Erez Petrank
2015OPODISThe Relative Power of Composite Loop Agreement Tasks.Vikram Saraph, Maurice Herlihy
2015PODCImpossibility Results for Distributed Transactional Memory.Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma
2014ESOPComposable Transactional Objects: A Position Paper.Maurice Herlihy, Eric Koskinen
2014EuroSysStackTrack: an automated transactional approach to concurrent memory reclamation.Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit
2014ICALPSporadic Solutions to Zero-One Exclusion Tasks.Eli Gafni, Maurice Herlihy
2014LATINComputing in the Presence of Concurrent Solo Executions.Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer
2014PODCThe future(s) of shared data structures.Alex Kogan, Maurice Herlihy
2014PPoPPWell-structured futures and cache locality.Maurice Herlihy, Zhiyu Liu
2014SIGMODFun with hardware transactional memory.Maurice Herlihy
2014STOCDistributed computability in Byzantine asynchronous systems.Hammurabi Mendes, Christine Tasson, Maurice Herlihy
2013ISCATransparent and energy-efficient speculation on NUMA architectures for embedded MPSoCs.Dimitra Papagiannopoulou, R. Iris Bahar, Tali Moreshet, Maurice Herlihy, Andrea Marongiu, Luca Benini
2013OPODISMessage Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores.Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir
2013PODCUpper bound on the complexity of solving hard renaming.Hagit Attiya, Armando Castaeda, Maurice Herlihy, Ami Paz
2013STOCMultidimensional approximate agreement in Byzantine asynchronous systems.Hammurabi Mendes, Maurice Herlihy
2012LATINAn Equivariance Theorem with Applications to Renaming.Armando Castaeda, Maurice Herlihy, Sergio Rajsbaum
2012PODCSimulations and reductions for colorless tasks.Maurice Herlihy, Sergio Rajsbaum
2011OPODISOn the Nature of Progress.Maurice Herlihy, Nir Shavit
2011PODCOn the power of hardware transactional memory to simplify memory management.Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir
2011PODCTransforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions.Maurice Herlihy, Yoram Moses, Mark R. Tuttle
2010CONCURApplications of Shellable Complexes to Distributed Computing - (Invited Talk).Maurice Herlihy
2010ICDCITTransactional Memory Today.Maurice Herlihy
2010PODCThe topology of shared-memory adversaries.Maurice Herlihy, Sergio Rajsbaum
2010POPLCoarse-grained transactions.Eric Koskinen, Matthew J. Parkinson, Maurice Herlihy
2009ICDCNDistributed Computing and the Multicore Revolution.Maurice Herlihy
2009OPODISEnhanced Fault-Tolerance through Byzantine Failure Detection.Rida A. Bazzi, Maurice Herlihy
2009OPODISTransactional Memory Today: A Status Report.Maurice Herlihy
2009PODCBrief announcement: concurrent non-commutative boosted transactions.Eric Koskinen, Maurice Herlihy
2009PPoPPCommitting conflicting transactions in an STM.Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Emmett Witchel
2008PODCThe future of distributed computing: renaissance or reformation?Maurice Herlihy
2008PPoPPTransactional boosting: a methodology for highly-concurrent transactional objects.Maurice Herlihy, Eric Koskinen
2008SPAACheckpoints and continuations instead of nested transactions.Eric Koskinen, Maurice Herlihy
2008SPAADreadlocks: efficient deadlock detection.Eric Koskinen, Maurice Herlihy
2007ICDCITLanguage Support and Compiler Optimizations for STM and Transactional Boosting.Guy Eddon, Maurice Herlihy
2007PODCOn the weakest failure detector ever.Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport
2007PPoPPPotential show-stoppers for transactional synchronization.Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael L. Scott
2007SIROCCOA Simple Optimistic Skiplist Algorithm.Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
2006OOPSLAA flexible framework for implementing software transactional memory.Maurice Herlihy, Victor Luchangco, Mark Moir
2006OPODISA Topological Treatment of Early-Deciding Set-Agreement.Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
2006PODCTowards a theory of transactional contention managers.Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
2006PODCThe art of multiprocessor programming.Maurice Herlihy
2006PPoPPProving correctness of highly-concurrent linearisable objects.Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro
2006SPAAEnergy implications of multiprocessor synchronization.Tali Moreshet, R. Iris Bahar, Maurice Herlihy
2005ICDCSVirtual Leashing: Internet-Based Software Piracy Protection.Ori Dvir, Maurice Herlihy, Nir Shavit
2005ISCAVirtualizing Transactional Memory.Ravi Rajwar, Maurice Herlihy, Konrad K. Lai
2005ISLPEDEnergy reduction in multiprocessor systems using transactional memory.Tali Moreshet, R. Iris Bahar, Maurice Herlihy
2005OPODISOptimal Randomized Fair Exchange with Secret Shared Coins.Felix C. Freiling, Maurice Herlihy, Lucia Draque Penso
2005OPODISA Lazy Concurrent List-Based Set Algorithm.Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit
2005PLDIThe transactional manifesto: software engineering and non-blocking synchronization.Maurice Herlihy
2005PODCToward a theory of transactional contention managers.Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
2005PPoPPComposable memory transactions.Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy
2004PODCBringing practical lock-free synchronization to 64-bit applications.Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir
2003ICDCSObstruction-Free Synchronization: Double-Ended Queues as an Example.Maurice Herlihy, Victor Luchangco, Mark Moir
2003ICDCSSelf-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura.Maurice Herlihy, Srikanta Tirthapura
2003PODCSoftware transactional memory for dynamic-sized data structures.Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III
2003PODCtight bounds for k-set agreement with limited-scope failure detectors.Maurice Herlihy, Lucia Draque Penso
2002PODCDynamic-sized lock-free data structures.Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
2001PODCAdding networks.Panagiota Fatourou, Maurice Herlihy
2001PODCOn beyond registers: wait-free readable objects.Maurice Herlihy
2001PODCCompetitive concurrent distributed queuing.Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
2001SPAARouting without flow control.Costas Busch, Maurice Herlihy, Roger Wattenhofer
2000EuroParA Combinatorial Characterization of Properties Preserved by Antitokens.Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
2000FOCSOn the Existence of Booster Types.Maurice Herlihy, Eric Ruppert
2000SODARandomized greedy hot-potato routing.Costas Busch, Maurice Herlihy, Roger Wattenhofer
2000STOCHard-Potato routing.Costas Busch, Maurice Herlihy, Roger Wattenhofer
1999MFCSNew Perspectives in Distributed Computing.Maurice Herlihy, Sergio Rajsbaum
1999STACSSupporting Increment and Decrement Operations in Balancing Networks.William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
1999SPAASorting and Counting Networks of Small Depth and Arbitrary Width.Costas Busch, Maurice Herlihy
1999SIROCCOThreshold Counters with Increments and Decrements.Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
1998PODCUnifying Synchronous and Asynchronous Message-Passing Models.Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
1997STOCThe Decidability of Distributed Decision Tasks (Extended Abstract).Maurice Herlihy, Sergio Rajsbaum
1996PODCOn the Decidability of Distributed Decision Tasks (Brief Announcement).Maurice Herlihy, Sergio Rajsbaum
1995PODCAlgebraic Spans (Preliminary Version).Maurice Herlihy, Sergio Rajsbaum
1994PODCSet Consensus Using Arbitrary Objects (Preliminary Version).Maurice Herlihy, Sergio Rajsbaum
1994STOCA simple constructive computability theorem for wait-free computation.Maurice Herlihy, Nir Shavit
1993FOCSA Tight Lower Bound for k-Set AgreementSoma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle
1993ISCATransactional Memory: Architectural Support for Lock-Free Data Structures.Maurice Herlihy, J. Eliot B. Moss
1993PODCBounded Round Numbers.Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993PODCOn the Space Complexity of Randomized Synchronization.Faith E. Fich, Maurice Herlihy, Nir Shavit
1993STOCContention in shared memory algorithms.Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993STOCThe asynchronous computability theorem for t-resilient tasks.Maurice Herlihy, Nir Shavit
1992SPAALow Contention Load Balancing on Large-Scale Multiprocessors.Maurice Herlihy, Beng-Hong Lim, Nir Shavit
1991FOCSLow Contention Linearizable CountingMaurice Herlihy, Nir Shavit, Orli Waarts
1991PODCRandomized Wait-Free Concurrent Objects (Extended Abstract).Maurice Herlihy
1991STOCCounting Networks and Multi-Processor CoordinationJames Aspnes, Maurice Herlihy, Nir Shavit
1991SPAAImpossibility Results for Asynchronous PRAM (Extended Abstract).Maurice Herlihy
1991SPAALock-Free garbage Collection for Multiprocessors.Maurice Herlihy, J. Eliot B. Moss
1990PODCLower Bounds for Wait-Free Computation in Message-Passing Systems.Maurice Herlihy, Mark R. Tuttle
1990PPoPPA Methodology for Implementing Highly Concurrent Data Structures.Maurice Herlihy
1990SPAAWait-Free Data Structures in the Asynchronous PRAM Model.James Aspnes, Maurice Herlihy
1988PODCImpossibility and Universality Results for Wait-Free Synchronization.Maurice Herlihy
1988PODSHybrid Concurrency Control for Abstract Data Types.Maurice Herlihy, William E. Weihl
1987CRYPTOHow to Make Replicated Data Secure.Maurice Herlihy, J. D. Tygar
1987PODCSpecifying Graceful Degradation in Distributed Systems.Maurice Herlihy, Jeannette M. Wing
1987POPLAxioms for Concurrent Objects.Maurice Herlihy, Jeannette M. Wing
1986PODCOptimistic Concurrency Control for Abstract Data Types.Maurice Herlihy
1986POPLLimitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing.Barbara Liskov, Maurice Herlihy, Lucy Gilbert
1986SRDSTime-Driven Orphan Elimination.Martin S. McKendry, Maurice Herlihy
1985PODCComparing How Atomicity Mechanisms Support Replication.Maurice Herlihy
1983SRDSIssues Process and Communication Structure for Distributed Programs.Barbara Liskov, Maurice Herlihy