Hagit Attiya

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 83

Top Venues

Publications

Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller
History-Independent Concurrent Objects. CoRR (2024)
Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
History-Independent Concurrent Objects. PODC (2024)
Hagit Attiya, Armando Castañeda, Constantin Enea
Strong Linearizability using Primitives with Consensus Number 2. PODC (2024)
Hagit Attiya
Special issue on PODC 2021 and DISC 2021. Distributed Comput. 37 (1) (2024)
Hagit Attiya, Armando Castañeda, Constantin Enea
Strong Linearizability using Primitives with Consensus Number 2. CoRR (2024)
Tomer Lev Lehman, Hagit Attiya, Danny Hendler
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap. DISC (2023)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. 176 (2023)
Tomer Lev Lehman, Hagit Attiya, Danny Hendler
Recoverable and Detectable Self-Implementations of Swap. OPODIS (2023)
Hagit Attiya, Jennifer L. Welch
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. OPODIS (2023)
Hagit Attiya, Constantin Enea, Shafik Nassar
Faithful Simulation of Randomized BFT Protocols on Block DAGs. CONCUR (2023)
Hagit Attiya, Armando Castañeda, Thomas Nowak
Topological Characterization of Task Solvability in General Models of Computation. CoRR (2023)
Hagit Attiya, Jennifer L. Welch
Bounds on Worst-Case Responsiveness for Agreement Algorithms. OPODIS (2023)
Hagit Attiya, Constantin Enea, Shafik Nassar
Faithful Simulation of Randomized BFT Protocols on Block DAGs. IACR Cryptol. ePrint Arch. 2023 (2023)
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 (2023)
Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti
The Synchronization Power of Auditable Registers. OPODIS (2023)
Hagit Attiya, Noa Schiller
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CIAC (2023)
Tomer Lev Lehman, Hagit Attiya, Danny Hendler
Recoverable and Detectable Self-Implementations of Swap. CoRR (2023)
Hagit Attiya, Armando Castañeda, Thomas Nowak
Topological Characterization of Task Solvability in General Models of Computation. DISC (2023)
Hagit Attiya, Jennifer L. Welch
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. DISC (2023)
Hagit Attiya
Special issue on DISC 2019. Distributed Comput. 36 (1) (2023)
Hagit Attiya, Jennifer L. Welch
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. CoRR (2023)
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)
Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti
The Synchronization Power of Auditable Registers. CoRR (2023)
Hagit Attiya, Noa Schiller
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CoRR (2022)
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 (2022)
Hagit Attiya
Special issue on DISC 2020. Distributed Comput. 35 (6) (2022)
Hagit Attiya, Faith Ellen
The Step Complexity of Multidimensional Approximate Agreement. OPODIS (2022)
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas
Detectable recovery of lock-free data structures. PPoPP (2022)
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 (2022)
Hagit Attiya
Special issue on PODC 2020. Distributed Comput. 35 (4) (2022)
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)
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) (2022)
Hagit Attiya, Constantin Enea, Jennifer L. Welch
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. PODC (2022)
Hagit Attiya, Constantin Enea, Sergio Rajsbaum, Ana Sokolova
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492). Dagstuhl Reports 12 (12) (2022)
Hagit Attiya, Constantin Enea, Jennifer L. Welch
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs. CoRR (2021)
Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski
Specification and space complexity of collaborative text editing. Theor. Comput. Sci. 855 (2021)
Hagit Attiya
Special issue on PODC 2019. Distributed Comput. 34 (6) (2021)
Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler
Recoverable and Detectable Fetch&Add. OPODIS (2021)
Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi
2021 Principles of Distributed Computing Doctoral Dissertation Award. PODC (2021)
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)
Hagit Attiya
Special issue on PODC 2018 and DISC 2018. Distributed Comput. 34 (4) (2021)
Hagit Attiya, Constantin Enea, Jennifer L. Welch
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. CoRR (2021)
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 (2021)
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)
Hagit Attiya, Constantin Enea, Jennifer L. Welch
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. DISC (2021)
Hagit Attiya, Sweta Kumari, Noa Schiller
Optimal Resilience in Systems that Mix Shared Memory and Message Passing. CoRR (2020)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR (2020)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS (2020)
Hagit Attiya, Sergio Rajsbaum
Indistinguishability. Commun. ACM 63 (5) (2020)
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 (2020)
Hagit Attiya
Editorial: Special issue of PODC 2017 and DISC 2017. Distributed Comput. 33 (3-4) (2020)
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)
Hagit Attiya, Sweta Kumari, Noa Schiller
Optimal Resilience in Systems That Mix Shared Memory and Message Passing. OPODIS (2020)
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)
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)
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)
Hagit Attiya, Panagiota Fatourou, Sandeep Hans, Eleni Kanellou
Staleness and Local Progress in Transactional Memory. NETYS (2020)
Hagit Attiya
Special issue on PODC 2015 and PODC 2016. Distributed Comput. 32 (6) (2019)
Hagit Attiya, Constantin Enea
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. DISC (2019)
Artem Khyzha, Hagit Attiya, Alexey Gotsman
Privatization-Safe Transactional Memories. DISC (2019)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48 (1) (2019)
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) (2019)
Artem Khyzha, Hagit Attiya, Alexey Gotsman
Privatization-Safe Transactional Memories (Extended Version). CoRR (2019)
Hagit Attiya, Constantin Enea
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. CoRR (2019)
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas
Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR (2019)
Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
Separating Lock-Freedom from Wait-Freedom. PODC (2018)
Hagit Attiya, Ohad Ben-Baruch, Danny Hendler
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. PODC (2018)
Hagit Attiya, Armando Castañeda, Danny Hendler
Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. 121 (2018)
Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky
Safe Privatization in Transactional Memory. CoRR (2018)
Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. J. ACM 65 (1) (2018)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65 (6) (2018)
Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky
Safe privatization in transactional memory. PPOPP (2018)
Hagit Attiya, Arie Fouren
Poly-logarithmic adaptive algorithms require revealing primitives. J. Parallel Distributed Comput. 109 (2017)
Hagit Attiya
Special issue on DISC 2013, 2014 and PODC 2014. Distributed Comput. 30 (5) (2017)
Hagit Attiya, Gili Yavneh
Remote Memory References at Block Granularity. OPODIS (2017)
Hagit Attiya, Faith Ellen, Adam Morrison
Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. 28 (1) (2017)
Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
Simulating a Shared Register in a System that Never Stops Changing. CoRR (2017)
Hagit Attiya, Arie Fouren
Lower Bounds on the Amortized Time Complexity of Shared Objects. OPODIS (2017)
Hagit Attiya, Ami Paz
Counting-based impossibility proofs for set agreement and renaming. J. Parallel Distributed Comput. 87 (2016)
Hagit Attiya
Special issue in memory of Berthold Vöcking. Distributed Comput. 29 (2) (2016)
Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski
Specification and Complexity of Collaborative Text Editing. PODC (2016)
James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45 (3) (2016)
Hagit Attiya, Ohad Ben-Baruch, Danny Hendler
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC (2016)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62 (1) (2015)
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) (2015)
Hagit Attiya, Arie Fouren
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. OPODIS (2015)
Hagit Attiya, Danny Hendler, Philipp Woelfel
Trading Fences with RMRs and Separating Memory Models. PODC (2015)
Hagit Attiya, Armando Castañeda, Danny Hendler
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS (2015)
Hagit Attiya, Faith Ellen, Adam Morrison
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC (2015)
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)
Hagit Attiya
Lower Bounds and Impossibility Results for Transactional Memory Computing. Bull. EATCS 112 (2014)
Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. DISC (2014)
Maya Arbel, Hagit Attiya
Concurrent updates with RCU: search tree as an example. PODC (2014)
Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi
Safety of Deferred Update in Transactional Memory. ICDCS (2013)
Hagit Attiya, Danny Hendler, Smadar Levy
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. PODC (2013)
Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky
A programming language perspective on transactional memory consistency. PODC (2013)
Hagit Attiya, Eshcar Hillel
The Cost of Privatization in Software Transactional Memory. IEEE Trans. Computers 62 (12) (2013)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Upper bound on the complexity of solving hard renaming. PODC (2013)
Hagit Attiya, Eshcar Hillel
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists. Theory Comput. Syst. 52 (4) (2013)
Hagit Attiya, Armando Castañeda
A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. 512 (2013)

Hagit Attiya.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hagit Attiya