Ohad Ben-Baruch

According to our database, Ohad Ben-Baruch authored at least 16 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Tracking: PPoPP 22 - Detectable Recovery of Lock-Free Data Structures.

Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas

Dataset, January, 2022

The Limits of Helping in Non-volatile Memory Data Structures.

Ohad Ben-Baruch, Srivatsan Ravi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Detectable recovery of lock-free data structures.

Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

2021

PPoPP 22 - Detectable Recovery of Lock-Free Data Structures.

Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas

Dataset, December, 2021

Flat-Combining-Based Persistent Data Structures for Non-volatile Memory.

Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Execution of NVRAM Programs with Persistent Stack.

Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky

Proceedings of the Parallel Computing Technologies, 2021

Recoverable and Detectable Fetch&Add.

Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

A Flat-Combining-Based Persistent Stack for Non-Volatile Memory.

Matan Rusanovsky, Ohad Ben-Baruch, Danny Hendler, Pedro Ramalhete

CoRR, 2020

Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models.

Ohad Ben-Baruch, Srivatsan Ravi

CoRR, 2020

Upper and Lower Bounds on the Space Complexity of Detectable Object.

Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky

CoRR, 2020

Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures.

Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Upper and Lower Bounds on the Space Complexity of Detectable Objects.

Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Tracking in Order to Recover: Recoverable Lock-Free Data Structures.

Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas

CoRR, 2019

2018

Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.

Hagit Attiya, Ohad Ben-Baruch, Danny Hendler

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2016

Lower Bound on the Step Complexity of Anonymous Binary Consensus.

Hagit Attiya, Ohad Ben-Baruch, Danny Hendler

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

The Price of being Adaptive.

Ohad Ben-Baruch, Danny Hendler

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015