The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Maurice Herlihy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maurice Herlihy
    A Quorum-Consensus Replication Method for Abstract Data Types. [Citation Graph (22, 0)][DBLP]
    ACM Trans. Comput. Syst., 1986, v:4, n:1, pp:32-53 [Journal]
  2. Maurice Herlihy
    Dynamic Quorum Adjustment for Partitioned Data. [Citation Graph (21, 25)][DBLP]
    ACM Trans. Database Syst., 1987, v:12, n:2, pp:170-194 [Journal]
  3. Maurice Herlihy, William E. Weihl
    Hybrid Concurrency Control for Abstract Data Types. [Citation Graph (17, 13)][DBLP]
    PODS, 1988, pp:201-210 [Conf]
  4. Maurice Herlihy
    Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. [Citation Graph (8, 34)][DBLP]
    ACM Trans. Database Syst., 1990, v:15, n:1, pp:96-124 [Journal]
  5. David Detlefs, Maurice Herlihy, Jeannette M. Wing
    Inheritance of Synchronization and Recovery Properties in Avalon/C++. [Citation Graph (7, 0)][DBLP]
    IEEE Computer, 1988, v:21, n:12, pp:57-69 [Journal]
  6. Maurice Herlihy
    Extending Multiversion Time-Stamping Protocols to Exploit Type Information. [Citation Graph (7, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:4, pp:443-448 [Journal]
  7. Maurice Herlihy, William E. Weihl
    Hybrid Concurrency Control for Abstract Data Types. [Citation Graph (6, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:1, pp:25-61 [Journal]
  8. Maurice Herlihy
    Concurrency versus Availability: Atomic Mechanisms for Replicated Data. [Citation Graph (5, 0)][DBLP]
    ACM Trans. Comput. Syst., 1987, v:5, n:3, pp:249-274 [Journal]
  9. Maurice Herlihy
    Optimistic Concurrency Control for Abstract Data Types. [Citation Graph (3, 0)][DBLP]
    PODC, 1986, pp:206-217 [Conf]
  10. Maurice Herlihy, Jeannette M. Wing
    Specifying Graceful Degradation in Distributed Systems. [Citation Graph (2, 0)][DBLP]
    PODC, 1987, pp:167-177 [Conf]
  11. Maurice Herlihy, Jeannette M. Wing
    Axioms for Concurrent Objects. [Citation Graph (2, 0)][DBLP]
    POPL, 1987, pp:13-26 [Conf]
  12. Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl
    On the Correctness of Orphan Management Algorithms. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:881-930 [Journal]
  13. Maurice Herlihy, J. Eliot B. Moss
    Transactional Memory: Architectural Support for Lock-Free Data Structures. [Citation Graph (1, 0)][DBLP]
    ISCA, 1993, pp:289-300 [Conf]
  14. Maurice Herlihy
    Comparing How Atomicity Mechanisms Support Replication. [Citation Graph (1, 0)][DBLP]
    PODC, 1985, pp:102-110 [Conf]
  15. Maurice Herlihy
    Impossibility and Universality Results for Wait-Free Synchronization. [Citation Graph (1, 0)][DBLP]
    PODC, 1988, pp:276-290 [Conf]
  16. Maurice Herlihy
    A Methodology for Implementing Highly Concurrent Data Structures. [Citation Graph (1, 0)][DBLP]
    PPOPP, 1990, pp:197-206 [Conf]
  17. Martin S. McKendry, Maurice Herlihy
    Time-Driven Orphan Elimination. [Citation Graph (1, 0)][DBLP]
    Symposium on Reliability in Distributed Software and Database Systems, 1986, pp:42-48 [Conf]
  18. Maurice Herlihy, Barbara Liskov
    A Value Transmission Method for Abstract Data Types. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1982, v:4, n:4, pp:527-551 [Journal]
  19. Maurice Herlihy, Jeannette M. Wing
    Linearizability: A Correctness Condition for Concurrent Objects. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1990, v:12, n:3, pp:463-492 [Journal]
  20. David Detlefs, Maurice Herlihy, K. Kietzke, Jeannette M. Wing
    Avalon/C++. [Citation Graph (0, 0)][DBLP]
    C++ Workshop, 1987, pp:451-459 [Conf]
  21. Maurice Herlihy
    The Aleph Toolkit: Support for Scalable Distributed Shared Objects. [Citation Graph (0, 0)][DBLP]
    CANPC, 1999, pp:137-149 [Conf]
  22. Maurice Herlihy, J. D. Tygar
    How to Make Replicated Data Secure. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:379-391 [Conf]
  23. Maurice Herlihy, Jeannette M. Wing
    Specifying Security Constraints with Relaxation Lattices. [Citation Graph (0, 0)][DBLP]
    CSFW, 1989, pp:47-53 [Conf]
  24. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    A Combinatorial Characterization of Properties Preserved by Antitokens. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:575-582 [Conf]
  25. Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle
    A Tight Lower Bound for k-Set Agreement [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:206-215 [Conf]
  26. Maurice Herlihy, Eric Ruppert
    On the Existence of Booster Types. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:653-663 [Conf]
  27. Maurice Herlihy, Nir Shavit, Orli Waarts
    Low Contention Linearizable Counting [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:526-535 [Conf]
  28. Maurice Herlihy, Jeannette M. Wing
    Reasoning about Atomic Objects. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1988, pp:193-208 [Conf]
  29. Ori Dvir, Maurice Herlihy, Nir Shavit
    Virtual Leashing: Internet-Based Software Piracy Protection. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:283-292 [Conf]
  30. Maurice Herlihy, Victor Luchangco, Mark Moir
    Obstruction-Free Synchronization: Double-Ended Queues as an Example. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:522-529 [Conf]
  31. Maurice Herlihy, Srikanta Tirthapura
    Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:4-11 [Conf]
  32. Maurice Herlihy, Srikanta Tirthapura
    Randomized Smoothing Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  33. Ravi Rajwar, Maurice Herlihy, Konrad K. Lai
    Virtualizing Transactional Memory. [Citation Graph (0, 0)][DBLP]
    ISCA, 2005, pp:494-505 [Conf]
  34. Tali Moreshet, R. Iris Bahar, Maurice Herlihy
    Energy reduction in multiprocessor systems using transactional memory. [Citation Graph (0, 0)][DBLP]
    ISLPED, 2005, pp:331-334 [Conf]
  35. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:154-170 [Conf]
  36. Maurice Herlihy, Michael P. Warres
    A Tale of Two Directories: Implementing Distributed Shared Objects in Java. [Citation Graph (0, 0)][DBLP]
    Java Grande, 1999, pp:99-108 [Conf]
  37. Maurice Herlihy, Sergio Rajsbaum
    New Perspectives in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:170-186 [Conf]
  38. Maurice Herlihy, Victor Luchangco, Mark Moir
    A flexible framework for implementing software transactional memory. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2006, pp:253-262 [Conf]
  39. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    A Topological Treatment of Early-Deciding Set-Agreement. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:20-35 [Conf]
  40. Felix C. Freiling, Maurice Herlihy, Lucia Draque Penso
    Optimal Randomized Fair Exchange with Secret Shared Coins. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:61-72 [Conf]
  41. Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, Nir Shavit
    A Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:3-16 [Conf]
  42. Maurice Herlihy
    The transactional manifesto: software engineering and non-blocking synchronization. [Citation Graph (0, 0)][DBLP]
    PLDI, 2005, pp:280- [Conf]
  43. Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir
    Bringing practical lock-free synchronization to 64-bit applications. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:31-39 [Conf]
  44. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:241-249 [Conf]
  45. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Bounded Round Numbers. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:53-64 [Conf]
  46. Panagiota Fatourou, Maurice Herlihy
    Adding networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:308-310 [Conf]
  47. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    Toward a theory of transactional contention managers. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:258-264 [Conf]
  48. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    Towards a theory of transactional contention managers. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:316-317 [Conf]
  49. Maurice Herlihy
    On beyond registers: wait-free readable objects. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:26-42 [Conf]
  50. Maurice Herlihy
    The art of multiprocessor programming. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:1-2 [Conf]
  51. Maurice Herlihy
    Randomized Wait-Free Concurrent Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:11-21 [Conf]
  52. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
    Dynamic-sized lock-free data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:131- [Conf]
  53. Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III
    Software transactional memory for dynamic-sized data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:92-101 [Conf]
  54. Maurice Herlihy, Lucia Draque Penso
    tight bounds for k-set agreement with limited-scope failure detectors. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:221- [Conf]
  55. Maurice Herlihy, Sergio Rajsbaum
    Set Consensus Using Arbitrary Objects (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:324-333 [Conf]
  56. Maurice Herlihy, Sergio Rajsbaum
    Algebraic Spans (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:90-99 [Conf]
  57. Maurice Herlihy, Sergio Rajsbaum
    On the Decidability of Distributed Decision Tasks (Brief Announcement). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:279- [Conf]
  58. Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
    Unifying Synchronous and Asynchronous Message-Passing Models. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:133-142 [Conf]
  59. Maurice Herlihy, Mark R. Tuttle
    Lower Bounds for Wait-Free Computation in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:347-362 [Conf]
  60. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
    Competitive concurrent distributed queuing. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:127-133 [Conf]
  61. Barbara Liskov, Maurice Herlihy, Lucy Gilbert
    Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing. [Citation Graph (0, 0)][DBLP]
    POPL, 1986, pp:150-159 [Conf]
  62. Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy
    Composable memory transactions. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2005, pp:48-60 [Conf]
  63. Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro
    Proving correctness of highly-concurrent linearisable objects. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2006, pp:129-136 [Conf]
  64. Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael Scott
    Potential show-stoppers for transactional synchronization. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2007, pp:55- [Conf]
  65. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    Threshold Counters with Increments and Decrements. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:47-61 [Conf]
  66. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Randomized greedy hot-potato routing. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:458-466 [Conf]
  67. James Aspnes, Maurice Herlihy
    Wait-Free Data Structures in the Asynchronous PRAM Model. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:340-349 [Conf]
  68. Costas Busch, Maurice Herlihy
    Sorting and Counting Networks of Small Depth and Arbitrary Width. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:64-73 [Conf]
  69. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Routing without flow control. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:11-20 [Conf]
  70. Maurice Herlihy
    Impossibility Results for Asynchronous PRAM (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:327-336 [Conf]
  71. Maurice Herlihy, Beng-Hong Lim, Nir Shavit
    Low Contention Load Balancing on Large-Scale Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:219-227 [Conf]
  72. Maurice Herlihy, J. Eliot B. Moss
    Lock-Free garbage Collection for Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:229-236 [Conf]
  73. Tali Moreshet, R. Iris Bahar, Maurice Herlihy
    Energy implications of multiprocessor synchronization. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:329- [Conf]
  74. Barbara Liskov, Maurice Herlihy
    Issues Process and Communication Structure for Distributed Programs. [Citation Graph (0, 0)][DBLP]
    Symposium on Reliability in Distributed Software and Database Systems, 1983, pp:123-132 [Conf]
  75. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:393-403 [Conf]
  76. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks and Multi-Processor Coordination [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:348-358 [Conf]
  77. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Hard-Potato routing. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:278-285 [Conf]
  78. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:174-183 [Conf]
  79. Maurice Herlihy, Sergio Rajsbaum
    The Decidability of Distributed Decision Tasks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:589-598 [Conf]
  80. Maurice Herlihy, Nir Shavit
    The asynchronous computability theorem for t-resilient tasks. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:111-120 [Conf]
  81. Maurice Herlihy, Nir Shavit
    A simple constructive computability theorem for wait-free computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:243-252 [Conf]
  82. Hagit Attiya, Maurice Herlihy, Ophir Rachman
    Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:35-53 [Conf]
  83. Michael J. Demmer, Maurice Herlihy
    The Arrow Distributed Directory Protocol. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:119-133 [Conf]
  84. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    Polymorphic Contention Management. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:303-323 [Conf]
  85. Maurice Herlihy, Victor Luchangco, Mark Moir
    The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:339-353 [Conf]
  86. Maurice Herlihy, Lucia Draque Penso
    Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:279-291 [Conf]
  87. Maurice Herlihy, Sergio Rajsbaum
    A Wait-Free Classification of Loop Agreement Tasks. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:175-185 [Conf]
  88. Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
    A New Synchronous Lower Bound for Set Agreement. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:136-150 [Conf]
  89. Maurice Herlihy, Ye Sun
    Distributed Transactional Memory for Metric-Space Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:324-338 [Conf]
  90. Maurice Herlihy, Srikanta Tirthapura
    Self Stabilizing Distributed Queuing. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:209-223 [Conf]
  91. Panagiota Fatourou, Maurice Herlihy
    Adding Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:330-342 [Conf]
  92. Eli Gafni, Sergio Rajsbaum, Maurice Herlihy
    Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:329-338 [Conf]
  93. Costas Busch, Maurice Herlihy
    A Survey on Counting Networks. [Citation Graph (0, 0)][DBLP]
    WDAS, 1998, pp:13-20 [Conf]
  94. Maurice Herlihy
    Position Statement: Type Specific Replication for Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Workshop on the Management of Replicated Data, 1990, pp:70-74 [Conf]
  95. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  96. Maurice Herlihy, Michael P. Warres
    A tale of two directories: implementing distributed shared objects in Java. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2000, v:12, n:7, pp:555-572 [Journal]
  97. Hagit Attiya, Maurice Herlihy, Ophir Rachman
    Atomic Snapshots Using Lattice Agreement. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1995, v:8, n:3, pp:121-132 [Journal]
  98. Panagiota Fatourou, Maurice Herlihy
    Read-modify-write networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2004, v:17, n:1, pp:33-46 [Journal]
  99. Maurice Herlihy, Lucia Draque Penso
    Tight bounds for k-set agreement with limited-scope failure detectors. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:2, pp:157-166 [Journal]
  100. Maurice Herlihy, Nir Shavit, Orli Waarts
    Linearizable Counting Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1996, v:9, n:4, pp:193-203 [Journal]
  101. Maurice Herlihy, Srikanta Tirthapura
    Self-stabilizing smoothing and balancing networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:5, pp:345-357 [Journal]
  102. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    A Combinatorial Characterization of Properties Preserved by Antitokens. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:71, n:, pp:114-132 [Journal]
  103. Maurice Herlihy, Victor Luchangco, Mark Moir
    Space and Time Adaptive Non-blocking Algorithms. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  104. Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
    An Overview of Synchronous Message-Passing and Topology. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:39, n:2, pp:- [Journal]
  105. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:1020-1048 [Journal]
  106. Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle
    Tight bounds for k-set agreement. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:5, pp:912-943 [Journal]
  107. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:6, pp:779-805 [Journal]
  108. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:843-862 [Journal]
  109. Maurice Herlihy
    Concurrency and Availability as Dual Properties of Replicated Atomic Data [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:257-278 [Journal]
  110. Maurice Herlihy, Nir Shavit
    The topological structure of asynchronous computability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:858-923 [Journal]
  111. James Aspnes, Maurice Herlihy
    Fast Randomized Consensus Using Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:441-461 [Journal]
  112. Ori Dvir, Maurice Herlihy, Nir Shavit
    Virtual Leashing: Creating a computational foundation for software protection. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:9, pp:1233-1240 [Journal]
  113. Maurice Herlihy, Srikanta Tirthapura
    Randomized smoothing networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:5, pp:626-632 [Journal]
  114. Maurice Herlihy, Sergio Rajsbaum
    Algebraic spans. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2000, v:10, n:4, pp:549-573 [Journal]
  115. Costas Busch, Maurice Herlihy
    Sorting and Counting Networks of Arbitrary Width and Small Depth. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:2, pp:99-128 [Journal]
  116. Christopher Cole, Maurice Herlihy
    Snapshots and software transactional memory. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2005, v:58, n:3, pp:310-324 [Journal]
  117. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1848-1874 [Journal]
  118. Maurice Herlihy
    Comparing How Atomicity Mechanisms Support Replication. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 1986, v:20, n:3, pp:31-39 [Journal]
  119. Maurice Herlihy
    Optimistic Concurrency Control for Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 1987, v:21, n:2, pp:33-44 [Journal]
  120. Maurice Herlihy
    A Methodology for Implementing Highly Concurrent Data Objects (Abstract). [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 1992, v:26, n:2, pp:12- [Journal]
  121. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
    Ordered Multicast and Distributed Swap. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 2001, v:35, n:1, pp:85-96 [Journal]
  122. Maurice Herlihy
    Taking concurrency seriously (position paper). [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1989, v:24, n:4, pp:32-33 [Journal]
  123. Maurice Herlihy, Jeannette M. Wing
    Linearizable concurrent objects. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1989, v:24, n:4, pp:133-135 [Journal]
  124. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    Threshold counters with increments and decrements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:811-826 [Journal]
  125. Soma Chaudhuri, Maurice Herlihy, Mark R. Tuttle
    Wait-Free Implementations in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:211-245 [Journal]
  126. Maurice Herlihy, Sergio Rajsbaum
    A classification of wait-free loop agreement tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:291, n:1, pp:55-77 [Journal]
  127. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
    Nonblocking memory management support for dynamic-sized data structures. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 2005, v:23, n:2, pp:146-196 [Journal]
  128. Maurice Herlihy, Beng-Hong Lim, Nir Shavit
    Scalable Concurrent Counting. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1995, v:13, n:4, pp:343-364 [Journal]
  129. Maurice Herlihy
    Wait-Free Synchronization. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1991, v:13, n:1, pp:124-149 [Journal]
  130. Maurice Herlihy
    A Methodology for Implementing Highly Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1993, v:15, n:5, pp:745-770 [Journal]
  131. Maurice Herlihy, J. Eliot B. Moss
    Lock-Free Garbage Collection for Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1992, v:3, n:3, pp:304-311 [Journal]
  132. Maurice Herlihy, Jeannette M. Wing
    Specifying Graceful Degradation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:1, pp:93-104 [Journal]
  133. Srikanta Tirthapura, Maurice Herlihy
    Self-Stabilizing Distributed Queuing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:7, pp:646-655 [Journal]
  134. Maurice Herlihy, Martin S. McKendry
    Timestamp-Based Orphan Elimination. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1989, v:15, n:7, pp:825-831 [Journal]
  135. Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport
    On the weakest failure detector ever. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:235-243 [Conf]
  136. Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
    A Simple Optimistic Skiplist Algorithm. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:124-138 [Conf]
  137. Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer
    Dynamic Analysis of the Arrow Distributed Protocol. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:875-901 [Journal]

  138. tm_db: A Generic Debugging Library for Transactional Programs. [Citation Graph (, )][DBLP]


  139. Applications of Shellable Complexes to Distributed Computing - (Invited Talk). [Citation Graph (, )][DBLP]


  140. The Multicore Revolution. [Citation Graph (, )][DBLP]


  141. Energy efficient synchronization techniques for embedded architectures. [Citation Graph (, )][DBLP]


  142. Energy and Throughput Efficient Transactional Memory for Embedded Multicore Systems. [Citation Graph (, )][DBLP]


  143. Transactional Memory Today. [Citation Graph (, )][DBLP]


  144. Language Support and Compiler Optimizations for STM and Transactional Boosting. [Citation Graph (, )][DBLP]


  145. Transactional Memory Today: A Status Report. [Citation Graph (, )][DBLP]


  146. Enhanced Fault-Tolerance through Byzantine Failure Detection. [Citation Graph (, )][DBLP]


  147. The future of distributed computing: renaissance or reformation? [Citation Graph (, )][DBLP]


  148. Brief announcement: concurrent non-commutative boosted transactions. [Citation Graph (, )][DBLP]


  149. The topology of shared-memory adversaries. [Citation Graph (, )][DBLP]


  150. Coarse-grained transactions. [Citation Graph (, )][DBLP]


  151. Transactional boosting: a methodology for highly-concurrent transactional objects. [Citation Graph (, )][DBLP]


  152. Committing conflicting transactions in an STM. [Citation Graph (, )][DBLP]


  153. Dreadlocks: efficient deadlock detection. [Citation Graph (, )][DBLP]


  154. Checkpoints and continuations instead of nested transactions. [Citation Graph (, )][DBLP]


  155. Optimizing Threshold Protocols in Adversarial Structures. [Citation Graph (, )][DBLP]


  156. Hopscotch Hashing. [Citation Graph (, )][DBLP]


  157. Concurrent Computing and Shellable Complexes. [Citation Graph (, )][DBLP]


  158. Distributed Computing and the Multicore Revolution. [Citation Graph (, )][DBLP]


  159. Composable memory transactions. [Citation Graph (, )][DBLP]


  160. Technical perspective - Highly concurrent data structures. [Citation Graph (, )][DBLP]


  161. Distributed transactional memory for metric-space networks. [Citation Graph (, )][DBLP]


  162. On the weakest failure detector ever. [Citation Graph (, )][DBLP]


  163. An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.767secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002