Nachshon Cohen

50 papers A* 6A 2B 10C 1Misc 1Journal 19Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Personalized Autocompletion of Interactions with LLM-Based Chatbots. ECIR (2) Shani Goren, Oren Kalinsky, Tomer Stav, Nachshon Cohen, Yuri Rapoport, Yaron Fairstein, Ram Yazdi, Alexander Libov, Guy Kushilevitz
2025	—	`conf`	ChaI-TeA: A Benchmark for Evaluating Autocompletion of Interactions with LLM-based Chatbots. NAACL (Short Papers) Shani Goren, Oren Kalinsky, Tomer Stav, Yuri Rapoport, Yaron Fairstein, Ram Yazdi, Nachshon Cohen, Alexander Libov, Guy Kushilevitz
2024	J	`jnl`	ChaI-TeA: A Benchmark for Evaluating Autocompletion of Interactions with LLM-based Chatbots. CoRR Shani Goren, Oren Kalinsky, Tomer Stav, Yuri Rapoport, Yaron Fairstein, Ram Yazdi, Nachshon Cohen, Alexander Libov, Guy Kushilevitz
2024	A*	`conf`	Evaluating D-MERIT of Partial-annotation on Information Retrieval. EMNLP Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg
2024	J	`jnl`	Evaluating D-MERIT of Partial-annotation on Information Retrieval. CoRR Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg
2024	—	`conf`	Extremely efficient online query encoding for dense retrieval. NAACL-HLT (Findings) Nachshon Cohen, Yaron Fairstein, Guy Kushilevitz
2024	—	`conf`	Identifying Shopping Intent in Product QA for Proactive Recommendations. IRonGraphs Besnik Fetahu, Nachshon Cohen, Elad Haramaty, Liane Lewin-Eytan, Oleg Rokhlenko, Shervin Malmasi
2024	J	`jnl`	Identifying Shopping Intent in Product QA for Proactive Recommendations. CoRR Besnik Fetahu, Nachshon Cohen, Elad Haramaty, Liane Lewin-Eytan, Oleg Rokhlenko, Shervin Malmasi
2024	—	`conf`	InDi: Informative and Diverse Sampling for Dense Retrieval. ECIR (3) Nachshon Cohen, Hedda Cohen Indelman, Yaron Fairstein, Guy Kushilevitz
2024	B	`conf`	POSTER: RELAX: Durable Data Structures with Swift Recovery. PPoPP Almog Zur, Nachshon Cohen, Michal Friedman, Erez Petrank
2024	A*	`conf`	Quality Matters: Evaluating Synthetic Data for Tool-Using LLMs. EMNLP Shadi Iskander, Sofia Tolmach, Ori Shapira, Nachshon Cohen, Zohar S. Karnin
2024	J	`jnl`	Quality Matters: Evaluating Synthetic Data for Tool-Using LLMs. CoRR Shadi Iskander, Nachshon Cohen, Zohar S. Karnin, Ori Shapira, Sofia Tolmach
2023	—	`conf`	Multi Document Summarization Evaluation in the Presence of Damaging Content. EMNLP (Findings) Avshalom Manevich, David Carmel, Nachshon Cohen, Elad Kravi, Ori Shapira
2022	A*	`conf`	IR Evaluation and Learning in the Presence of Forbidden Documents. SIGIR David Carmel, Nachshon Cohen, Amir Ingber, Elad Kravi
2022	—	`conf`	SDR: Efficient Neural Re-ranking using Succinct Document Representation. ACL (1) Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber
2021	J	`jnl`	SDR: Efficient Neural Re-ranking using Succinct Document Representation. CoRR Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber
2021	—	`conf`	WikiSum: Coherent Summarization Dataset for Efficient Human-Evaluation. ACL/IJCNLP (2) Nachshon Cohen, Oren Kalinsky, Yftah Ziser, Alessandro Moschitti
2020	A*	`conf`	Voice-based Reformulation of Community Answers. WWW Simone Filice, Nachshon Cohen, David Carmel
2019	J	`jnl`	Efficient Lock-Free Durable Sets. CoRR Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank
2019	J	`jnl`	Efficient lock-free durable sets. Proc. ACM Program. Lang. Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank
2019	A*	`conf`	Fine-Grain Checkpointing with In-Cache-Line Logging. ASPLOS Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus
2019	J	`jnl`	Fine-Grain Checkpointing with In-Cache-Line Logging. CoRR Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus
2019	A	`conf`	OneFile: A Wait-Free Persistent Transactional Memory. DSN Pedro Ramalhete, Andreia Correia, Pascal Felber, Nachshon Cohen
2018	J	`jnl`	Approximating Steiner trees and forests with minimum number of Steiner points. J. Comput. Syst. Sci. Nachshon Cohen, Zeev Nutov
2018	J	`jnl`	Every Data Structure Deserves Lock-Free Memory Reclamation. CoRR Nachshon Cohen
2018	J	`jnl`	Every data structure deserves lock-free memory reclamation. Proc. ACM Program. Lang. Nachshon Cohen
2018	J	`jnl`	Object-oriented recovery for non-volatile memory. Proc. ACM Program. Lang. Nachshon Cohen, David T. Aksun, James R. Larus
2018	B	`conf`	Reducing transaction aborts by looking to the future. PPoPP Nachshon Cohen, Erez Petrank, James R. Larus
2018	B	`conf`	The Inherent Cost of Remembering Consistently. SPAA Nachshon Cohen, Rachid Guerraoui, Igor Zablotchi
2017	B	`conf`	A GPU-Friendly Skiplist Algorithm. PACT Nurit Moscovici, Nachshon Cohen, Erez Petrank
2017	J	`jnl`	Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols. CoRR Nachshon Cohen, Michal Friedman, James R. Larus
2017	J	`jnl`	Efficient logging in non-volatile memory by exploiting coherency protocols. Proc. ACM Program. Lang. Nachshon Cohen, Michal Friedman, James R. Larus
2017	B	`conf`	Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications. PPoPP Nachshon Cohen, Arie Tal, Erez Petrank
2017	J	`jnl`	Limitations of Partial Compaction: Towards Practical Bounds. ACM Trans. Program. Lang. Syst. Nachshon Cohen, Erez Petrank
2017	B	`conf`	POSTER: A GPU-Friendly Skiplist Algorithm. PPoPP Nurit Moscovici, Nachshon Cohen, Erez Petrank
2017	B	`conf`	POSTER: State Teleportation via Hardware Transactional Memory. PPoPP Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2017	B	`conf`	The Teleportation Design Pattern for Hardware Transactional Memory. OPODIS Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2016	—	`conf`	CBPQ: High Performance Lock-Free Priority Queue. Euro-Par Anastasia Braginsky, Nachshon Cohen, Erez Petrank
2016	—	`—`	Memory Management: From Theory to Practice. Nachshon Cohen
2015	J	`jnl`	Approximating minimum power edge-multi-covers. J. Comb. Optim. Nachshon Cohen, Zeev Nutov
2015	A	`conf`	Automatic memory reclamation for lock-free data structures. OOPSLA Nachshon Cohen, Erez Petrank
2015	C	`conf`	Data structure aware garbage collector. ISMM Nachshon Cohen, Erez Petrank
2015	B	`conf`	Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. SPAA Nachshon Cohen, Erez Petrank
2014	B	`conf`	Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. WAOA Nachshon Cohen, Zeev Nutov
2013	J	`jnl`	A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. Nachshon Cohen, Zeev Nutov
2013	J	`jnl`	Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points CoRR Nachshon Cohen, Zeev Nutov
2013	A*	`conf`	Limitations of partial compaction: towards practical bounds. PLDI Nachshon Cohen, Erez Petrank
2012	Misc	`conf`	Approximating Minimum Power Edge-Multi-Covers. CSR Nachshon Cohen, Zeev Nutov
2011	—	`conf`	A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. APPROX-RANDOM Nachshon Cohen, Zeev Nutov
2011	J	`jnl`	Approximating minimum-power edge-multicovers CoRR Nachshon Cohen, Zeev Nutov