Nachshon Cohen

According to our database, Nachshon Cohen authored at least 37 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

ChaI-TeA: A Benchmark for Evaluating Autocompletion of Interactions with LLM-based Chatbots.

Shani Goren, Oren Kalinsky, Tomer Stav, Yuri Rapoport, Yaron Fairstein, Ram Yazdi, Nachshon Cohen, Alexander Libov, Guy Kushilevitz

CoRR, 2024

POSTER: RELAX: Durable Data Structures with Swift Recovery.

Almog Zur, Nachshon Cohen, Michal Friedman, Erez Petrank

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

Extremely efficient online query encoding for dense retrieval.

Nachshon Cohen, Yaron Fairstein, Guy Kushilevitz

Proceedings of the Findings of the Association for Computational Linguistics: NAACL 2024, 2024

Identifying Shopping Intent in Product QA for Proactive Recommendations.

Besnik Fetahu, Nachshon Cohen, Elad Haramaty, Liane Lewin-Eytan, Oleg Rokhlenko, Shervin Malmasi

Proceedings of the Advances on Graph-Based Approaches in Information Retrieval, 2024

Evaluating D-MERIT of Partial-annotation on Information Retrieval.

Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg

Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, 2024

Quality Matters: Evaluating Synthetic Data for Tool-Using LLMs.

Shadi Iskander, Sofia Tolmach, Ori Shapira, Nachshon Cohen, Zohar Karnin

Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, 2024

InDi: Informative and Diverse Sampling for Dense Retrieval.

Nachshon Cohen, Hedda Cohen Indelman, Yaron Fairstein, Guy Kushilevitz

Proceedings of the Advances in Information Retrieval, 2024

2023

Multi Document Summarization Evaluation in the Presence of Damaging Content.

Avshalom Manevich, David Carmel, Nachshon Cohen, Elad Kravi, Ori Shapira

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

2022

IR Evaluation and Learning in the Presence of Forbidden Documents.

David Carmel, Nachshon Cohen, Amir Ingber, Elad Kravi

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.

Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber

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.

Nachshon Cohen, Oren Kalinsky, Yftah Ziser, Alessandro Moschitti

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.

Simone Filice, Nachshon Cohen, David Carmel

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019

Efficient lock-free durable sets.

Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank

Proc. ACM Program. Lang., 2019

OneFile: A Wait-Free Persistent Transactional Memory.

Pedro Ramalhete, Andreia Correia, Pascal Felber, Nachshon Cohen

Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

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

Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus

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.

Nachshon Cohen, David T. Aksun, James R. Larus

Proc. ACM Program. Lang., 2018

Every data structure deserves lock-free memory reclamation.

Nachshon Cohen

Proc. ACM Program. Lang., 2018

Approximating Steiner trees and forests with minimum number of Steiner points.

Nachshon Cohen, Zeev Nutov

J. Comput. Syst. Sci., 2018

The Inherent Cost of Remembering Consistently.

Nachshon Cohen, Rachid Guerraoui, Igor Zablotchi

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

Reducing transaction aborts by looking to the future.

Nachshon Cohen, Erez Petrank, James R. Larus

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

2017

Limitations of Partial Compaction: Towards Practical Bounds.

Nachshon Cohen, Erez Petrank

ACM Trans. Program. Lang. Syst., 2017

Efficient logging in non-volatile memory by exploiting coherency protocols.

Nachshon Cohen, Michal Friedman, James R. Larus

Proc. ACM Program. Lang., 2017

POSTER: A GPU-Friendly Skiplist Algorithm.

Nurit Moscovici, Nachshon Cohen, Erez Petrank

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.

Nachshon Cohen, Arie Tal, Erez Petrank

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

POSTER: State Teleportation via Hardware Transactional Memory.

Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

The Teleportation Design Pattern for Hardware Transactional Memory.

Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

A GPU-Friendly Skiplist Algorithm.

Nurit Moscovici, Nachshon Cohen, Erez Petrank

Proceedings of the 26th International Conference on Parallel Architectures and Compilation Techniques, 2017

2016

Memory Management: From Theory to Practice.

Nachshon Cohen

PhD thesis, 2016

CBPQ: High Performance Lock-Free Priority Queue.

Anastasia Braginsky, Nachshon Cohen, Erez Petrank

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

Approximating minimum power edge-multi-covers.

Nachshon Cohen, Zeev Nutov

J. Comb. Optim., 2015

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access.

Nachshon Cohen, Erez Petrank

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Automatic memory reclamation for lock-free data structures.

Nachshon Cohen, Erez Petrank

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

Data structure aware garbage collector.

Nachshon Cohen, Erez Petrank

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.

Nachshon Cohen, Zeev Nutov

Theor. Comput. Sci., 2013

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

Nachshon Cohen, Zeev Nutov

CoRR, 2013

2011

Approximating minimum-power edge-multicovers

Nachshon Cohen, Zeev Nutov

CoRR, 2011

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius.

Nachshon Cohen, Zeev Nutov

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011