default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOhad Ben-Baruch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c10]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Detectable recovery of lock-free data structures. PPoPP 2022: 262-277- [c9]Ohad Ben-Baruch, Srivatsan Ravi:
The Limits of Helping in Non-volatile Memory Data Structures. SSS 2022: 84-98 - [d2]Hagit Attiya
, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking: PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Zenodo, 2022
- 2021
- [c8]Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Recoverable and Detectable Fetch&Add. OPODIS 2021: 29:1-29:17 - [c7]Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky:
Execution of NVRAM Programs with Persistent Stack. PaCT 2021: 117-131 - [c6]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 - [d1]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Zenodo, 2021 - [i5]Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky:
Execution of NVRAM Programs with Persistent Stack. CoRR abs/2105.11932 (2021) - 2020
- [c5]Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky:
Upper and Lower Bounds on the Space Complexity of Detectable Objects. PODC 2020: 11-20 - [c4]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 - [i4]Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky:
Upper and Lower Bounds on the Space Complexity of Detectable Object. CoRR abs/2002.11378 (2020) - [i3]Ohad Ben-Baruch, Srivatsan Ravi:
Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models. CoRR abs/2012.03692 (2020) - [i2]Matan Rusanovsky, Ohad Ben-Baruch, Danny Hendler, Pedro Ramalhete:
A Flat-Combining-Based Persistent Stack for Non-Volatile Memory. CoRR abs/2012.12868 (2020)
2010 – 2019
- 2019
- [i1]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
- [c3]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. PODC 2018: 7-16 - 2016
- [c2]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC 2016: 257-268 - 2015
- [c1]Ohad Ben-Baruch, Danny Hendler:
The Price of being Adaptive. PODC 2015: 183-192
Coauthor Index
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-10-09 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
