![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Maurice Herlihy
Person information
- affiliation: Brown University, Providence, USA
- award (2013): W. Wallace McDowell Award
- award (2012): Dijkstra Prize
- award (2004): Gödel Prize
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j93]Ritam Ganguly, Yingjie Xue, Aaron Jonckheere, Parker Ljung, Benjamin Schornstein, Borzoo Bonakdarpour, Maurice Herlihy:
Distributed runtime verification of metric temporal properties. J. Parallel Distributed Comput. 185: 104801 (2024) - [i32]Kenan Wood, Maurice Herlihy, Hammurabi Mendes, Jonad Pulaj:
Expiring Assets in Automated Market Makers. CoRR abs/2401.04289 (2024) - [i31]Yackolley Amoussou-Guenou, Lionel Beltrando, Maurice Herlihy, Maria Potop-Butucaru:
Byzantine Reliable Broadcast with One Trusted Monotonic Counter. IACR Cryptol. ePrint Arch. 2024: 774 (2024) - 2023
- [j92]Bertrand Cambou
, Christopher Robert Philabaum, Jeffrey Hoffstein, Maurice Herlihy:
Methods to Encrypt and Authenticate Digital Files in Distributed Networks and Zero-Trust Environments. Axioms 12(6): 531 (2023) - [j91]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible scheduling of transactional memory on trees. Theor. Comput. Sci. 978: 114184 (2023) - [c186]Yingjie Xue
, Di Jin
, Maurice Herlihy
:
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps. ICDCN 2023: 28-37 - 2022
- [j90]Maria Potop-Butucaru, Ariel Orda, Maurice Herlihy, Stefano Secci:
Special issue on blockchain networks and distributed protocols. Ann. des Télécommunications 77(1-2): 1-2 (2022) - [j89]Costas Busch
, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Dynamic scheduling in distributed transactional memory. Distributed Comput. 35(1): 19-36 (2022) - [j88]Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy:
Load balanced distributed directories. Inf. Comput. 285(Part): 104700 (2022) - [j87]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant state machine replication. Inf. Comput. 285(Part): 104701 (2022) - [j86]Maurice Herlihy
, Barbara Liskov, Liuba Shrira:
Cross-chain deals and adversarial commerce. VLDB J. 31(6): 1291-1309 (2022) - [c185]Samuel Thomas, Jiwon Choe, Ofir Gordon, Erez Petrank, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
:
Towards Hardware Accelerated Garbage Collection with Near-Memory Processing. HPEC 2022: 1-6 - [c184]Ritam Ganguly, Yingjie Xue, Aaron Jonckheere, Parker Ljung, Benjamin Schornstein, Borzoo Bonakdarpour, Maurice Herlihy:
Distributed Runtime Verification of Metric Temporal Properties for Cross-Chain Protocols. ICDCS 2022: 23-33 - [c183]Jiwon Choe, Andrew Crotty, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
:
HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures. SPAA 2022: 321-332 - [c182]Yingjie Xue
, Maurice Herlihy
:
Invited Paper: Cross-Chain State Machine Replication. SSS 2022: 51-65 - [c181]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic
, Pavan Poudel, Gokarna Sharma
:
Flexible Scheduling of Transactional Memory on Trees. SSS 2022: 146-163 - [e10]Maurice Herlihy, Neha Narula:
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, AFT 2022, Cambridge, MA, USA, September 19-21, 2022. ACM 2022, ISBN 978-1-4503-9861-9 [contents] - [i30]Ritam Ganguly, Yingjie Xue, Aaron Jonckheere, Parker Ljung, Benjamin Schornstein, Borzoo Bonakdarpour, Maurice Herlihy:
Distributed Runtime Verification of Metric Temporal Properties for Cross-Chain Protocols. CoRR abs/2204.09796 (2022) - [i29]Yingjie Xue, Maurice Herlihy:
Cross-Chain State Machine Replication. CoRR abs/2206.07042 (2022) - [i28]Yingjie Xue, Di Jin, Maurice Herlihy:
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps. CoRR abs/2211.00208 (2022) - 2021
- [b3]Antonio Fernández Anta, Chryssis Georgiou, Maurice Herlihy, Maria Potop-Butucaru:
Principles of Blockchain Systems. Synthesis Lectures on Computer Science, Morgan & Claypool Publishers 2021, ISBN 978-3-031-00679-1, pp. 1-213 - [j85]Konstantinos Stylianou
, Leonhard Spiegelberg, Maurice Herlihy, Nic Carter:
Cryptocurrency Competition and Market Concentration in the Presence of Network Effects. Ledger 6 (2021) - [j84]Costas Busch
, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. Theory Comput. Syst. 65(2): 296-322 (2021) - [c180]Daniel Engel, Maurice Herlihy:
Composing networks of automated market makers. AFT 2021: 15-28 - [c179]Yingjie Xue, Maurice Herlihy:
Hedging Against Sore Loser Attacks in Cross-Chain Transactions. PODC 2021: 155-164 - [c178]Gal Sela
, Maurice Herlihy, Erez Petrank:
Brief Announcement: Linearizability: A Typo. PODC 2021: 561-564 - [c177]Gali Sheffi, Maurice Herlihy, Erez Petrank:
VBR: Version Based Reclamation. SPAA 2021: 443-445 - [c176]Daniel Engel, Maurice Herlihy
, Yingjie Xue:
Failure is (literally) an Option: Atomic Commitment vs Optionality in Decentralized Finance. SSS 2021: 66-77 - [c175]Daniel Engel, Maurice Herlihy:
Presentation and Publication: Loss and Slippage in Networks of Automated Market Makers. Tokenomics 2021: 13:1-13:23 - [c174]Gali Sheffi, Maurice Herlihy, Erez Petrank:
VBR: Version Based Reclamation. DISC 2021: 35:1-35:18 - [i27]Konstantinos Stylianou, Leonhard Spiegelberg, Maurice Herlihy, Nic Carter:
Cryptoasset Competition and Market Concentration in the Presence of Network Effects. CoRR abs/2101.06210 (2021) - [i26]Yingjie Xue, Maurice Herlihy:
Hedging Against Sore Loser Attacks in Cross-Chain Transactions. CoRR abs/2105.06322 (2021) - [i25]Gal Sela, Maurice Herlihy, Erez Petrank:
Linearizability: a Typo. CoRR abs/2105.06737 (2021) - [i24]Daniel Engel, Maurice Herlihy:
Composing Networks of Automated Market Makers. CoRR abs/2106.00083 (2021) - [i23]Gali Sheffi, Maurice Herlihy, Erez Petrank:
VBR: Version Based Reclamation. CoRR abs/2107.13843 (2021) - [i22]Daniel Engel, Maurice Herlihy, Yingjie Xue:
Invited Paper: Failure is (literally) an Option: Atomic Commitment vs Optionality in Decentralized Finance. CoRR abs/2109.12167 (2021) - [i21]Daniel Engel, Maurice Herlihy:
Presentation and Publication: Loss and Slippage in Networks of Automated Market Makers. CoRR abs/2110.09872 (2021) - 2020
- [j83]Karthik Nandakumar, Nalini K. Ratha, Sharath Pankanti
, Alex Pentland, Maurice Herlihy:
Blockchain: From Technology to Marketplaces. Computer 53(7): 14-18 (2020) - [j82]Thomas D. Dickerson, Paul Gazzillo
, Maurice Herlihy, Eric Koskinen
:
Adding concurrency to smart contracts. Distributed Comput. 33(3-4): 209-225 (2020) - [c173]Apoorvaa Deshpande, Maurice Herlihy:
Privacy-Preserving Cross-Chain Atomic Swaps. Financial Cryptography Workshops 2020: 540-549 - [c172]Linnan Wang, Wei Wu, Junyu Zhang, Hang Liu, George Bosilca, Maurice Herlihy, Rodrigo Fonseca:
FFT-based Gradient Sparsification for the Distributed Training of Deep Neural Networks. HPDC 2020: 113-124 - [c171]Costas Busch, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Dynamic Scheduling in Distributed Transactional Memory. IPDPS 2020: 874-883 - [e9]Vincent Danos, Maurice Herlihy, Maria Potop-Butucaru, Julien Prat, Sara Tucci Piergiovanni:
International Conference on Blockchain Economics, Security and Protocols, Tokenomics 2019, May 6-7, 2019, Paris, France. OASIcs 71, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-108-5 [contents]
2010 – 2019
- 2019
- [j81]Maurice Herlihy:
Blockchains from a distributed computing perspective. Commun. ACM 62(2): 78-85 (2019) - [j80]Archita Agarwal, Maurice Herlihy, Seny Kamara, Tarik Moataz:
Encrypted Databases for Differential Privacy. Proc. Priv. Enhancing Technol. 2019(3): 170-190 (2019) - [j79]Maurice Herlihy, Liuba Shrira, Barbara Liskov:
Cross-chain Deals and Adversarial Commerce. Proc. VLDB Endow. 13(2): 100-113 (2019) - [j78]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
:
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48(1): 1-32 (2019) - [c170]Thomas D. Dickerson, Eric Koskinen, Paul Gazzillo
, Maurice Herlihy:
Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects. APLAS 2019: 313-331 - [c169]Jiwon Choe, Tali Moreshet, R. Iris Bahar
, Maurice Herlihy:
Attacking memory-hard scrypt with near-data-processing. MEMSYS 2019: 33-37 - [c168]Samuel Irving, Sui Chen, Lu Peng, Costas Busch, Maurice Herlihy, Christopher J. Michael:
CUDA-DTM: Distributed Transactional Memory for GPU Clusters. NETYS 2019: 183-199 - [c167]Jiwon Choe, Amy Huang, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
:
Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation. SPAA 2019: 297-308 - [c166]Vikram Saraph, Maurice Herlihy:
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts. Tokenomics 2019: 4:1-4:15 - [e8]Iris Bahar, Maurice Herlihy, Emmett Witchel, Alvin R. Lebeck:
Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2019, Providence, RI, USA, April 13-17, 2019. ACM 2019, ISBN 978-1-4503-6240-5 [contents] - [i20]Vikram Saraph, Maurice Herlihy:
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts. CoRR abs/1901.01376 (2019) - [i19]Maurice Herlihy, Barbara Liskov, Liuba Shrira:
Cross-chain Deals and Adversarial Commerce. CoRR abs/1905.09743 (2019) - [i18]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant State Machine Replication. CoRR abs/1905.11607 (2019) - 2018
- [j77]Costas Busch
, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Time-communication impossibility results for distributed transactional memory. Distributed Comput. 31(6): 471-487 (2018) - [j76]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. Bull. EATCS 124 (2018) - [j75]Dimitra Papagiannopoulou, Andrea Marongiu, Tali Moreshet, Luca Benini
, Maurice Herlihy, R. Iris Bahar
:
Hardware Transactional Memory Exploration in Coherence-Free Many-Core Architectures. Int. J. Parallel Program. 46(6): 1304-1328 (2018) - [j74]Vikram Saraph
, Maurice Herlihy, Eli Gafni:
An algorithmic approach to the asynchronous computability theorem. J. Appl. Comput. Topol. 1(3-4): 451-474 (2018) - [j73]Dave Dice, Maurice Herlihy, Alex Kogan:
Improving Parallelism in Hardware Transactional Memory. ACM Trans. Archit. Code Optim. 15(1): 9:1-9:24 (2018) - [c165]Thomas D. Dickerson, Paul Gazzillo
, Maurice Herlihy, Vikram Saraph, Eric Koskinen:
Proof-Carrying Smart Contracts. Financial Cryptography Workshops 2018: 325-338 - [c164]Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy:
Authenticated modular maps in Haskell. TyDe@ICFP 2018: 1-13 - [c163]Maurice Herlihy:
Atomic Cross-Chain Swaps. PODC 2018: 245-254 - [c162]Michal Friedman
, Maurice Herlihy, Virendra J. Marathe, Erez Petrank:
A persistent lock-free queue for non-volatile memory. PPoPP 2018: 28-40 - [c161]Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy:
Load Balanced Distributed Directories. SSS 2018: 221-238 - [c160]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant State Machine Replications. SSS 2018: 254-268 - [i17]Maurice Herlihy:
Atomic Cross-Chain Swaps. CoRR abs/1801.09515 (2018) - [i16]Linnan Wang, Wei Wu, Yiyang Zhao, Junyu Zhang, Hang Liu, George Bosilca, Jack J. Dongarra, Maurice Herlihy, Rodrigo Fonseca:
SuperNeurons: FFT-based Gradient Sparsification in the Distributed Training of Deep Neural Networks. CoRR abs/1811.08596 (2018) - [i15]Archita Agarwal, Maurice Herlihy, Seny Kamara, Tarik Moataz:
Encrypted Databases for Differential Privacy. IACR Cryptol. ePrint Arch. 2018: 860 (2018) - 2017
- [j72]Maurice Herlihy, Sergio Rajsbaum
, Michel Raynal, Julien Stainer:
From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683: 1-21 (2017) - [j71]Dimitra Papagiannopoulou, Andrea Marongiu, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
:
Edge-TM: Exploiting Transactional Memory for Error Tolerance and Energy Efficiency. ACM Trans. Embed. Comput. Syst. 16(5s): 153:1-153:18 (2017) - [c159]Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald:
The Teleportation Design Pattern for Hardware Transactional Memory. OPODIS 2017: 10:1-10:16 - [c158]Maurice Herlihy:
Blockchains and the Future of Distributed Computing. PODC 2017: 155 - [c157]Thomas D. Dickerson, Paul Gazzillo
, Maurice Herlihy, Eric Koskinen:
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures. PODC 2017: 251-253 - [c156]Thomas D. Dickerson
, Paul Gazzillo
, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. PODC 2017: 303-312 - [c155]Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald:
POSTER: State Teleportation via Hardware Transactional Memory. PPoPP 2017: 437-438 - [c154]Costas Busch, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. SPAA 2017: 173-182 - [c153]Zhiyu Liu, Irina Calciu, Maurice Herlihy, Onur Mutlu:
Concurrent Data Structures for Near-Memory Computing. SPAA 2017: 235-245 - [c152]Hammurabi Mendes, Maurice Herlihy:
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. DISC 2017: 35:1-35:16 - [c151]Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank:
Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. DISC 2017: 50:1-50:4 - [i14]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. CoRR abs/1702.04467 (2017) - [i13]Thomas D. Dickerson, Paul Gazzillo, Eric Koskinen, Maurice Herlihy:
Proust: A Design Space for Highly-Concurrent Transactional Data Structures. CoRR abs/1702.04866 (2017) - [i12]Vikram Saraph, Maurice Herlihy, Eli Gafni:
An Algorithmic Approach to the Asynchronous Computability Theorem. CoRR abs/1703.08525 (2017) - [i11]Annette Bieniusa, Hans-Juergen Boehm, Maurice Herlihy, Erez Petrank:
New Challenges in Parallelism (Dagstuhl Seminar 17451). Dagstuhl Reports 7(11): 1-27 (2017) - 2016
- [j70]Maurice Herlihy, Zhiyu Liu:
Well-Structured Futures and Cache Locality. ACM Trans. Parallel Comput. 2(4): 22:1-22:20 (2016) - [c150]Thomas Carle
, Dimitra Papagiannopoulou, Tali Moreshet, Andrea Marongiu, Maurice Herlihy, R. Iris Bahar
:
Thrifty-malloc: A HW/SW codesign for the dynamic management of hardware transactional memory in embedded multicore systems. CASES 2016: 20:1-20:10 - [c149]Dave Dice, Maurice Herlihy, Alex Kogan:
Fast non-intrusive memory reclamation for highly-concurrent data structures. ISMM 2016: 36-45 - [c148]Maurice Herlihy, Mark Moir:
Blockchains and the Logic of Accountability: Keynote Address. LICS 2016: 27-30 - [c147]Oana Balmau, Rachid Guerraoui
, Maurice Herlihy, Igor Zablotchi:
Fast and Robust Memory Reclamation for Concurrent Data Structures. SPAA 2016: 349-359 - [c146]Vikram Saraph, Maurice Herlihy, Eli Gafni:
Asynchronous Computability Theorems for t-Resilient Systems. DISC 2016: 428-441 - [r9]Maurice Herlihy:
Asynchronous Consensus Impossibility. Encyclopedia of Algorithms 2016: 152-155 - [r8]Maurice Herlihy:
Linearizability. Encyclopedia of Algorithms 2016: 1111-1114 - [r7]Maurice Herlihy:
Renaming. Encyclopedia of Algorithms 2016: 1820-1823 - [r6]Maurice Herlihy:
Topology Approach in Distributed Computing. Encyclopedia of Algorithms 2016: 2239-2242 - [i10]Maurice Herlihy, Mark Moir:
Enhancing Accountability and Trust in Distributed Ledgers. CoRR abs/1606.07490 (2016) - 2015
- [j69]Hammurabi Mendes, Maurice Herlihy, Nitin H. Vaidya, Vijay K. Garg:
Multidimensional agreement in Byzantine systems. Distributed Comput. 28(6): 423-441 (2015) - [j68]Dimitra Papagiannopoulou, Giuseppe Capodanno, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
:
Energy-Efficient and High-Performance Lock Speculation Hardware for Embedded Multicore Systems. ACM Trans. Embed. Comput. Syst. 14(3): 51:1-51:27 (2015) - [j67]Maurice Herlihy:
Guest Editor Introduction. ACM Trans. Parallel Comput. 2(1): 1:1 (2015) - [c145]Shahar Timnat, Maurice Herlihy, Erez Petrank:
A Practical Transactional Memory Interface. Euro-Par 2015: 387-401 - [c144]Dimitra Papagiannopoulou, Andrea Marongiu, Tali Moreshet, Luca Benini
, Maurice Herlihy, R. Iris Bahar
:
Playing with Fire: Transactional Memory Revisited for Error-Resilient and Energy-Efficient MPSoC Execution. ACM Great Lakes Symposium on VLSI 2015: 9-14 - [c143]Vikram Saraph, Maurice Herlihy:
The Relative Power of Composite Loop Agreement Tasks. OPODIS 2015: 13:1-13:16 - [c142]Costas Busch, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma:
Impossibility Results for Distributed Transactional Memory. PODC 2015: 207-215 - [e7]Laurent Réveillère, Tim Harris, Maurice Herlihy:
Proceedings of the Tenth European Conference on Computer Systems, EuroSys 2015, Bordeaux, France, April 21-24, 2015. ACM 2015, ISBN 978-1-4503-3238-5 [contents] - [i9]Hammurabi Mendes, Maurice Herlihy:
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. CoRR abs/1505.04224 (2015) - [i8]Maurice Herlihy, Vikram Saraph:
The Relative Power of Composite Loop Agreement Tasks. CoRR abs/1506.03506 (2015) - 2014
- [j66]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. Algorithmica 70(2): 171-194 (2014) - [j65]Maurice Herlihy:
The Future of Synchronization on Multicores: The multicore transformation (Ubiquity symposium). Ubiquity 2014(September): 1:1-1:9 (2014) - [c141]James A. Jablin, Thomas B. Jablin, Onur Mutlu, Maurice Herlihy:
Warp-aware trace scheduling for GPUs. PACT 2014: 163-174 - [c140]Irina Calciu, Justin Gottschlich, Tatiana Shpeisman, Gilles Pokam, Maurice Herlihy:
Invyswell: a hybrid transactional memory for haswell's restricted transactional memory. PACT 2014: 187-200 - [c139]Maurice Herlihy, Eric Koskinen:
Composable Transactional Objects: A Position Paper. ESOP 2014: 1-7 - [c138]Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit:
StackTrack: an automated transactional approach to concurrent memory reclamation. EuroSys 2014: 25:1-25:14 - [c137]Eli Gafni, Maurice Herlihy:
Sporadic Solutions to Zero-One Exclusion Tasks. ICALP (1) 2014: 1-10 - [c136]Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Computing in the Presence of Concurrent Solo Executions. LATIN 2014: 214-225 - [c135]Alex Kogan, Maurice Herlihy:
The future(s) of shared data structures. PODC 2014: 30-39 - [c134]Maurice Herlihy, Zhiyu Liu:
Well-structured futures and cache locality. PPoPP 2014: 155-166 - [c133]Dimitra Papagiannopoulou, Tali Moreshet, Andrea Marongiu, Luca Benini
, Maurice Herlihy, R. Iris Bahar
:
Speculative synchronization for coherence-free embedded NUMA architectures. ICSAMOS 2014: 99-106 - [c132]Maurice Herlihy:
Fun with hardware transactional memory. SIGMOD Conference 2014: 575 - [c131]Hammurabi Mendes, Christine Tasson
, Maurice Herlihy:
Distributed computability in Byzantine asynchronous systems. STOC 2014: 704-713 - [c130]Zhiyu Liu, Maurice Herlihy:
Approximate Local Sums and Their Applications in Radio Networks. DISC 2014: 243-257 - [c129]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. DISC 2014: 406-420 - [c128]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Scheduling Multiple Objects in Distributed Transactional Memory. DISC 2014: 538-539 - [c127]Shahar Timnat, Maurice Herlihy, Erez Petrank:
A Practical Transactional Memory Interface. DISC 2014: 542-543 - [i7]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. CoRR abs/1408.1021 (2014) - 2013
- [b2]Maurice Herlihy, Dmitry N. Kozlov, Sergio Rajsbaum:
Distributed Computing Through Combinatorial Topology. Morgan Kaufmann 2013, ISBN 978-0-12-404578-1 - [j64]Maurice Herlihy, Sergio Rajsbaum:
The topology of distributed adversaries. Distributed Comput. 26(3): 173-192 (2013) - [j63]Maurice Herlihy, Sergio Rajsbaum, Michel Raynal:
Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509: 3-24 (2013) - [c126]Irina Calciu, Justin Emile Gottschlich, Maurice Herlihy:
Using Elimination and Delegation to Implement a Scalable NUMA-Friendly Stack. HotPar 2013 - [c125]Dimitra Papagiannopoulou, R. Iris Bahar, Tali Moreshet, Maurice Herlihy, Andrea Marongiu, Luca Benini
:
Transparent and energy-efficient speculation on NUMA architectures for embedded MPSoCs. MES 2013: 58-61 - [c124]Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir:
Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores. OPODIS 2013: 83-97 - [c123]Hagit Attiya
, Armando Castañeda, Maurice Herlihy, Ami Paz
:
Upper bound on the complexity of solving hard renaming. PODC 2013: 190-199 - [c122]Hammurabi Mendes, Maurice Herlihy:
Multidimensional approximate agreement in Byzantine asynchronous systems. STOC 2013: 391-400 - [i6]Hammurabi Mendes, Christine Tasson, Maurice Herlihy:
The Topology of Asynchronous Byzantine Colorless Tasks. CoRR abs/1302.6224 (2013) - [i5]Maurice Herlihy, Zhiyu Liu:
Well-Structured Futures and Cache Locality. CoRR abs/1309.5301 (2013) - 2012
- [j62]Maurice Herlihy, Sergio Rajsbaum, Michel Raynal:
Computability in distributed computing: a Tutorial. SIGACT News 43(3): 88-110 (2012) - [j61]Maurice Herlihy, Nir Shavit:
Transactional memory: beyond the first two decades. SIGACT News 43(4): 101-103 (2012) - [c121]Justin Emile Gottschlich, Maurice Herlihy, Gilles Pokam, Jeremy G. Siek
:
Visualizing transactional memory. PACT 2012: 159-170 - [c120]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. LATIN 2012: 133-144 - [c119]Maurice Herlihy, Sergio Rajsbaum:
Simulations and reductions for colorless tasks. PODC 2012: 253-260 - [e6]Guy E. Blelloch, Maurice Herlihy:
24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. ACM 2012, ISBN 978-1-4503-1213-4 [contents] - [i4]Lisbeth Fajstrup, Dmitry Feichtner-Kozlov, Maurice Herlihy:
Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121). Dagstuhl Reports 2(3): 50-66 (2012) - 2011
- [c118]Cesare Ferri, Andrea Marongiu, Benjamin Lipton, R. Iris Bahar
, Tali Moreshet, Luca Benini
, Maurice Herlihy:
SoC-TM: integrated HW/SW support for transactional memory programming on embedded MPSoCs. CODES+ISSS 2011: 39-48 - [c117]James A. Jablin, Patrick McCormick, Maurice Herlihy:
Scout: High-Performance Heterogeneous Computing Made Simple. IPDPS Workshops 2011: 2093-2096 - [c116]Maurice Herlihy, Nir Shavit:
On the Nature of Progress. OPODIS 2011: 313-328 - [c115]Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir:
On the power of hardware transactional memory to simplify memory management. PODC 2011: 99-108 - [c114]Maurice Herlihy, Yoram Moses, Mark R. Tuttle:
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. PODC 2011: 231-238 - [r5]Maurice Herlihy:
Transactional Memories. Encyclopedia of Parallel Computing 2011: 2079-2086 - [i3]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming (Preliminary Version). CoRR abs/1102.4946 (2011) - 2010
- [j60]John M. Mellor-Crummey, William Gropp, Maurice Herlihy:
Teaching parallel programming: a roundtable discussion. XRDS 17(1): 28-30 (2010) - [j59]Flavio Paiva Junqueira, Keith Marzullo, Maurice Herlihy, Lucia Draque Penso:
Threshold protocols in survivor set systems. Distributed Comput. 23(2): 135-149 (2010) - [j58]Cesare Ferri, Samantha Wood, Tali Moreshet, R. Iris Bahar
, Maurice Herlihy:
Embedded-TM: Energy and complexity-effective hardware transactional memory for embedded multicore systems. J. Parallel Distributed Comput. 70(10): 1042-1052 (2010) - [c113]Maurice Herlihy:
Applications of Shellable Complexes to Distributed Computing - (Invited Talk). CONCUR 2010: 19-20 - [c112]Cesare Ferri, Samantha Wood, Tali Moreshet, R. Iris Bahar
, Maurice Herlihy:
Energy and Throughput Efficient Transactional Memory for Embedded Multicore Systems. HiPEAC 2010: 50-65 - [c111]Maurice Herlihy:
Transactional Memory Today. ICDCIT 2010: 1-12 - [c110]Maurice Herlihy, Sergio Rajsbaum
:
The topology of shared-memory adversaries. PODC 2010: 105-113 - [c109]Eric Koskinen, Matthew J. Parkinson, Maurice Herlihy:
Coarse-grained transactions. POPL 2010: 19-30 - [c108]Maurice Herlihy, Sergio Rajsbaum:
Concurrent Computing and Shellable Complexes. DISC 2010: 109-123
2000 – 2009
- 2009
- [j57]Maurice Herlihy:
Technical perspective - Highly concurrent data structures. Commun. ACM 52(5): 99 (2009) - [j56]Rachid Guerraoui
, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. Distributed Comput. 21(5): 353-366 (2009) - [j55]Maurice Herlihy:
Transactional Memory: A Primer for Theorists. Bull. EATCS 98: 123-138 (2009) - [j54]Rachid Guerraoui
, Maurice Herlihy, Bastian Pochon:
A topological treatment of early-deciding set-agreement. Theor. Comput. Sci. 410(6-7): 570-580 (2009) - [c107]Maurice Herlihy, Yossi Lev:
tm_db: A Generic Debugging Library for Transactional Programs. PACT 2009: 136-145 - [c106]Maurice Herlihy:
Distributed Computing and the Multicore Revolution. ICDCN 2009: 8 - [c105]Maurice Herlihy:
Transactional Memory Today: A Status Report. OPODIS 2009: 1 - [c104]Rida A. Bazzi, Maurice Herlihy:
Enhanced Fault-Tolerance through Byzantine Failure Detection. OPODIS 2009: 129-143 - [c103]Eric Koskinen, Maurice Herlihy:
Brief announcement: concurrent non-commutative boosted transactions. PODC 2009: 272-273 - [c102]Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Emmett Witchel:
Committing conflicting transactions in an STM. PPoPP 2009: 163-172 - 2008
- [b1]Maurice Herlihy, Nir Shavit:
The art of multiprocessor programming. Morgan Kaufmann 2008, ISBN 978-0-12-370591-4, pp. I-XX, 1-508 - [j53]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. Commun. ACM 51(8): 91-100 (2008) - [j52]Maurice Herlihy, Victor Luchangco:
Distributed computing and the multicore revolution. SIGACT News 39(1): 62-72 (2008) - [c101]Cesare Ferri, Amber Viescas, Tali Moreshet, R. Iris Bahar
, Maurice Herlihy:
Energy efficient synchronization techniques for embedded architectures. ACM Great Lakes Symposium on VLSI 2008: 435-440 - [c100]Maurice Herlihy:
The future of distributed computing: renaissance or reformation? PODC 2008: 464 - [c99]Maurice Herlihy, Eric Koskinen:
Transactional boosting: a methodology for highly-concurrent transactional objects. PPoPP 2008: 207-216 - [c98]Eric Koskinen, Maurice Herlihy:
Checkpoints and continuations instead of nested transactions. SPAA 2008: 160-168 - [c97]Eric Koskinen, Maurice Herlihy:
Dreadlocks: efficient deadlock detection. SPAA 2008: 297-303 - [c96]Maurice Herlihy, Flavio Paiva Junqueira, Keith Marzullo, Lucia Draque Penso:
Optimizing Threshold Protocols in Adversarial Structures. DISC 2008: 335-349 - [c95]Maurice Herlihy, Nir Shavit, Moran Tzafrir:
Hopscotch Hashing. DISC 2008: 350-364 - [e5]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
Transactional Memory: From Implementation to Application, 08.06. - 13.06.2008. Dagstuhl Seminar Proceedings 08241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r4]Maurice Herlihy:
Asynchronous Consensus Impossibility. Encyclopedia of Algorithms 2008 - [r3]Maurice Herlihy:
Linearizability. Encyclopedia of Algorithms 2008 - [r2]Maurice Herlihy:
Renaming. Encyclopedia of Algorithms 2008 - [r1]Maurice Herlihy:
Topology Approach in Distributed Computing. Encyclopedia of Algorithms 2008 - [i2]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
08241 Abstracts Collection - Transactional Memory : From Implementation to Application. Transactional Memory: From Implementation to Application 2008 - [i1]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
08241 Summary - Transactional Memory : From Implementation to Application. Transactional Memory: From Implementation to Application 2008 - 2007
- [j51]Maurice Herlihy, Ye Sun:
Distributed transactional memory for metric-space networks. Distributed Comput. 20(3): 195-208 (2007) - [j50]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. Parallel Process. Lett. 17(4): 411-424 (2007) - [j49]Cesare Ferri, Tali Moreshet, R. Iris Bahar
, Luca Benini, Maurice Herlihy:
A hardware/software framework for supporting transactional memory in a MPSoC environment. SIGARCH Comput. Archit. News 35(1): 47-54 (2007) - [c94]Maurice Herlihy:
The Multicore Revolution. FSTTCS 2007: 1-8 - [c93]Guy Eddon, Maurice Herlihy:
Language Support and Compiler Optimizations for STM and Transactional Boosting. ICDCIT 2007: 209-224 - [c92]Maurice Herlihy:
Taking Concurrency Seriously: the Multicore Challenge. IISWC 2007: 2 - [c91]Rachid Guerraoui
, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. PODC 2007: 235-243 - [c90]Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael L. Scott:
Potential show-stoppers for transactional synchronization. PPoPP 2007: 55 - [c89]Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit:
A Simple Optimistic Skiplist Algorithm. SIROCCO 2007: 124-138 - 2006
- [j48]Maurice Herlihy, Srikanta Tirthapura
:
Self-stabilizing smoothing and balancing networks. Distributed Comput. 18(5): 345-357 (2006) - [j47]Maurice Herlihy, Srikanta Tirthapura
:
Randomized smoothing networks. J. Parallel Distributed Comput. 66(5): 626-632 (2006) - [j46]Ori Dvir, Maurice Herlihy, Nir Shavit:
Virtual Leashing: Creating a computational foundation for software protection. J. Parallel Distributed Comput. 66(9): 1233-1240 (2006) - [j45]Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura
, Roger Wattenhofer:
Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput. Syst. 39(6): 875-901 (2006) - [j44]Srikanta Tirthapura
, Maurice Herlihy:
Self-Stabilizing Distributed Queuing. IEEE Trans. Parallel Distributed Syst. 17(7): 646-655 (2006) - [c88]Maurice Herlihy, Victor Luchangco, Mark Moir:
A flexible framework for implementing software transactional memory. OOPSLA 2006: 253-262 - [c87]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
A Topological Treatment of Early-Deciding Set-Agreement. OPODIS 2006: 20-35 - [c86]Maurice Herlihy:
The art of multiprocessor programming. PODC 2006: 1-2 - [c85]Rachid Guerraoui
, Maurice Herlihy, Bastian Pochon:
Towards a theory of transactional contention managers. PODC 2006: 316-317 - [c84]Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro
:
Proving correctness of highly-concurrent linearisable objects. PPoPP 2006: 129-136 - [c83]Tali Moreshet, R. Iris Bahar, Maurice Herlihy:
Energy implications of multiprocessor synchronization. SPAA 2006: 329 - [c82]Eli Gafni, Sergio Rajsbaum, Maurice Herlihy:
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. DISC 2006: 329-338 - 2005
- [j43]Maurice Herlihy, Lucia Draque Penso:
Tight bounds for k-set agreement with limited-scope failure detectors. Distributed Comput. 18(2): 157-166 (2005) - [j42]Christopher Cole, Maurice Herlihy:
Snapshots and software transactional memory. Sci. Comput. Program. 58(3): 310-324 (2005) - [j41]Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir:
Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23(2): 146-196 (2005) - [c81]Ori Dvir, Maurice Herlihy, Nir Shavit:
Virtual Leashing: Internet-Based Software Piracy Protection. ICDCS 2005: 283-292 - [c80]Ravi Rajwar, Maurice Herlihy, Konrad K. Lai:
Virtualizing Transactional Memory. ISCA 2005: 494-505 - [c79]Tali Moreshet, R. Iris Bahar
, Maurice Herlihy:
Energy reduction in multiprocessor systems using transactional memory. ISLPED 2005: 331-334 - [c78]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. OPODIS 2005: 3-16 - [c77]Felix C. Freiling, Maurice Herlihy, Lucia Draque Penso:
Optimal Randomized Fair Exchange with Secret Shared Coins. OPODIS 2005: 61-72 - [c76]Maurice Herlihy:
The transactional manifesto: software engineering and non-blocking synchronization. PLDI 2005: 280 - [c75]Rachid Guerraoui
, Maurice Herlihy, Bastian Pochon:
Toward a theory of transactional contention managers. PODC 2005: 258-264 - [c74]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. PPoPP 2005: 48-60 - [c73]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Polymorphic Contention Management. DISC 2005: 303-323 - [c72]Maurice Herlihy, Ye Sun:
Distributed Transactional Memory for Metric-Space Networks. DISC 2005: 324-338 - 2004
- [j40]Panagiota Fatourou, Maurice Herlihy:
Read-modify-write networks. Distributed Comput. 17(1): 33-46 (2004) - [c71]Maurice Herlihy, Srikanta Tirthapura:
Randomized Smoothing Networks. IPDPS 2004 - [c70]Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir:
Bringing practical lock-free synchronization to 64-bit applications. PODC 2004: 31-39 - [c69]Maurice Herlihy, Sergio Rajsbaum
, Mark R. Tuttle:
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems. GETCO@DISC 2004: 79-102 - 2003
- [j39]Maurice Herlihy, Sergio Rajsbaum
:
A classification of wait-free loop agreement tasks. Theor. Comput. Sci. 291(1): 55-77 (2003) - [c68]Maurice Herlihy, Srikanta Tirthapura:
Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura. ICDCS 2003: 4-11 - [c67]Maurice Herlihy, Victor Luchangco, Mark Moir:
Obstruction-Free Synchronization: Double-Ended Queues as an Example. ICDCS 2003: 522-529 - [c66]Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III:
Software transactional memory for dynamic-sized data structures. PODC 2003: 92-101 - [c65]Maurice Herlihy, Lucia Draque Penso:
tight bounds for k-set agreement with limited-scope failure detectors. PODC 2003: 221 - [c64]Maurice Herlihy, Lucia Draque Penso:
Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors. DISC 2003: 279-291 - [c63]Maurice Herlihy, Victor Luchangco, Mark Moir:
Space and Time Adaptive Non-blocking Algorithms. CATS 2003: 260-280 - [e4]Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, GETCO 2002, Satellite workshop of DISC 2002, Toulouse, France, October 2002. Electronic Notes in Theoretical Computer Science 81, Elsevier 2003 [contents] - 2002
- [j38]Costas Busch, Maurice Herlihy:
Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002) - [j37]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
:
Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002) - [c62]Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir:
Dynamic-sized lock-free data structures. PODC 2002: 131 - [c61]Maurice Herlihy, Victor Luchangco, Mark Moir:
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC 2002: 339-353 - [e3]Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Jeremy Gunawardena, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
3rd Workshop on GEometry and Topology in COncurrency theory, GETCO 2001, Satellite Event of CONCUR 2001, Aalborg, Denmark, August 25, 2001. Electronic Notes in Theoretical Computer Science 52(2), Elsevier 2002 [contents] - 2001
- [j36]Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer:
Ordered Multicast and Distributed Swap. ACM SIGOPS Oper. Syst. Rev. 35(1): 85-96 (2001) - [c60]Maurice Herlihy:
On beyond registers: wait-free readable objects. PODC 2001: 26-42 - [c59]Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer:
Competitive concurrent distributed queuing. PODC 2001: 127-133 - [c58]Panagiota Fatourou, Maurice Herlihy:
Adding networks. PODC 2001: 308-310 - [c57]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Routing without flow control. SPAA 2001: 11-20 - [c56]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
A New Synchronous Lower Bound for Set Agreement. DISC 2001: 136-150 - [c55]Maurice Herlihy, Srikanta Tirthapura:
Self Stabilizing Distributed Queuing. DISC 2001: 209-223 - [c54]Panagiota Fatourou, Maurice Herlihy:
Adding Networks. DISC 2001: 330-342 - 2000
- [j35]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j34]Maurice Herlihy, Michael P. Warres:
A tale of two directories: implementing distributed shared objects in Java. Concurr. Pract. Exp. 12(7): 555-572 (2000) - [j33]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
A Combinatorial Characterization of Properties Preserved by Antitokens. Bull. EATCS 71: 114-132 (2000) - [j32]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
Tight bounds for k-set agreement. J. ACM 47(5): 912-943 (2000) - [j31]Maurice Herlihy, Sergio Rajsbaum:
Algebraic spans. Math. Struct. Comput. Sci. 10(4): 549-573 (2000) - [j30]Maurice Herlihy:
Review of Distributed Computing by Attiya and Welch. SIGACT News 31(1): 3 (2000) - [c53]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
:
A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582 - [c52]Maurice Herlihy, Eric Ruppert:
On the Existence of Booster Types. FOCS 2000: 653-663 - [c51]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Randomized greedy hot-potato routing. SODA 2000: 458-466 - [c50]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Hard-Potato routing. STOC 2000: 278-285 - [c49]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
An Overview of Synchronous Message-Passing and Topology. GETCO 2000: 1-17 - [e2]Patrick Cousot, Eric Goubault, Jeremy Gunawardena, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
2nd Workshop on Geometry and Topology in Concurrency theory, GETCO 2000, Satellite Workshop of CONCUR 2000, State College, PA, USA, August 21, 2000. Electronic Notes in Theoretical Computer Science 39(2), Elsevier 2000 [contents] - [e1]Maurice Herlihy:
Distributed Computing, 14th International Conference, DISC 2000, Toledo, Spain, October 4-6, 2000, Proceedings. Lecture Notes in Computer Science 1914, Springer 2000, ISBN 3-540-41143-7 [contents]
1990 – 1999
- 1999
- [j29]Maurice Herlihy, Nir Shavit:
The topological structure of asynchronous computability. J. ACM 46(6): 858-923 (1999) - [j28]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. SIAM J. Comput. 28(5): 1848-1874 (1999) - [j27]Soma Chaudhuri, Maurice Herlihy, Mark R. Tuttle:
Wait-Free Implementations in Message-Passing Systems. Theor. Comput. Sci. 220(1): 211-245 (1999) - [c48]Maurice Herlihy:
The Aleph Toolkit: Support for Scalable Distributed Shared Objects. CANPC 1999: 137-149 - [c47]Maurice Herlihy, Michael P. Warres:
A Tale of Two Directories: Implementing Distributed Shared Objects in Java. Java Grande 1999: 99-108 - [c46]Maurice Herlihy, Sergio Rajsbaum:
New Perspectives in Distributed Computing. MFCS 1999: 170-186 - [c45]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61 - [c44]Costas Busch, Maurice Herlihy:
Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73 - [c43]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas
, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - 1998
- [j26]Faith E. Fich, Maurice Herlihy, Nir Shavit:
On the Space Complexity of Randomized Synchronization. J. ACM 45(5): 843-862 (1998) - [c42]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
Unifying Synchronous and Asynchronous Message-Passing Models. PODC 1998: 133-142 - [c41]Michael J. Demmer, Maurice Herlihy:
The Arrow Distributed Directory Protocol. DISC 1998: 119-133 - [c40]Maurice Herlihy, Sergio Rajsbaum:
A Wait-Free Classification of Loop Agreement Tasks. DISC 1998: 175-185 - [c39]Costas Busch, Maurice Herlihy:
A Survey on Counting Networks. WDAS 1998: 13-20 - 1997
- [j25]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. J. ACM 44(6): 779-805 (1997) - [c38]Maurice Herlihy, Sergio Rajsbaum:
The Decidability of Distributed Decision Tasks (Extended Abstract). STOC 1997: 589-598 - 1996
- [j24]Maurice Herlihy, Nir Shavit, Orli Waarts:
Linearizable Counting Networks. Distributed Comput. 9(4): 193-203 (1996) - [c37]Maurice Herlihy, Sergio Rajsbaum:
On the Decidability of Distributed Decision Tasks (Brief Announcement). PODC 1996: 279 - [p3]Maurice Herlihy, Nir Shavit:
Applications of Algebraic Topology to Concurrent Computation. Applications on Advanced Architecture Computers 1996: 255-263 - 1995
- [j23]Hagit Attiya
, Maurice Herlihy, Ophir Rachman:
Atomic Snapshots Using Lattice Agreement. Distributed Comput. 8(3): 121-132 (1995) - [j22]Maurice Herlihy, Beng-Hong Lim, Nir Shavit:
Scalable Concurrent Counting. ACM Trans. Comput. Syst. 13(4): 343-364 (1995) - [c36]Maurice Herlihy, Sergio Rajsbaum:
Algebraic Spans (Preliminary Version). PODC 1995: 90-99 - [p2]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for Processor Coordination. Responsive Computer Systems 1995: 1-18 - [p1]Maurice Herlihy, Sergio Rajsbaum:
Algebraic Topology and Distributed Computing: A Primer. Computer Science Today 1995: 203-217 - 1994
- [j21]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks. J. ACM 41(5): 1020-1048 (1994) - [c35]Maurice Herlihy, Sergio Rajsbaum:
Set Consensus Using Arbitrary Objects (Preliminary Version). PODC 1994: 324-333 - [c34]Maurice Herlihy, Nir Shavit:
A simple constructive computability theorem for wait-free computation. STOC 1994: 243-252 - 1993
- [j20]Maurice Herlihy:
A Methodology for Implementing Highly Concurrent Objects. ACM Trans. Program. Lang. Syst. 15(5): 745-770 (1993) - [c33]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for k-Set Agreement. FOCS 1993: 206-215 - [c32]Maurice Herlihy, J. Eliot B. Moss:
Transactional Memory: Architectural Support for Lock-Free Data Structures. ISCA 1993: 289-300 - [c31]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Bounded Round Numbers. PODC 1993: 53-64 - [c30]Faith E. Fich, Maurice Herlihy, Nir Shavit:
On the Space Complexity of Randomized Synchronization. PODC 1993: 241-249 - [c29]Maurice Herlihy, Nir Shavit:
The asynchronous computability theorem for t-resilient tasks. STOC 1993: 111-120 - [c28]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. STOC 1993: 174-183 - 1992
- [j19]Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl:
On the Correctness of Orphan Management Algorithms. J. ACM 39(4): 881-930 (1992) - [j18]Maurice Herlihy:
A Methodology for Implementing Highly Concurrent Data Objects (Abstract). ACM SIGOPS Oper. Syst. Rev. 26(2): 12 (1992) - [j17]Maurice Herlihy, J. Eliot B. Moss:
Lock-Free Garbage Collection for Multiprocessors. IEEE Trans. Parallel Distributed Syst. 3(3): 304-311 (1992) - [c27]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. ISTCS 1992: 154-170 - [c26]Maurice Herlihy, Beng-Hong Lim, Nir Shavit:
Low Contention Load Balancing on Large-Scale Multiprocessors. SPAA 1992: 219-227 - [c25]Hagit Attiya, Maurice Herlihy, Ophir Rachman:
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). WDAG 1992: 35-53 - 1991
- [j16]Maurice Herlihy, William E. Weihl:
Hybrid Concurrency Control for Abstract Data Types. J. Comput. Syst. Sci. 43(1): 25-61 (1991) - [j15]Maurice Herlihy:
Wait-Free Synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124-149 (1991) - [j14]Maurice Herlihy, Jeannette M. Wing:
Specifying Graceful Degradation. IEEE Trans. Parallel Distributed Syst. 2(1): 93-104 (1991) - [c24]Maurice Herlihy, Nir Shavit, Orli Waarts:
Low Contention Linearizable Counting. FOCS 1991: 526-535 - [c23]Maurice Herlihy:
Randomized Wait-Free Concurrent Objects (Extended Abstract). PODC 1991: 11-21 - [c22]Maurice Herlihy, J. Eliot B. Moss:
Lock-Free garbage Collection for Multiprocessors. SPAA 1991: 229-236 - [c21]Maurice Herlihy:
Impossibility Results for Asynchronous PRAM (Extended Abstract). SPAA 1991: 327-336 - [c20]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks and Multi-Processor Coordination. STOC 1991: 348-358 - 1990
- [j13]Maurice Herlihy:
Concurrency and Availability as Dual Properties of Replicated Atomic Data. J. ACM 37(2): 257-278 (1990) - [j12]James Aspnes, Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory. J. Algorithms 11(3): 441-461 (1990) - [j11]Maurice Herlihy:
Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. ACM Trans. Database Syst. 15(1): 96-124 (1990) - [j10]Maurice Herlihy, Jeannette M. Wing:
Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. Program. Lang. Syst. 12(3): 463-492 (1990) - [c19]Maurice Herlihy, Mark R. Tuttle:
Lower Bounds for Wait-Free Computation in Message-Passing Systems. PODC 1990: 347-362 - [c18]Maurice Herlihy:
A Methodology for Implementing Highly Concurrent Data Structures. PPoPP 1990: 197-206 - [c17]James Aspnes, Maurice Herlihy:
Wait-Free Data Structures in the Asynchronous PRAM Model. SPAA 1990: 340-349 - [c16]Maurice Herlihy:
Position Statement: Type Specific Replication for Multiprocessors. Workshop on the Management of Replicated Data 1990: 70-74
1980 – 1989
- 1989
- [j9]Maurice Herlihy, Martin S. McKendry:
Timestamp-Based Orphan Elimination. IEEE Trans. Software Eng. 15(7): 825-831 (1989) - [c15]Maurice Herlihy, Jeannette M. Wing:
Specifying Security Constraints with Relaxation Lattices. CSFW 1989: 47-53 - 1988
- [j8]David Detlefs, Maurice Herlihy, Jeannette M. Wing:
Inheritance of Synchronization and Recovery Properties in Avalon/C++. Computer 21(12): 57-69 (1988) - [c14]Maurice Herlihy, Jeannette M. Wing:
Reasoning about Atomic Objects. FTRTFT 1988: 193-208 - [c13]Maurice Herlihy:
Impossibility and Universality Results for Wait-Free Synchronization. PODC 1988: 276-290 - [c12]Maurice Herlihy, William E. Weihl:
Hybrid Concurrency Control for Abstract Data Types. PODS 1988: 201-210 - [c11]Maurice Herlihy:
Taking concurrency seriously (position paper). OOPSLA/ECOOP Workshop on Object-based Concurrent Programming 1988: 32-33 - [c10]Maurice Herlihy, Jeannette M. Wing:
Linearizable concurrent objects. OOPSLA/ECOOP Workshop on Object-based Concurrent Programming 1988: 133-135 - 1987
- [j7]Maurice Herlihy:
Optimistic Concurrency Control for Abstract Data Types. ACM SIGOPS Oper. Syst. Rev. 21(2): 33-44 (1987) - [j6]Maurice Herlihy:
Extending Multiversion Time-Stamping Protocols to Exploit Type Information. IEEE Trans. Computers 36(4): 443-448 (1987) - [j5]Maurice Herlihy:
Concurrency versus Availability: Atomic Mechanisms for Replicated Data. ACM Trans. Comput. Syst. 5(3): 249-274 (1987) - [j4]Maurice Herlihy:
Dynamic Quorum Adjustment for Partitioned Data. ACM Trans. Database Syst. 12(2): 170-194 (1987) - [c9]David Detlefs, Maurice Herlihy, K. Kietzke, Jeannette M. Wing:
Avalon/C++. C++ Workshop 1987: 451-459 - [c8]Maurice Herlihy, J. D. Tygar:
How to Make Replicated Data Secure. CRYPTO 1987: 379-391 - [c7]Maurice Herlihy, Jeannette M. Wing:
Specifying Graceful Degradation in Distributed Systems. PODC 1987: 167-177 - [c6]Maurice Herlihy, Jeannette M. Wing:
Axioms for Concurrent Objects. POPL 1987: 13-26 - 1986
- [j3]Maurice Herlihy:
Comparing How Atomicity Mechanisms Support Replication. ACM SIGOPS Oper. Syst. Rev. 20(3): 31-39 (1986) - [j2]Maurice Herlihy:
A Quorum-Consensus Replication Method for Abstract Data Types. ACM Trans. Comput. Syst. 4(1): 32-53 (1986) - [c5]Maurice Herlihy:
Optimistic Concurrency Control for Abstract Data Types. PODC 1986: 206-217 - [c4]Barbara Liskov, Maurice Herlihy, Lucy Gilbert:
Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing. POPL 1986: 150-159 - [c3]Martin S. McKendry, Maurice Herlihy:
Time-Driven Orphan Elimination. Symposium on Reliability in Distributed Software and Database Systems 1986: 42-48 - 1985
- [c2]Maurice Herlihy:
Comparing How Atomicity Mechanisms Support Replication. PODC 1985: 102-110 - 1983
- [c1]Barbara Liskov, Maurice Herlihy:
Issues Process and Communication Structure for Distributed Programs. Symposium on Reliability in Distributed Software and Database Systems 1983: 123-132 - 1982
- [j1]Maurice Herlihy, Barbara Liskov:
A Value Transmission Method for Abstract Data Types. ACM Trans. Program. Lang. Syst. 4(4): 527-551 (1982)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-22 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint