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

Search the dblp DataBase

Title:
Author:
Hagit Attiya: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hagit Attiya, Marc Snir, Manfred K. Warmuth
    Computing on an anonymous ring. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:845-875 [Journal]
  2. Hagit Attiya, Marc Snir
    Better Computing on the Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:329-338 [Conf]
  3. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk
    Achievable Cases in an Asynchronous Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:337-346 [Conf]
  4. Hagit Attiya, Nancy A. Lynch, Nir Shavit
    Are Wait-Free Algorithms Fast? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:55-64 [Conf]
  5. Hagit Attiya, Shlomi Dolev, Jennifer L. Welch
    Connection management without retaining information. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:622-0 [Conf]
  6. Hagit Attiya, David Hay
    The Inherent Queuing Delay of Parallel Packet Switches. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:139-152 [Conf]
  7. Jon M. Kleinberg, Hagit Attiya, Nancy A. Lynch
    Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:258-267 [Conf]
  8. Ronit Nossenson, Hagit Attiya
    The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2004, pp:131-138 [Conf]
  9. Hagit Attiya, Hadas Shachnai
    IDABased Protocols for Reliable Multicast. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:137-152 [Conf]
  10. Hagit Attiya, David Hay, Jennifer L. Welch
    Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:221-234 [Conf]
  11. Hagit Attiya
    A Direct Lower Bound for k-Set Consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:314- [Conf]
  12. Hagit Attiya, Vita Bortnikov
    Adaptive and efficient mutual exclusion (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:91-100 [Conf]
  13. Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou
    Long-Lived Renaming Made Adaptive. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:91-103 [Conf]
  14. Hagit Attiya, Amotz Bar-Noy, Danny Dolev
    Sharing Memory Robustly in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:363-375 [Conf]
  15. Hagit Attiya, Eyal Dagan
    Universal Operations: Unary versus Binary (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:223-232 [Conf]
  16. Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:1-13 [Conf]
  17. Hagit Attiya, Danny Dolev, Nir Shavit
    Bounded Polynomial Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:281-293 [Conf]
  18. Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
    Transactional contention management as a non-clairvoyant scheduling problem. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:308-315 [Conf]
  19. Hagit Attiya, Arie Fouren
    Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:277-286 [Conf]
  20. Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan
    Lower bounds for adaptive collect and related objects. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:60-69 [Conf]
  21. Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov
    Synchronizing without locks is inherently expensive. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:300-307 [Conf]
  22. Hagit Attiya, Amir Herzberg, Sergio Rajsbaum
    Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:109-120 [Conf]
  23. Hagit Attiya, Ophir Rachman
    Atomic Snapshots in O(n log n) Operations (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:29-40 [Conf]
  24. Nancy A. Lynch, Hagit Attiya
    Using Mappings to Prove Timing Properties. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:265-280 [Conf]
  25. Hagit Attiya, Nancy A. Lynch
    Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1989, pp:268-284 [Conf]
  26. Hagit Attiya
    Adapting to Point Contention with Long-Lived Safe Agreement . [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:10-23 [Conf]
  27. Eran Aharonson, Hagit Attiya
    Counting Networks with Arbitrary Fan-Out. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:104-113 [Conf]
  28. Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch
    Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:241-250 [Conf]
  29. Hagit Attiya, Roy Friedman
    Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:157-166 [Conf]
  30. Hagit Attiya, David Hay
    The inherent queuing delay of parallel packet switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:269-270 [Conf]
  31. Hagit Attiya, David Hay
    Randomization does not reduce the average delay in parallel packet switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:11-20 [Conf]
  32. Hagit Attiya, David Hay, Isaac Keslassy
    Packet-mode emulation of output-queued switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:138-147 [Conf]
  33. Hagit Attiya, Jennifer L. Welch
    Sequential Consistency Versus Linearizability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:304-315 [Conf]
  34. Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg
    Quantifying Rollback Propagation in Distributed Checkpointing. [Citation Graph (0, 0)][DBLP]
    SRDS, 2001, pp:36-45 [Conf]
  35. Hagit Attiya, Amir Bar-Or
    Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers. [Citation Graph (0, 0)][DBLP]
    SRDS, 2003, pp:371-378 [Conf]
  36. Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
    Time-adaptive algorithms for synchronization. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:800-809 [Conf]
  37. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:359-369 [Conf]
  38. Hagit Attiya, Roy Friedman
    A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:679-690 [Conf]
  39. Hagit Attiya
    Constructing Efficient Election Algorithms from Efficient Traversal Algorithms. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:337-344 [Conf]
  40. Hagit Attiya, Sergio Rajsbaum
    The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1996, pp:322-343 [Conf]
  41. Hagit Attiya, Hadas Shachnai, Tami Tamir
    Local Labeling and Resource Allocation Using Preprocessing. [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:194-208 [Conf]
  42. Hagit Attiya, Rinat Rappoport
    The Level of Handshake Required for Establishing a Connection. [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:179-193 [Conf]
  43. Hagit Attiya
    Implementing FIFO Queus and Stacks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:80-94 [Conf]
  44. Hagit Attiya
    Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1996, pp:56-70 [Conf]
  45. Hagit Attiya, Zvi Avidor
    Wait-Free n-Set Consensus When Inputs Are Restricted. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:326-338 [Conf]
  46. Hagit Attiya, Taly Djerassi-Shintel
    Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. [Citation Graph (0, 0)][DBLP]
    WDAG, 1993, pp:204-218 [Conf]
  47. Hagit Attiya, Arie Fouren
    Polynominal and Adaptive Long-Lived (2k-1)-Renaming. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:149-163 [Conf]
  48. Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov
    Computing with Reads and Writes in the Absence of Step Contention. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:122-136 [Conf]
  49. Hagit Attiya, Alla Gorbach, Shlomo Moran
    Computing in Totally Anonymous Asynchronous Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:49-61 [Conf]
  50. Hagit Attiya, Danny Hendler
    Time and Space Lower Bounds for Implementations Using k-CAS. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:169-183 [Conf]
  51. 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]
  52. Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient Adaptive Collect Using Randomization. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:159-173 [Conf]
  53. Hagit Attiya, Eshcar Hillel
    Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:31-45 [Conf]
  54. Ronit Nossenson, Hagit Attiya
    Understanding the Distribution of File Transmission Duration in the Web. [Citation Graph (0, 0)][DBLP]
    WWW (Posters), 2003, pp:- [Conf]
  55. Hagit Attiya, Faith Ellen, Panagiota Fatourou
    The Complexity of Updating Multi-writer Snapshot Objects. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:319-330 [Conf]
  56. Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks
    Efficient Elections in Chordal Ring Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:3, pp:437-446 [Journal]
  57. Eran Aharonson, Hagit Attiya
    Counting Networks with Arbitrary Fan-Out. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1995, v:8, n:4, pp:163-169 [Journal]
  58. Hagit Attiya, Vita Bortnikov
    Adaptive and efficient mutual exclusion. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:3, pp:177-189 [Journal]
  59. Hagit Attiya, Arie Fouren, Eli Gafni
    An adaptive collect algorithm with applications. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:2, pp:87-96 [Journal]
  60. 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]
  61. Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient adaptive collect using randomization. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:179-188 [Journal]
  62. Hagit Attiya, Sergio Rajsbaum
    Introduction. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:69-70 [Journal]
  63. Hagit Attiya, Rinat Rappoport
    The Level of Handshake Required for Managing a Connection. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:11, n:1, pp:41-57 [Journal]
  64. Nancy A. Lynch, Hagit Attiya
    Using Mappings to Prove Timing Properties. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1992, v:6, n:2, pp:121-139 [Journal]
  65. Hagit Attiya, Shlomi Dolev, Jennifer L. Welch
    Connection Management Without Retaining Information. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:2, pp:155-171 [Journal]
  66. Hagit Attiya, Alla Gorbach, Shlomo Moran
    Computing in Totally Anonymous Asynchronous Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:162-183 [Journal]
  67. Hagit Attiya, Nancy A. Lynch
    Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:183-232 [Journal]
  68. Hagit Attiya, Hadas Shachnai
    Tight bounds for FEC-based reliable multicast. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:2, pp:117-135 [Journal]
  69. Hagit Attiya, Roy Friedman
    Limitations of Fast Consistency Conditions for Distributed Shared Memories. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:243-248 [Journal]
  70. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:4, pp:873-890 [Journal]
  71. Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck
    Reliable Communication Over Unreliable Channels. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:6, pp:1267-1297 [Journal]
  72. Hagit Attiya, Amotz Bar-Noy, Danny Dolev
    Sharing Memory Robustly in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:124-142 [Journal]
  73. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
    Renaming in an Asynchronous Environment [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:524-548 [Journal]
  74. Hagit Attiya, Eyal Dagan
    Improved implementations of binary universal operations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:5, pp:1013-1037 [Journal]
  75. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:122-152 [Journal]
  76. Hagit Attiya, Arie Fouren
    Algorithms adapting to point contention. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:4, pp:444-468 [Journal]
  77. Hagit Attiya, Nancy A. Lynch, Nir Shavit
    Are Wait-Free Algorithms Fast? [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:725-763 [Journal]
  78. Hagit Attiya
    Efficient and Robust Sharing of Memory in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:109-127 [Journal]
  79. Hagit Attiya, Marc Snir
    Better Computing on the Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:204-238 [Journal]
  80. Hagit Attiya, Taly Djerassi-Shintel
    Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:8, pp:1096-1109 [Journal]
  81. Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg
    Quantifying rollback propagation in distributed checkpointing. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:3, pp:370-384 [Journal]
  82. Hagit Attiya, Marios Mavronicolas
    Efficiency of Semisynchronous Versus. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:6, pp:547-571 [Journal]
  83. Hagit Attiya, Amir Bar-Or
    Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:4, pp:419-428 [Journal]
  84. Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
    Time-Adaptive Algorithms for Synchronization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:539-556 [Journal]
  85. Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch
    Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:65-89 [Journal]
  86. Hagit Attiya, Arie Fouren
    Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:642-664 [Journal]
  87. Hagit Attiya, Roy Friedman
    A Correctness Condition for High-Performance Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1637-1670 [Journal]
  88. Hagit Attiya, Amir Herzberg, Sergio Rajsbaum
    Optimal Clock Synchronization under Different Delay Assumptions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:369-389 [Journal]
  89. Hagit Attiya, Sergio Rajsbaum
    The Combinatorial Structure of Wait-Free Solvable Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1286-1313 [Journal]
  90. Hagit Attiya, Ophir Rachman
    Atomic Snapshots in O(n log n) Operations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:319-340 [Journal]
  91. Hagit Attiya, Hadas Shachnai, Tami Tamir
    Local Labeling and Resource Allocation Using Preprocessing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1397-1414 [Journal]
  92. Hagit Attiya, Yishay Mansour
    Language Complexity on the Synchronous Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:169-185 [Journal]
  93. Hagit Attiya, Jennifer L. Welch
    Sequential Consistency versus Linearizability. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1994, v:12, n:2, pp:91-122 [Journal]
  94. Hagit Attiya, David Hay
    The Inherent Queuing Delay of Parallel Packet Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:9, pp:1048-1056 [Journal]
  95. Allon Adir, Hagit Attiya, Gil Shurek
    Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:5, pp:502-515 [Journal]
  96. Hagit Attiya, Faith Ellen, Panagiota Fatourou
    The complexity of updating multi-writer snapshot objects. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:318-319 [Conf]
  97. Hagit Attiya, Eshcar Hillel
    The power of DCAS: highly-concurrent software transactional memory. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:342-343 [Conf]
  98. Hagit Attiya, Keren Censor
    Tight bounds for asynchronous randomized consensus. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:155-164 [Conf]

  99. Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  100. Transactional Scheduling for Read-Dominated Workloads. [Citation Graph (, )][DBLP]


  101. Randomized consensus in expected O(n log n) individual work. [Citation Graph (, )][DBLP]


  102. A world of (Im) possibilities. [Citation Graph (, )][DBLP]


  103. Lower bounds for randomized consensus under a weak adversary. [Citation Graph (, )][DBLP]


  104. Tight RMR lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  105. Max registers, counters, and monotone circuits. [Citation Graph (, )][DBLP]


  106. The inherent complexity of transactional memory and what to do about it. [Citation Graph (, )][DBLP]


  107. Brief announcement: single-version permissive STM. [Citation Graph (, )][DBLP]


  108. Sequential verification of serializability. [Citation Graph (, )][DBLP]


  109. Partial snapshot objects. [Citation Graph (, )][DBLP]


  110. Inherent limitations on disjoint-access parallel implementations of transactional memory. [Citation Graph (, )][DBLP]


  111. Brief announcement: combine -- an improved directory-based consistency protocol. [Citation Graph (, )][DBLP]


  112. A Provably Starvation-Free Distributed Directory Protocol. [Citation Graph (, )][DBLP]


  113. Tight rmr lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  114. Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. [Citation Graph (, )][DBLP]


  115. The Cost of Privatization. [Citation Graph (, )][DBLP]


  116. Brief Announcement: Sharing Memory in a Self-stabilizing Manner. [Citation Graph (, )][DBLP]


  117. Fast Randomized Test-and-Set and Renaming. [Citation Graph (, )][DBLP]


  118. Highly-Concurrent Multi-word Synchronization. [Citation Graph (, )][DBLP]


  119. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. [Citation Graph (, )][DBLP]


  120. Practically Stabilizing Atomic Memory [Citation Graph (, )][DBLP]


  121. Editorial: It's all about change. [Citation Graph (, )][DBLP]


  122. Concurrency and the Principle of Data Locality. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.020secs
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