( en | de | ru )

 

Disambiguation of "Ben-Baruch, Ohad"

Author of the publication

copydeleteadd this publication to your clipboard
Upper and Lower Bounds on the Space Complexity of Detectable Objects.

, , and . PODC, page 11-20. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Baruch Baruch

Ohad Kammar

Ohad Soudry

Bernhard Baruch

Wolfgang Baruch

 

Other publications of authors with the same name

Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures., , , , and . SPAA, page 503-505. ACM, (2020)Lower Bound on the Step Complexity of Anonymous Binary Consensus., , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 257-268. Springer, (2016)Flat-Combining-Based Persistent Data Structures for Non-volatile Memory., , , , , and . SSS, volume 13046 of Lecture Notes in Computer Science, page 505-509. Springer, (2021)Upper and Lower Bounds on the Space Complexity of Detectable Object., , and . CoRR, (2020)Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory., , and . PODC, page 7-16. ACM, (2018)Upper and Lower Bounds on the Space Complexity of Detectable Objects., , and . PODC, page 11-20. ACM, (2020)Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models., and . CoRR, (2020)A Flat-Combining-Based Persistent Stack for Non-Volatile Memory., , , and . CoRR, (2020)Detectable recovery of lock-free data structures., , , , and . PPoPP, page 262-277. ACM, (2022)Recoverable and Detectable Fetch&Add., , , and . OPODIS, volume 217 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)