· Maurice Herlihy, Victor Luchangco, Mark Moir: A flexible framework for implementing software transactional memory. OOPSLA 2006: 253-262. BibTeX.
· Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, and Marc Shapiro. Proving correctness of highly-concurrent linearisable objects. Proceedings of the 11th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP). BibTex.
· Rachid Guerraoui, Maurice Herlihy, Sebastian Pochon. A Topological Treatment of Early-Deciding Set-Agreement. 10th International Conference on Principles of Distributed Systems (OPODIS). BibTeX.
· Eli Gafni, Sergio Rajsbaum, and Maurice Herlihy. Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. Lecture Notes in Computer Science, 2006. Pages 329-338. BibTeX.
· Dynamic Analysis of the Arrow Distributed Protocol. Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, and Roger Wattenhofer. Theory of Computing Systems. Volume 39, Number 6, November, 2006. pp 875-901. BibTeX.
· Ori Dvir, Maurice Herlihy, and Nir Shavit. Virtual Leashing: Creating a computational foundation for software protection. Journal of Parallel and Distributed Computing. Volume 66, Issue 9, September 2006, Pages 1233-1240. BibTeX.
· Srikanta Tirthapura and Maurice Herlihy. Self-Stabilizing Distributed Queuing. IEEE Transactions on Parallel and Distributed Systems 17(7): 646-655 (2006). BibTeX.
· Tali Moreshet, R. Iris Bahar, Maurice Herlihy. Energy reduction in multiprocessor systems using transactional memory. International Symposium on Low Power Electronics and Design: 331-334. 2006. BibTeX.
· Tali Moreshet, R. Iris Bahar, and Maurice Herlihy. Energy implications of multiprocessor synchronization. SPAA 2006: 329 (brief announcement). BibTeX.
· A Provably Correct Scalable Skiplist (Brief Announcement) Yossi Lev, Maurice Herlihy, Victor Luchangco, and Nir Shavit. OPODIS 2006. BibTeX.
· Maurice Herlihy and Srikanta Tirthapura, Self-stabilizing smoothing and balancing networks, Distributed Computing, Dec 2005. BibTeX.
·
Felix Freiling
and Maurice Herlihy and Lucia Penso, Optimal
Randomized Omission-Tolerant Uniform Consensus in Message Passing Systems,
9th International Conference on Principles of Distributed Systems, December
12--14, 2005,
· Tali Moreshet, R. Iris Bahar, Maurice Herlihy: Energy reduction in multiprocessor systems using transactional memory. International Symposium on Low Power Electronics and Design: 331-334. BibTeX.
· Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, Bill Scherer, Nir Shavit, A Lazy Concurrent List-based Set Algorithm, 9th International Conference on Principles of Distributed Systems, December 12--14, 2005, Pisa, Italy. BiBTeX.
· Rachid Guerraoui, Maurice Herlihy, Michal Kapalka, and Sebastian Pochon, Robust Contention Management in Software Transactional Memory, OOPSLA 2004 Wrorkshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL), San Diego, California, October 16, 2005. BibTeX.
· Rachid Guerraoui, Maurice Herlihy, and Sebastian Pochon, Polymorphic Contention Management, Proceedings of the 19th International Symposium on Distributed Computing (DISC 2005), Cracow, Poland, September 26-29, 2005. BibTeX.
·
Maurice Herlihy and Ye Sun, Distributed Transactional Memory for Metric-Space
Networks, Proceedings of the 19th
International Symposium on Distributed Computing (DISC 2005), Cracow,
Poland, Septenber 26-29, 2005. BibTeX.
·
Rachid Guerraoui, Maurice
Herlihy, and Sebastian Pochon, Toward
a Theory of Transactional Contention Management, Proceedings of the Twenty-Fourth Annual Symposium on Principles of
Distributed Computing (PODC).
·
M.P. Herlihy, V. Luchangco, P. Martin, and M.
Moir. Nonblocking memory management support for dynamic-sized data structures.
ACM Transactions on Computer Systems
(TOCS) 23(2), May 2005. BibTex.
·
O.
Dvir, M.P. Herlihy, Nir
Shavit. Virtual Leashing: Internet-Based Software Piracy
Protection. 25th International Conference on Distributed Computing
Systems (ICDCS).
·
R. Rajwar, M.P. Herlihy, and K. Lai. Virtualizing
Transactional Memory. The 32nd
Annual International Symposium on Computer Architecture (ISCA).
·
Tim
Harris, Simon Marlowe,
Simon Peyton-Jones,
and Maurice Herlihy. Composable Memory
Transactions. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (PPoPP),
·
C. Cole and M.P. Herlihy. Snapshots and Software Transactional
Memory. Science of Computer
Programming. Volume 58, Issue 3,
·
Maurice
Herlihy and Srikanta Tirthapura,
Randomized Smoothing Networks Journal
of Parallel and Distributed Computing. 2005, to appear. BibTeX.
·
P.
Fatourou and M.P. Herlihy. Read-Modify-Write
Networks. Distributed Computing 17(1), 2004 pp 33-46. BiBTeX.
·
Simon
Doherty, Maurice Herlihy, V.
Luchangco and M. Moir. Bringing practical
lock-free synchronization to 64-bit applications. Twenty-Third Annual Symposium on Principles
of Distributed Computing (PODC).31-39 BiBTeX.
·
Maurice Herlihy and Lucia Draque Penso, Tight Bounds for k-set Agreement with
Limited-Scope Failure Detectors. Proceedings of the Twenty-Second annual Symposium on Principles of Distributed Computing
(PODC).
·
Maurice Herlihy, Victor Luchangco, Mark Moir and William. Scherer. Software Transactional Memory for Dynamic-sized
Data Structures, Proceedings of the Twenty-Second Annual ACM
SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), July
2003. BiBTeX.
·
M.P. Herlihy and S. Tirthapura. Self-Stabilizing
Smoothing and Counting. Proceedings of the 23rd IEEE International
Conference on Distributed Computing Systems (ICDCS),
·
M.P. Herlihy, V. Luchangco, and M. Moir. Obstruction-free
Synchronization: Double-ended Queues as an Example. Proceedings of the
23rd IEEE International Conference on Distributed Computing Systems (ICDCS),
· M.P. Herlihy and Sergio Rajsbaum.. A Classification of Wait-Free Loop Agreement Tasks. Theoretical Computer Science, 291(1): 55-77 (2003). BiBTeX
· M.P. Herlihy, V. Luchangco, and M. Moir. Space and Time Adaptive Non-blocking Algorithms. Electronic Notes in Theoretical Computer Science, BibTeX
·
M.P. Herlihy, V. Luchangco, and M. Moir. The Repeat Offender Problem: A
Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. Proceedings
of 16th International Symposium on Distributed Computing (DISC 2002),
· C. Busch and M.P. Herlihy. Sorting and Counting Networks of Small Depth and Arbitrary Width. Theory of Computing Systems. 2002. (Preliminary version in SPAA'99.) BiBTeX.
· C. Busch, N. Demetriou, M.P. Herlihy and M. Mavronicolas. Threshold Counters with Increments and Decrements. Theoretical Computer Science. January 2002. (Preliminary version in SIROCCO'99.) BiBTeX.
· M.P. Herlihy, S. Tirthapura and R. Wattenhofer Competitive Concurrent Distributed Queuing. Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001). BibTeX.
· M.P. Herlihy. On beyond registers: wait-free readable objects. Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001). Lamport birthday celebration invited paper. Slides. BiBTeX.
·
C.
Busch and M.P. Herlihy and R.
Wattenhofer. Routing without Flow Control.
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and
Architectures. pp. 11-20,
·
M.P. Herlihy and S. Tirthapura. Self Stabilizing Distributed Queueing. Proceedings
of 15th International Symposium on Distributed Computing (DISC 2001).
· M.P. Herlihy and Sergio Rajsbaum and M.R. Tuttle. A New Synchronous Lower Bound for Set Agreement Proceedings of 15th International Symposium on Distributed Computing (DISC 2001), Lisbon, Portugal, October 3-5, 2001. BiBTeX.
·
P.
Fatourou and M.P. Herlihy. Adding
Networks. Proceedings of 15th International Symposium on Distributed
Computing (DISC 2001).
·
M.P. Herlihy, S. Tirthapura and R. Wattenhofer. Ordered Multicast and Distributed Swap. Operating
Systems Review 35(1): 85-96 (2001). Also in the Proceedings of the PODC
Middleware Symposium,
· M. Herlihy and E. Ruppert. On the Existence of Booster Types. In Thirty-Second IEEE Symposium on Foundations of Computer Science (FOCS), November 12-14, 2000. BiBTeX.
·
C.
Busch and M.P. Herlihy and R.
Wattenhofer. Hard Potato Routing. In Thirty-Second
Annual ACM Symposium on Theory of Computing (STOC},
· C. Busch, N. Demetriou, M.P. Herlihy and M. Mavronicolas. A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the European Association for Theoretical Computer Science. June 2000. BiBTeX.
·
C.
Busch and M.P. Herlihy and R.
Wattenhofer. Randomized Greedy
Hot-Potato Routing. In Eleventh Annual ACM-SIAM Symposium on Discrete
Algorithms. January 2000.
·
W. Aiello and C. Busch, M.P. Herlihy, M.
Mavronicolas, Nir Shavit
and D. Touitou. Supporting
Increment and Decrement Operations in Balancing Networks.
· M.P. Herlihy and M.P. Warres. A tale of two directories: implementing distributed shared objects in Java. Concurrency - Practice and Experience, 2000. (Preliminary version in Java Grande 1999.) BiBTeX.
· M.P. Herlihy, Sergio Rajsbaum. Algebraic Spans. Mathematical Structures in Computer Science. 2000. (Preliminary version in PODC'95.) BiBTeX.
· S. Chaudhuri, M.P. Herlihy, and M.R. Tuttle. Tight Bounds for k-Set Agreement . Journal of the ACM. 47, 5 (Sep. 2000), Pages 912 – 943. (Preliminary version FOCS'93.) BibTeX.
· M.P. Herlihy and Nir Shavit. The Topological Structure of Asynchronous Computability. Journal of the ACM, November 1999. (Preliminary versions in STOC'93 and STOC'94.) BibTeX. Won 2004 Goedel Prize.
·
M.P. Herlihy and Sergio Rajsbaum . New
Perspectives in Distributed Computing. In Mathematical Foundations of
Computer Science. Invited paper. September 1999,
· S. Chaudhuri, M.P. Herlihy, and M.R. Tuttle. Wait-Free Implementations in Message-Passing Systems, Theoretical Computer Science, (220)1, 1999, pp 211—245. (Preliminary version PODC'90.) BibTeX.
·
C.
Busch and M.P. Herlihy. Counting and
Sorting Networks of Small Depth and Arbitrary Width. In Eleventh ACM
Symposium on Parallel Algorithms and Architectures (SPAA'99). June 1999,
· M Herlihy. The Aleph Toolkit: Support for Scalable Distributed Shared Objects. In Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing, January 1999, Orlando, FL. BiBTeX.
· F. Fich, M. Herlihy, and Nir Shavit. On the Space Complexity of Randomized Synchronization. Journal of the ACM, 45(5), pp. 843--862, September 1998. (Preliminary version PODC'93.) BibTeX.
·
M.P. Herlihy and Sergio Rajsbaum and M.R.
Tuttle. Unifying Synchronous and Asynchronous
Message-Passing Models. In Proceedings of the 16th Annual ACM Symposium
on Principles of Distributed Computing (PODC'98), July 1998,
·
M. Demmer and M.P. Herlihy. The Arrow Directory Protocol. 12th
International Symposium on Distributed Computing (DISC 98), September
1998,
· C. Dwork, M.P. Herlihy, and O. Waarts. Contention in Shared Memory Algorithms. Journal of the ACM, 44(6), pp 779--805, November 1997. (Preliminary version STOC'93.) BiBTeX.
·
C. Dwork and M.P. Herlihy, S. Plotkin, and O. Waarts. Time-Lapse snapshots.
· C. Dwork and M.P. Herlihy, and O. Waarts. Contention in Shared Memory Algorithms. Journal of the ACM, 44(6), pp 779--805, November 1997. BiBTeX.
·
M.P. Herlihy and Sergio Rajsbaum. The decidability of Distributed Decision
Problems. In Proceedings of the 29th Annual Symposium on Theory of
Computing, May 1997,
· M.P. Herlihy and Sergio Rajsbaum, Algebraic Topology and Distributed Computing --- a Primer. On Computer Science Today - Recent Trends and Developments, Jan van Leeuwen Editor, Springer-Verlag Lecture Notes in Computer Science #1000, 1996. ISBN-3-54060105-8.
· M.P. Herlihy, Nir Shavit, and O. Waarts. Linearizable Counting Networks. Distributed Computing, 9(4), 1996. (Preliminary version FOCS'91.) BibTeX.
· M.P. Herlihy, B-H. Lim, and Nir Shavit. Scalable Concurrent Counting ACM Transactions on Computer Systems, 13(4), pp. 343--364, November 1995. (Preliminary version SPAA'92.) BibTeX.
· H. Attiya, M.P. Herlihy, and O. Rachman. Atomic Snapshots in Expected O(n) Operations Using Lattice Agreement. Distributed Computing, 8(3): pp 121--132, March 1995. (Preliminary version WDAG'92.) BibTeX.
· J. Aspnes, M.P. Herlihy, and Nir Shavit. Journal of the ACM, 41(5): pp 1020--1048, September 1994. (Preliminary version STOC'91.) BibTeX.
·
M.P. Herlihy and Sergio Rajsbaum. Set Consensus Using Arbitrary Objects. In
Proceedings of the 12th Annual ACM Symposium on Principles of Distributed
Computing, August 1994,
.
· M.P. Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and System}, 15(9): 745--770, November 1993. (Preliminary version PPoPP'90.) BibTeX.
·
. C. Dwork, M.P. Herlihy, and O. Waarts. Bounded Round Numbers. In Proceedings of
the 12th Annual ACM Symposium on Principles of Distributed Computing,
August 1993,
·
. M.P. Herlihy and J.E.B. Moss. Transactional Memory:
architectural support for lock-free data structures. In Proceedings of
the 1993 International Symposium on Computer Architecture (ISCA), May 1993,
.
· M.P. Herlihy, N.A. Lynch, M. Merritt, and W.E. Weihl. On the correctness of orphan elimination algorithms. Journal of the ACM, 39(4):881--930, October 1992. BibTeX.
· . M.P. Herlihy and J.E.B. Moss. Lock-Free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 3(2), April 1992. (Preliminary version SPAA'91.) BibTeX.
.
·
M.P. Herlihy. Randomized Wait-Free Concurrent Objects. In
Proceedings of the 10th Annual ACM Symposium on Principles of Distributed
Computing, August 1991,
· . M.P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124--149, January 1991. (Preliminary version PODC'88.) BibTeX.
· . M.P. Herlihy and J.M. Wing. Specifying graceful degradation. IEEE Transactions on Parallel and Distributed Systems, 2(1):93--104, January 1991. (Preliminary version in PODC'87.) BibTeX.
·
. M.P. Herlihy. Impossibility
results for asynchronous PRAM. In Proceedings of the 2nd Annual
Symposium on Parallel Algorithms and Architectures, July 1991, Hilton Head,
· . M.P. Herlihy and W.E. Weihl. Hybrid concurrency control for abstract data types. Journal of Computer and System Sciences, 43:25-61, 1991. (Preliminary version PODS'88.) BibTeX.
·
. M.P. Herlihy and J.D. Tygar. Implementing
distributed capabilities without a trusted kernel. In Proceedings of the
International Working Conference on Dependable Computing for Critical
Applications,
· .
· M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463--492, July 1990. (Preliminary version POPL'87. BibTeX.
· . J. Aspnes and M.P. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 15(1):441-460, September 1990. BibTeX.
· . M.P. Herlihy. Apologizing versus asking permission: Optimistic concurrency control for abstract data types. ACM Transactions on Database Systems, March 1990. (Preliminary version PODC'86.) BibTeX.
· . M.P. Herlihy. Concurrency and availability as dual properties of replicated atomic data. Journal of the ACM, 37(2):257--278, April 1990. (Preliminary version PODC'85.) BibTeX.
·
. J. Aspnes and M.P. Herlihy. Wait-Free Data Structures in the Asynchronous
PRAM Model. In Proceedings of the 2nd Annual Symposium on Parallel
Algorithms and Architectures, July 1990, pages 340--349,
.
· M.P. Herlihy and M.S. McKendry. Timestamp-based orphan elimination. IEEE Transactions on Software Engineering, 15(7):825--831, July 1989. (Preliminary version in Fifth Symposium on Reliability in Distributed Software and Database Systems,1986.) BibTeX.
· D.L. Detlefs, M.P. Herlihy, and J.M. Wing. Inheritance of synchronization and recovery properties in Avalon/C++. IEEE Computer, 21(12):57--69, December 1988. Also in ``Advanced Language Implementation Techniques'', Peter Lee Editor, MIT Press, 1990. (Preliminary version HICSS-21 1988.) BibTeX.
.
· M.P. Herlihy. Availability vs. concurrency: atomicity mechanisms for replicated data. ACM Transactions on Computer Systems, 4(3):249--274, August 1987. BibTeX.
· . M.P. Herlihy and J.M. Wing. Avalon: language support for reliable distributed systems. In 17th Symposium on Fault-Tolerant Computer System}, July 1987. BibTeX.
· . M.P. Herlihy. Dynamic quorum adjustment for partitioned data. ACM Transactions on Database Systems, 12(2):170--194, June 1987. BibTeX.
· . M.P. Herlihy. Extending multiversion timestamping protocols to exploit type information. IEEE Transactions on Computers, C-35(4):443--449, April 1987.Special issue on parallel and distributed computing. BibTeX.
· . M.P. Herlihy and J.D. Tygar. How to make replicated data secure. In Proceedings of CRYPTO-87, August 1987. BibTeX.
.
· M.P. Herlihy. A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems, 4(1):32--53, February 1986. BibTeX.
· . B.H. Liskov, M.P. Herlihy, and L. Gilbert. Limitations of synchronous communication with static process structure in languages for distributed computing. In 13th ACM Symposium on Principles of Programming Languages, January 1986. Reprinted in Concurrent Programming, Gehani and McGettrick eds., Addison-Wesley.
· M.P. Herlihy and B.H. Liskov. A value transmission method for abstract data types. ACM Transactions on Programming Languages and Systems, 4(4):527--551, October 1982. BibTeX.
.