E-LIB Suche - Ergebnisse für: Cohen, Nachshon

1

POSTER: RELAX: Durable Data Structures with Swift Recovery:

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

Zur, Almog ; Cohen, Nachshon ; Friedman, Michal. - p. 475-476 , 2024

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

2

InDi: Informative and Diverse Sampling for Dense Retrieval:

, In: Lecture Notes in Computer Science; Advances in Information Retrieval,

Cohen, Nachshon ; Cohen-Indelman, Hedda ; Fairstein, Yaron. - p. 243-258 , 2024

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

3

IR Evaluation and Learning in the Presence of Forbidden Doc..:

, In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval,

Carmel, David ; Cohen, Nachshon ; Ingber, Amir. - p. 556-566 , 2022

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

4

Voice-based Reformulation of Community Answers:

, In: Proceedings of The Web Conference 2020,

Filice, Simone ; Cohen, Nachshon ; Carmel, David - p. 2885-2891 , 2020

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

5

Fine-Grain Checkpointing with In-Cache-Line Logging:

, In: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems,

Cohen, Nachshon ; Aksun, David T. ; Avni, Hillel. - p. 441-454 , 2019

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

6

Efficient lock-free durable sets:

Zuriel, Yoav ; Friedman, Michal ; Sheffi, Gali..
Proceedings of the ACM on Programming Languages. 3 (2019) OOPSLA - p. 1-26 , 2019

Link: https://doi.org/10.1145/..

7

Efficient lock-free durable sets:

Zuriel, Yoav ; Friedman, Michal ; Sheffi, Gali..
Proceedings of the ACM on Programming Languages. 3 (2019) OOPSLA - p. 1-26 , 2019

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

8

Every data structure deserves lock-free memory reclamation:

Cohen, Nachshon
Proceedings of the ACM on Programming Languages. 2 (2018) OOPSLA - p. 1-24 , 2018

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

9

Every data structure deserves lock-free memory reclamation:

Cohen, Nachshon
Proceedings of the ACM on Programming Languages. 2 (2018) OOPSLA - p. 1-24 , 2018

Link: https://doi.org/10.1145/..

10

The Inherent Cost of Remembering Consistently:

, In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures,

Cohen, Nachshon ; Guerraoui, Rachid ; Zablotchi, Igor - p. 259-269 , 2018

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

11

Approximating Steiner trees and forests with minimum number..:

Cohen, Nachshon ; Nutov, Zeev
Journal of Computer and System Sciences. 98 (2018) - p. 53-64 , 2018

Link: https://doi.org/10.1016/..

12

Object-oriented recovery for non-volatile memory:

Cohen, Nachshon ; Aksun, David T. ; Larus, James R.
Proceedings of the ACM on Programming Languages. 2 (2018) OOPSLA - p. 1-22 , 2018

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

13

Reducing transaction aborts by looking to the future:

Cohen, Nachshon ; Petrank, Erez ; Larus, James R.
ACM SIGPLAN Notices. 53 (2018) 1 - p. 385-386 , 2018

Link: https://doi.org/10.1145/..

14

Reducing transaction aborts by looking to the future:

, In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,

Cohen, Nachshon ; Petrank, Erez ; Larus, James R. - p. 385-386 , 2018

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

15

Object-oriented recovery for non-volatile memory:

Cohen, Nachshon ; Aksun, David T. ; Larus, James R.
Proceedings of the ACM on Programming Languages. 2 (2018) OOPSLA - p. 1-22 , 2018

Link: https://doi.org/10.1145/..