Sarel Cohen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sarel Cohen has a total of 89 co-authors. Here are the top co-authors by number of shared publications:
- Tobias Friedrich
Hasso Plattner Institute, University of Potsdam, Potsdam, Germany
16 shared publications - Davide Bilò
University of L'Aquila
7 shared publications - Daniel Waddington
IBM Research, Almaden, USA
5 shared publications - Keerti Choudhary
Department of Computer Science and Engineering Indian Institute of Technology Delhi India
5 shared publications - Martin Schirneck
University of Vienna
4 shared publications - Moshik Hershcovitch
IBM Research
4 shared publications
Latest Publications
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 158
Hackaveret Mentor: A Citation-Grounded RAG System that Generates Personalized Action Plans for Social Entrepreneurs
We present Hackaveret Mentor, a deployed retrieval-augmented generation (RAG) system that turns a curated multilingual (Hebrew/English) corpus of 175+ social-entrepreneurship documents into a personalized, citation-grounded action plan. Each conversational turn issues exactly one LLM call returning a discriminated-union verdict—answer, clarify, refuse, or stage-reclassification—plus structured edits to the user's plan: a hierarchical checklist whose every item is traceable to a source document and grounded in retrieved context only. A video of the demonstration is available online.
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 158
Open AccessHackaveret Mentor: A Citation-Grounded RAG System that Generates Personalized Action Plans for Social Entrepreneurs
We present Hackaveret Mentor, a deployed retrieval-augmented generation (RAG) system that turns a curated multilingual (Hebrew/English) corpus of 175+ social-entrepreneurship documents into a personalized, citation-grounded action plan. Each conversational turn issues exactly one LLM call returning a discriminated-union verdict—answer, clarify, refuse, or stage-reclassification—plus structured edits to the user's plan: a hierarchical checklist whose every item is traceable to a source document and grounded in retrieved context only. A video of the demonstration is available online.
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 162
Implementing the Nand2Tetris Hack Computer on the GateMate-EVB-A1 FPGA
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 162
Open AccessImplementing the Nand2Tetris Hack Computer on the GateMate-EVB-A1 FPGA
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 167
Quantum-Inspired Feature Engineering For Logistic Regression
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 167
Open AccessQuantum-Inspired Feature Engineering For Logistic Regression
- Open Access
- 9 May 2026
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 40 (1)
Temporal network creation games: the impact of non-locality and terminals
Our economy, communication, and even our social life crucially depend on networks. These typically emerge from the interaction of many entities, which is why researchers study agent-based models of network formation. In particular, Bilò et al. [1] recently introduced a model where a network is formed by selfish agents corresponding to nodes in a given host network with edges having labels denoting their availability over time. Each agent strategically selects local, i.e., incident, edges to ensure temporal reachability towards everyone at low cost. We explore two novel conceptual features: agents can create non-incident edges, called the global setting , and agents might only want to ensure reachability of a subset of nodes, called the terminal model . For both, we study the existence, structure, and quality of equilibrium networks. For the terminal model, we prove that many properties depend on the number of terminals and we show how to translate equilibrium constructions from the non-terminal model. For the global setting, we show the surprising result that equilibria in the global and the local model are incomparable and we establish a high lower bound on the Price of Anarchy of the global setting that matches the upper bound of the local model. This shows the counter-intuitive fact that allowing agents more flexibility in edge creation does not improve the quality of equilibrium networks. Finally, all of our results hold for the general case where every edge can have multiple labels.
- 9 May 2026
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 40 (1)
Open AccessTemporal network creation games: the impact of non-locality and terminals
Our economy, communication, and even our social life crucially depend on networks. These typically emerge from the interaction of many entities, which is why researchers study agent-based models of network formation. In particular, Bilò et al. [1] recently introduced a model where a network is formed by selfish agents corresponding to nodes in a given host network with edges having labels denoting their availability over time. Each agent strategically selects local, i.e., incident, edges to ensure temporal reachability towards everyone at low cost. We explore two novel conceptual features: agents can create non-incident edges, called the global setting , and agents might only want to ensure reachability of a subset of nodes, called the terminal model . For both, we study the existence, structure, and quality of equilibrium networks. For the terminal model, we prove that many properties depend on the number of terminals and we show how to translate equilibrium constructions from the non-terminal model. For the global setting, we show the surprising result that equilibria in the global and the local model are incomparable and we establish a high lower bound on the Price of Anarchy of the global setting that matches the upper bound of the local model. This shows the counter-intuitive fact that allowing agents more flexibility in edge creation does not improve the quality of equilibrium networks. Finally, all of our results hold for the general case where every edge can have multiple labels.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 530-532
Creative Foraging Game with AI: How Humans and AI Explore and Exploit Together
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 530-532
Open AccessCreative Foraging Game with AI: How Humans and AI Explore and Exploit Together
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 225
FocusFlow: A Real-Time Engagement System Enabled by Client-Side Inference
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 225
Open AccessFocusFlow: A Real-Time Engagement System Enabled by Client-Side Inference
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 224
VisVec: A Milestone Towards Compressing Images by Converting Them to SVG using LLMs
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 224
Open AccessVisVec: A Milestone Towards Compressing Images by Converting Them to SVG using LLMs
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 223
AURA: Automated Updates And Repository Assistant
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 223
Open AccessAURA: Automated Updates And Repository Assistant
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Text Image Super-Resolution for Improved OCR in Real-Life Scenarios using Swin Transformers
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessText Image Super-Resolution for Improved OCR in Real-Life Scenarios using Swin Transformers
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (25) , 26463-26471
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
We design sensitivity oracles for error-prone networks. For a network problem Π, the data structure preprocesses a network G=(V,E) and sensitivity parameter f such that, for any set F of up to f link or node failures, it can report the solution of Π in G-F. We study three network problems Π. - L-Hop Shortest Path: Given s,t in V, is there a shortest s-t-path in G-F with at most L links? - k-Path: Does G-F contain a simple path with k links? - k-Clique: Does G-F contain a clique of k nodes? Our main technical contribution is a new construction of (L,f)-replacement path coverings ((L,f)-RPC) in the parameter realm where f = o(log L). An (L,f)-RPC is a family G' of subnetworks of G which, for every set F of at most f links, has a subfamily G'_F such that (i) no subnetwork in G'_F contains a link of F and (ii) for each s,t in V, if G-F contains a shortest s-t-path with at most L links, then some subnetwork in G'_F retains at least one such path. Our (L,f)-RPC has almost the same size as the one by Weimann and Yuster (2013) but it improves the time to query G'_F from Õ(f^2 L^f) to Õ(f^(5/2) L^o(1)). It also improves over the size and query time of the (L,f)-RPC by Karthik and Parter (2021) by nearly a factor of L. From this construction, we derive oracles for L-Hop Shortest Path, k-Path, and k-Clique. Notably, our solution for k-Path improves the query time of the one by Bilò for f=o(log k).
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (25) , 26463-26471
Open AccessEfficient Fault-Tolerant Search by Fast Indexing of Subnetworks
We design sensitivity oracles for error-prone networks. For a network problem Π, the data structure preprocesses a network G=(V,E) and sensitivity parameter f such that, for any set F of up to f link or node failures, it can report the solution of Π in G-F. We study three network problems Π. - L-Hop Shortest Path: Given s,t in V, is there a shortest s-t-path in G-F with at most L links? - k-Path: Does G-F contain a simple path with k links? - k-Clique: Does G-F contain a clique of k nodes? Our main technical contribution is a new construction of (L,f)-replacement path coverings ((L,f)-RPC) in the parameter realm where f = o(log L). An (L,f)-RPC is a family G' of subnetworks of G which, for every set F of at most f links, has a subfamily G'_F such that (i) no subnetwork in G'_F contains a link of F and (ii) for each s,t in V, if G-F contains a shortest s-t-path with at most L links, then some subnetwork in G'_F retains at least one such path. Our (L,f)-RPC has almost the same size as the one by Weimann and Yuster (2013) but it improves the time to query G'_F from Õ(f^2 L^f) to Õ(f^(5/2) L^o(1)). It also improves over the size and query time of the (L,f)-RPC by Karthik and Parter (2021) by nearly a factor of L. From this construction, we derive oracles for L-Hop Shortest Path, k-Path, and k-Clique. Notably, our solution for k-Path improves the query time of the one by Bilò for f=o(log k).