Nachshon Cohen

Orcid: 0000-0001-8302-2739

According to our database1, Nachshon Cohen authored at least 32 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
POSTER: RELAX: Durable Data Structures with Swift Recovery.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

InDi: Informative and Diverse Sampling for Dense Retrieval.
Proceedings of the Advances in Information Retrieval, 2024

2023
Multi Document Summarization Evaluation in the Presence of Damaging Content.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

2022
IR Evaluation and Learning in the Presence of Forbidden Documents.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

SDR: Efficient Neural Re-ranking using Succinct Document Representation.
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2022

2021
WikiSum: Coherent Summarization Dataset for Efficient Human-Evaluation.
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, 2021

2020
Voice-based Reformulation of Community Answers.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019
Efficient lock-free durable sets.
Proc. ACM Program. Lang., 2019

OneFile: A Wait-Free Persistent Transactional Memory.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

Fine-Grain Checkpointing with In-Cache-Line Logging.
Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 2019

2018
Object-oriented recovery for non-volatile memory.
Proc. ACM Program. Lang., 2018

Every data structure deserves lock-free memory reclamation.
Proc. ACM Program. Lang., 2018

Approximating Steiner trees and forests with minimum number of Steiner points.
J. Comput. Syst. Sci., 2018

The Inherent Cost of Remembering Consistently.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Reducing transaction aborts by looking to the future.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

2017
Limitations of Partial Compaction: Towards Practical Bounds.
ACM Trans. Program. Lang. Syst., 2017

Efficient logging in non-volatile memory by exploiting coherency protocols.
Proc. ACM Program. Lang., 2017

POSTER: A GPU-Friendly Skiplist Algorithm.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

POSTER: State Teleportation via Hardware Transactional Memory.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

The Teleportation Design Pattern for Hardware Transactional Memory.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

A GPU-Friendly Skiplist Algorithm.
Proceedings of the 26th International Conference on Parallel Architectures and Compilation Techniques, 2017

2016
Memory Management: From Theory to Practice.
PhD thesis, 2016

CBPQ: High Performance Lock-Free Priority Queue.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Approximating minimum power edge-multi-covers.
J. Comb. Optim., 2015

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Automatic memory reclamation for lock-free data structures.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

Data structure aware garbage collector.
Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, 2015

2013
A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius.
Theor. Comput. Sci., 2013

Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
CoRR, 2013

2011
Approximating minimum-power edge-multicovers
CoRR, 2011

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011


  Loading...