( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Price of being Adaptive.

, и . PODC, стр. 183-192. ACM, (2015)

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.

Baruch Baruch

Ohad Kammar

Ohad Soudry

Bernhard Baruch

Otto Baruch

 

Другие публикации лиц с тем же именем

Lower Bound on the Step Complexity of Anonymous Binary Consensus., , и . DISC, том 9888 из Lecture Notes in Computer Science, стр. 257-268. Springer, (2016)Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures., , , , и . SPAA, стр. 503-505. ACM, (2020)The Limits of Helping in Non-volatile Memory Data Structures., и . SSS, том 13751 из Lecture Notes in Computer Science, стр. 84-98. Springer, (2022)Execution of NVRAM Programs with Persistent Stack., , , , и . PaCT, том 12942 из Lecture Notes in Computer Science, стр. 117-131. Springer, (2021)The Price of being Adaptive., и . PODC, стр. 183-192. ACM, (2015)Tracking in Order to Recover: Recoverable Lock-Free Data Structures., , , , и . CoRR, (2019)Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory., , и . PODC, стр. 7-16. ACM, (2018)Upper and Lower Bounds on the Space Complexity of Detectable Objects., , и . PODC, стр. 11-20. ACM, (2020)A Flat-Combining-Based Persistent Stack for Non-Volatile Memory., , , и . CoRR, (2020)Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models., и . CoRR, (2020)