Остановите войну!
for scientists:
default search action
Danny Hendler
- > Home > Persons > Danny Hendler
Publications
- 2023
- [c68]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. OPODIS 2023: 24:1-24:22 - [c67]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap. DISC 2023: 44:1-44:7 - [i20]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. CoRR abs/2308.03485 (2023) - 2022
- [j28]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) - [c65]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 - [c64]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Detectable recovery of lock-free data structures. PPoPP 2022: 262-277 - [i18]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) - 2021
- [c62]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 - [c60]Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Recoverable and Detectable Fetch&Add. OPODIS 2021: 29:1-29:17 - [c58]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 - [i13]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
- [c54]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 - 2019
- [i7]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) - 2018
- [j25]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) - [c51]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. PODC 2018: 7-16 - [c49]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating Lock-Freedom from Wait-Freedom. PODC 2018: 41-50 - 2016
- [j21]James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016) - [c43]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC 2016: 257-268 - 2015
- [c41]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS 2015: 31:1-31:16 - [c40]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Trading Fences with RMRs and Separating Memory Models. PODC 2015: 173-182 - 2013
- [c35]Hagit Attiya, Danny Hendler, Smadar Levy:
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. PODC 2013: 220-229 - 2012
- [c32]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - 2011
- [c30]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev:
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. POPL 2011: 487-498 - 2010
- [j8]Hagit Attiya, Danny Hendler:
Time and Space Lower Bounds for Implementations Using k-CAS. IEEE Trans. Parallel Distributed Syst. 21(2): 162-173 (2010) - 2009
- [j6]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov:
The complexity of obstruction-free implementations. J. ACM 56(4): 24:1-24:33 (2009) - 2008
- [c17]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447 - [c15]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226 - 2006
- [c11]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov:
Synchronizing without locks is inherently expensive. PODC 2006: 300-307 - 2005
- [c8]Hagit Attiya, Danny Hendler:
Time and Space Lower Bounds for Implementations Using k-CAS. DISC 2005: 169-183
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint