E-LIB Suche - Ergebnisse für: Ben-Baruch, Ohad

1

Detectable recovery of lock-free data structures:

, In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,

Attiya, Hagit ; Ben-Baruch, Ohad ; Fatourou, Panagiota.. - p. 262-277 , 2022

Link: https://dl.acm.org/doi/1..

2

The Limits of Helping in Non-volatile Memory Data Structure:

, In: Lecture Notes in Computer Science; Stabilization, Safety, and Security of Distributed Systems,

Ben-Baruch, Ohad ; Ravi, Srivatsan - p. 84-98 , 2022

Link: https://doi.org/10.1007/..

3

Flat-Combining-Based Persistent Data Structures for Non-vol..:

, In: Lecture Notes in Computer Science; Stabilization, Safety, and Security of Distributed Systems,

Rusanovsky, Matan ; Attiya, Hagit ; Ben-Baruch, Ohad... - p. 505-509 , 2021

Link: https://doi.org/10.1007/..

4

Execution of NVRAM Programs with Persistent Stack:

, In: Lecture Notes in Computer Science; Parallel Computing Technologies,

Aksenov, Vitaly ; Ben-Baruch, Ohad ; Hendler, Danny.. - p. 117-131 , 2021

Link: https://doi.org/10.1007/..

5

Tracking in Order to Recover - Detectable Recovery of Lock-..:

, In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,

Attiya, Hagit ; Ben-Baruch, Ohad ; Fatourou, Panagiota.. - p. 503-505 , 2020

Link: https://dl.acm.org/doi/1..

6

Upper and Lower Bounds on the Space Complexity of Detectabl..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,

Ben-Baruch, Ohad ; Hendler, Danny ; Rusanovsky, Matan - p. 11-20 , 2020

Link: https://dl.acm.org/doi/1..

7

Nesting-Safe Recoverable Linearizability : Modular Const..:

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

Attiya, Hagit ; Ben-Baruch, Ohad ; Hendler, Danny - p. 7-16 , 2018

Link: https://dl.acm.org/doi/1..

8

The Price of being Adaptive:

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

Ben-Baruch, Ohad ; Hendler, Danny - p. 183-192 , 2015

Link: https://dl.acm.org/doi/1..

9

Tracking in Order to Recover: Detectable Recovery of Lock-F..:

Attiya, Hagit ; Ben-Baruch, Ohad ; Fatourou, Panagiota..
info:eu-repo/grantAgreement/EC/H2020/101031688/. , 2022

Link: https://zenodo.org/recor..

10

Recoverable and Detectable Fetch&Add:

Nahum, Liad ; Attiya, Hagit ; Ben-Baruch, Ohad.
doi:10.4230/LIPIcs.OPODIS.2021.29. , 2022

Link: https://doi.org/10.4230/..

11

Tracking in Order to Recover: Detectable Recovery of Lock-F..:

Attiya, Hagit ; Ben-Baruch, Ohad ; Fatourou, Panagiota..
info:eu-repo/grantAgreement/EC/H2020/101031688/. , 2022

Link: https://zenodo.org/recor..

12

Execution of NVRAM Programs with Persistent Stack:

Aksenov, Vitaly ; Ben-Baruch, Ohad ; Hendler, Danny..
http://arxiv.org/abs/2105.11932. , 2021

Link: http://arxiv.org/abs/210..

13

Upper and Lower Bounds on the Space Complexity of Detectabl..:

Ben-Baruch, Ohad ; Hendler, Danny ; Rusanovsky, Matan
http://arxiv.org/abs/2002.11378. , 2020

Link: http://arxiv.org/abs/200..

14

Flat-Combining-Based Persistent Data Structures for Non-Vol..:

Rusanovsky, Matan ; Attiya, Hagit ; Ben-Baruch, Ohad...
http://arxiv.org/abs/2012.12868. , 2020

Link: http://arxiv.org/abs/201..

15

Separation and Equivalence results for the Crash-stop and C..:

Ben-Baruch, Ohad ; Ravi, Srivatsan
http://arxiv.org/abs/2012.03692. , 2020

Link: http://arxiv.org/abs/201..