default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHagit Attiya
Chagit Attiya
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
- award (2011): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j93]Hagit Attiya:
Special issue on PODC 2021 and DISC 2021. Distributed Comput. 37(1): 65 (2024)- [c138]Hagit Attiya
, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. PODC 2024: 14-24 - [c137]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. PODC 2024: 432-442 - [i24]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. CoRR abs/2402.13618 (2024) - [i23]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - 2023
- [j92]Hagit Attiya:
Special issue on DISC 2019. Distributed Comput. 36(1): 1 (2023) - [j91]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. 176: 28-40 (2023) - [c136]Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CIAC 2023: 52-66 - [c135]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. CONCUR 2023: 27:1-27:17 - [c134]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. OPODIS 2023: 4:1-4:23 - [c133]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. OPODIS 2023: 6:1-6:23 - [c132]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. OPODIS 2023: 24:1-24:22 - [c131]Hagit Attiya, Jennifer L. Welch:
Bounds on Worst-Case Responsiveness for Agreement Algorithms. OPODIS 2023: 32:1-32:22 - [c130]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC 2023: 4:1-4:23 - [c129]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. DISC 2023: 5:1-5:21 - [c128]Hagit Attiya, Jennifer L. Welch:
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. DISC 2023: 36:1-36:7 - [c127]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap. DISC 2023: 44:1-44:7 - [i22]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. CoRR abs/2301.13837 (2023) - [i21]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. CoRR abs/2308.03485 (2023) - [i20]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR abs/2308.04213 (2023) - [i19]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. CoRR abs/2308.04646 (2023) - [i18]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. CoRR abs/2308.16600 (2023) - [i17]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. IACR Cryptol. ePrint Arch. 2023: 192 (2023) - 2022
- [j90]Hagit Attiya:
Special issue on PODC 2020. Distributed Comput. 35(4): 303 (2022) - [j89]Hagit Attiya:
Special issue on DISC 2020. Distributed Comput. 35(6): 475 (2022) - [j88]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement. Inf. Comput. 285(Part): 104869 (2022) - [j87]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. J. Parallel Distributed Comput. 163: 181-197 (2022) - [c126]Yehonatan Fridman, Yaniv Snir, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Recovery of Distributed Iterative Solvers for Linear Systems Using Non-Volatile RAM. FTXS@SC 2022: 11-23 - [c125]Hagit Attiya, Faith Ellen:
The Step Complexity of Multidimensional Approximate Agreement. OPODIS 2022: 6:1-6:12 - [c124]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. PODC 2022: 209-219 - [c123]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Detectable recovery of lock-free data structures. PPoPP 2022: 262-277 - [i16]Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CoRR abs/2202.10862 (2022) - [i15]Yehonatan Fridman, Yaniv Snir, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
NVM-ESR: Using Non-Volatile Memory in Exact State Reconstruction of Preconditioned Conjugate Gradient. CoRR abs/2204.11584 (2022) - [i14]Hagit Attiya, Constantin Enea, Sergio Rajsbaum, Ana Sokolova:
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492). Dagstuhl Reports 12(12): 27-53 (2022) - 2021
- [j86]Hagit Attiya:
Special issue on PODC 2018 and DISC 2018. Distributed Comput. 34(4): 227 (2021) - [j85]Hagit Attiya:
Special issue on PODC 2019. Distributed Comput. 34(6): 411 (2021) - [j84]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and space complexity of collaborative text editing. Theor. Comput. Sci. 855: 141-160 (2021) - [c122]Yehonatan Fridman, Yaniv Snir, Matan Rusanovsky, Kfir Zvi, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing. FTXS@SC 2021: 11-20 - [c121]Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Recoverable and Detectable Fetch&Add. OPODIS 2021: 29:1-29:17 - [c120]Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi:
2021 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2021: 3 - [c119]Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete:
Flat-Combining-Based Persistent Data Structures for Non-volatile Memory. SSS 2021: 505-509 - [c118]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. DISC 2021: 7:1-7:18 - [i13]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. CoRR abs/2105.06614 (2021) - [i12]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs. CoRR abs/2106.15554 (2021) - [i11]Yehonatan Fridman, Yaniv Snir, Matan Rusanovsky, Kfir Zvi, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing. CoRR abs/2109.02166 (2021) - 2020
- [j83]Hagit Attiya, Sergio Rajsbaum:
Indistinguishability. Commun. ACM 63(5): 90-99 (2020) - [j82]Hagit Attiya:
Editorial: Special issue of PODC 2017 and DISC 2017. Distributed Comput. 33(3-4): 207 (2020) - [c117]Parwat Singh Anjana, Hagit Attiya, Sweta Kumari, Sathya Peri, Archit Somani:
Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory. NETYS 2020: 77-93 - [c116]Hagit Attiya, Panagiota Fatourou, Sandeep Hans, Eleni Kanellou:
Staleness and Local Progress in Transactional Memory. NETYS 2020: 227-243 - [c115]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems That Mix Shared Memory and Message Passing. OPODIS 2020: 16:1-16:16 - [c114]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS 2020: 18:1-18:16 - [c113]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. PODC 2020: 51-53 - [c112]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. SPAA 2020: 503-505 - [c111]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. SSS 2020: 1-15 - [e2]Hagit Attiya:
34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference. LIPIcs 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-168-9 [contents] - [i10]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. CoRR abs/2003.07787 (2020) - [i9]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR abs/2011.10436 (2020) - [i8]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems that Mix Shared Memory and Message Passing. CoRR abs/2012.10846 (2020)
2010 – 2019
- 2019
- [j81]Hagit Attiya:
Special issue on PODC 2015 and PODC 2016. Distributed Comput. 32(6): 459 (2019) - [j80]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) - [j79]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Emulating a Shared Register in a System That Never Stops Changing. IEEE Trans. Parallel Distributed Syst. 30(3): 544-559 (2019) - [c110]Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. DISC 2019: 2:1-2:17 - [c109]Artem Khyzha, Hagit Attiya, Alexey Gotsman:
Privatization-Safe Transactional Memories. DISC 2019: 24:1-24:17 - [p4]Hagit Attiya, Jennifer L. Welch:
Shared memory and the Bakery algorithm. Concurrency: the Works of Leslie Lamport 2019: 27-46 - [i7]Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. CoRR abs/1905.12063 (2019) - [i6]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR abs/1905.13600 (2019) - [i5]Artem Khyzha, Hagit Attiya, Alexey Gotsman:
Privatization-Safe Transactional Memories (Extended Version). CoRR abs/1908.03179 (2019) - 2018
- [j78]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. J. ACM 65(1): 2:1-2:44 (2018) - [j77]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018) - [j76]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. 121: 1-14 (2018) - [c108]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. PODC 2018: 7-16 - [c107]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating Lock-Freedom from Wait-Freedom. PODC 2018: 41-50 - [c106]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe privatization in transactional memory. PPoPP 2018: 233-245 - [i4]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe Privatization in Transactional Memory. CoRR abs/1801.04249 (2018) - 2017
- [j75]Hagit Attiya:
Special issue on DISC 2013, 2014 and PODC 2014. Distributed Comput. 30(5): 307 (2017) - [j74]Hagit Attiya, Arie Fouren:
Poly-logarithmic adaptive algorithms require revealing primitives. J. Parallel Distributed Comput. 109: 102-116 (2017) - [j73]Hagit Attiya, Faith Ellen, Adam Morrison:
Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. 28(1): 141-155 (2017) - [c105]Hagit Attiya, Arie Fouren:
Lower Bounds on the Amortized Time Complexity of Shared Objects. OPODIS 2017: 16:1-16:18 - [c104]Hagit Attiya, Gili Yavneh:
Remote Memory References at Block Granularity. OPODIS 2017: 18:1-18:17 - [i3]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in a System that Never Stops Changing. CoRR abs/1708.03274 (2017) - 2016
- [j72]Hagit Attiya:
Special issue in memory of Berthold Vöcking. Distributed Comput. 29(2): 75 (2016) - [j71]Hagit Attiya, Ami Paz:
Counting-based impossibility proofs for set agreement and renaming. J. Parallel Distributed Comput. 87: 1-12 (2016) - [j70]James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016) - [c103]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and Complexity of Collaborative Text Editing. PODC 2016: 259-268 - [c102]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC 2016: 257-268 - 2015
- [j69]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62(1): 3:1-3:22 (2015) - [j68]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4): 692-701 (2015) - [c101]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS 2015: 31:1-31:16 - [c100]Hagit Attiya, Arie Fouren:
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. OPODIS 2015: 36:1-36:16 - [c99]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Trading Fences with RMRs and Separating Memory Models. PODC 2015: 173-182 - [c98]Hagit Attiya, Faith Ellen, Adam Morrison:
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC 2015: 385-394 - [c97]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). DISC 2015: 75-91 - [p3]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety and Deferred Update in Transactional Memory. Transactional Memory 2015: 50-71 - [p2]Hagit Attiya, Panagiota Fatourou:
Disjoint-Access Parallelism in Software Transactional Memory. Transactional Memory 2015: 72-97 - [p1]Hagit Attiya, Vincent Gramoli, Alessia Milani:
Directory Protocols for Distributed Transactional Memory. Transactional Memory 2015: 367-391 - 2014
- [b3]Hagit Attiya, Faith Ellen:
Impossibility Results for Distributed Computing. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2014, ISBN 978-3-031-00882-5 - [j67]Hagit Attiya:
Lower Bounds and Impossibility Results for Transactional Memory Computing. Bull. EATCS 112 (2014) - [c96]Maya Arbel, Hagit Attiya:
Concurrent updates with RCU: search tree as an example. PODC 2014: 196-205 - [c95]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. DISC 2014: 376-390 - 2013
- [j66]Hagit Attiya, Eshcar Hillel:
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists. Theory Comput. Syst. 52(4): 729-762 (2013) - [j65]Hagit Attiya, Eshcar Hillel:
The Cost of Privatization in Software Transactional Memory. IEEE Trans. Computers 62(12): 2531-2543 (2013) - [j64]Hagit Attiya, Armando Castañeda:
A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. 512: 41-48 (2013) - [c94]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. ICDCS 2013: 601-610 - [c93]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Upper bound on the complexity of solving hard renaming. PODC 2013: 190-199 - [c92]Hagit Attiya, Danny Hendler, Smadar Levy:
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. PODC 2013: 220-229 - [c91]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
A programming language perspective on transactional memory consistency. PODC 2013: 309-318 - [i2]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. CoRR abs/1301.6297 (2013) - 2012
- [j63]Hagit Attiya:
Announcement: best reviewer award 2011. Distributed Comput. 25(1): 1 (2012) - [j62]James Aspnes, Hagit Attiya, Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2:1-2:24 (2012) - [j61]Hagit Attiya, Alessia Milani:
Transactional scheduling for read-dominated workloads. J. Parallel Distributed Comput. 72(10): 1386-1396 (2012) - [j60]Hagit Attiya, Eshcar Hillel:
A Single-Version STM that Is Multi-Versioned Permissive. Theory Comput. Syst. 51(4): 425-446 (2012) - [c90]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384 - [c89]Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers:
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO 2012: 195-206 - [c88]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - [c87]Hagit Attiya, Ami Paz:
Counting-Based Impossibility Proofs for Renaming and Set Agreement. DISC 2012: 356-370 - 2011
- [j59]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating snapshot objects. J. Parallel Distributed Comput. 71(12): 1570-1577 (2011) - [j58]Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49(4): 698-719 (2011) - [j57]Hagit Attiya:
Sharing memories, robustly. SIGACT News 42(4): 79-82 (2011) - [j56]