default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNachshon Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Nachshon Cohen, Hedda Cohen Indelman, Yaron Fairstein, Guy Kushilevitz:
InDi: Informative and Diverse Sampling for Dense Retrieval. ECIR (3) 2024: 243-258- [c26]Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg:
Evaluating D-MERIT of Partial-annotation on Information Retrieval. EMNLP 2024: 2913-2932 - [c25]Shadi Iskander, Sofia Tolmach, Ori Shapira, Nachshon Cohen, Zohar Karnin:
Quality Matters: Evaluating Synthetic Data for Tool-Using LLMs. EMNLP 2024: 4958-4976 - [c24]Nachshon Cohen, Yaron Fairstein, Guy Kushilevitz:
Extremely efficient online query encoding for dense retrieval. NAACL-HLT (Findings) 2024: 43-50 - [c23]Almog Zur
, Nachshon Cohen, Michal Friedman, Erez Petrank:
POSTER: RELAX: Durable Data Structures with Swift Recovery. PPoPP 2024: 475-476 - [i10]Besnik Fetahu, Nachshon Cohen, Elad Haramaty, Liane Lewin-Eytan, Oleg Rokhlenko, Shervin Malmasi:
Identifying Shopping Intent in Product QA for Proactive Recommendations. CoRR abs/2404.06017 (2024) - [i9]Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg:
Evaluating D-MERIT of Partial-annotation on Information Retrieval. CoRR abs/2406.16048 (2024) - [i8]Shadi Iskander, Nachshon Cohen, Zohar Karnin, Ori Shapira, Sofia Tolmach:
Quality Matters: Evaluating Synthetic Data for Tool-Using LLMs. CoRR abs/2409.16341 (2024) - 2023
- [c22]Avshalom Manevich, David Carmel, Nachshon Cohen, Elad Kravi, Ori Shapira:
Multi Document Summarization Evaluation in the Presence of Damaging Content. EMNLP (Findings) 2023: 1-12 - 2022
- [c21]Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber:
SDR: Efficient Neural Re-ranking using Succinct Document Representation. ACL (1) 2022: 6624-6637 - [c20]David Carmel, Nachshon Cohen, Amir Ingber, Elad Kravi:
IR Evaluation and Learning in the Presence of Forbidden Documents. SIGIR 2022: 556-566 - 2021
- [c19]Nachshon Cohen, Oren Kalinsky, Yftah Ziser, Alessandro Moschitti:
WikiSum: Coherent Summarization Dataset for Efficient Human-Evaluation. ACL/IJCNLP (2) 2021: 212-219 - [i7]Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber:
SDR: Efficient Neural Re-ranking using Succinct Document Representation. CoRR abs/2110.02065 (2021) - 2020
- [c18]Simone Filice, Nachshon Cohen, David Carmel:
Voice-based Reformulation of Community Answers. WWW 2020: 2885-2891
2010 – 2019
- 2019
- [j8]Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank:
Efficient lock-free durable sets. Proc. ACM Program. Lang. 3(OOPSLA): 128:1-128:26 (2019) - [c17]Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus:
Fine-Grain Checkpointing with In-Cache-Line Logging. ASPLOS 2019: 441-454 - [c16]Pedro Ramalhete, Andreia Correia, Pascal Felber, Nachshon Cohen:
OneFile: A Wait-Free Persistent Transactional Memory. DSN 2019: 151-163 - [i6]Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus:
Fine-Grain Checkpointing with In-Cache-Line Logging. CoRR abs/1902.00660 (2019) - [i5]Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank:
Efficient Lock-Free Durable Sets. CoRR abs/1909.02852 (2019) - 2018
- [j7]Nachshon Cohen, Zeev Nutov:
Approximating Steiner trees and forests with minimum number of Steiner points. J. Comput. Syst. Sci. 98: 53-64 (2018) - [j6]Nachshon Cohen:
Every data structure deserves lock-free memory reclamation. Proc. ACM Program. Lang. 2(OOPSLA): 143:1-143:24 (2018) - [j5]Nachshon Cohen, David T. Aksun, James R. Larus:
Object-oriented recovery for non-volatile memory. Proc. ACM Program. Lang. 2(OOPSLA): 153:1-153:22 (2018) - [c15]Nachshon Cohen, Erez Petrank, James R. Larus:
Reducing transaction aborts by looking to the future. PPoPP 2018: 385-386 - [c14]Nachshon Cohen, Rachid Guerraoui, Igor Zablotchi:
The Inherent Cost of Remembering Consistently. SPAA 2018: 259-269 - [i4]Nachshon Cohen:
Every Data Structure Deserves Lock-Free Memory Reclamation. CoRR abs/1808.06348 (2018) - 2017
- [j4]Nachshon Cohen, Michal Friedman, James R. Larus:
Efficient logging in non-volatile memory by exploiting coherency protocols. Proc. ACM Program. Lang. 1(OOPSLA): 67:1-67:24 (2017) - [j3]Nachshon Cohen, Erez Petrank:
Limitations of Partial Compaction: Towards Practical Bounds. ACM Trans. Program. Lang. Syst. 39(1): 2:1-2:44 (2017) - [c13]Nurit Moscovici, Nachshon Cohen, Erez Petrank:
A GPU-Friendly Skiplist Algorithm. PACT 2017: 246-259 - [c12]Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald:
The Teleportation Design Pattern for Hardware Transactional Memory. OPODIS 2017: 10:1-10:16 - [c11]Nachshon Cohen, Arie Tal, Erez Petrank:
Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications. PPoPP 2017: 17-29 - [c10]Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald:
POSTER: State Teleportation via Hardware Transactional Memory. PPoPP 2017: 437-438 - [c9]Nurit Moscovici, Nachshon Cohen, Erez Petrank:
POSTER: A GPU-Friendly Skiplist Algorithm. PPoPP 2017: 449-450 - [i3]Nachshon Cohen, Michal Friedman, James R. Larus:
Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols. CoRR abs/1709.02610 (2017) - 2016
- [b1]Nachshon Cohen:
Memory Management: From Theory to Practice. Technion - Israel Institute of Technology, Israel, 2016 - [c8]Anastasia Braginsky, Nachshon Cohen, Erez Petrank:
CBPQ: High Performance Lock-Free Priority Queue. Euro-Par 2016: 460-474 - 2015
- [j2]Nachshon Cohen, Zeev Nutov:
Approximating minimum power edge-multi-covers. J. Comb. Optim. 30(3): 563-578 (2015) - [c7]Nachshon Cohen, Erez Petrank:
Data structure aware garbage collector. ISMM 2015: 28-40 - [c6]Nachshon Cohen, Erez Petrank:
Automatic memory reclamation for lock-free data structures. OOPSLA 2015: 260-279 - [c5]Nachshon Cohen, Erez Petrank:
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. SPAA 2015: 254-263 - 2014
- [c4]Nachshon Cohen, Zeev Nutov:
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. WAOA 2014: 95-106 - 2013
- [j1]Nachshon Cohen, Zeev Nutov:
A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. 489-490: 67-74 (2013) - [c3]Nachshon Cohen, Erez Petrank:
Limitations of partial compaction: towards practical bounds. PLDI 2013: 309-320 - [i2]Nachshon Cohen, Zeev Nutov:
Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points. CoRR abs/1304.7571 (2013) - 2012
- [c2]Nachshon Cohen, Zeev Nutov:
Approximating Minimum Power Edge-Multi-Covers. CSR 2012: 64-75 - 2011
- [c1]Nachshon Cohen, Zeev Nutov:
A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. APPROX-RANDOM 2011: 147-157 - [i1]Nachshon Cohen, Zeev Nutov:
Approximating minimum-power edge-multicovers. CoRR abs/1107.4893 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
