default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrgad Keller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Lior Shani, Aviv Rosenberg, Asaf B. Cassel, Oran Lang, Daniele Calandriello, Avital Zipori, Hila Noga, Orgad Keller, Bilal Piot, Idan Szpektor, Avinatan Hassidim, Yossi Matias, Rémi Munos:
Multi-turn Reinforcement Learning from Preference Human Feedback. CoRR abs/2405.14655 (2024)- [i7]Omer Nahum, Nitay Calderon, Orgad Keller, Idan Szpektor, Roi Reichart:
Are LLMs Better than Reported? Detecting Label Errors and Mitigating Their Effect on Model Performance. CoRR abs/2410.18889 (2024) - 2023
- [j6]Zorik Gekhman, Nadav Oved, Orgad Keller, Idan Szpektor, Roi Reichart:
On the Robustness of Dialogue History Representation in Conversational Question Answering: A Comprehensive Study and a New Prompt-based Method. Trans. Assoc. Comput. Linguistics 11: 351-366 (2023) - [c12]Paul Roit, Johan Ferret, Lior Shani, Roee Aharoni, Geoffrey Cideron, Robert Dadashi, Matthieu Geist, Sertan Girgin, Léonard Hussenot, Orgad Keller, Nikola Momchev, Sabela Ramos Garea, Piotr Stanczyk, Nino Vieillard, Olivier Bachem, Gal Elidan, Avinatan Hassidim, Olivier Pietquin, Idan Szpektor:
Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback. ACL (1) 2023: 6252-6272 - [i6]Paul Roit, Johan Ferret, Lior Shani, Roee Aharoni, Geoffrey Cideron, Robert Dadashi, Matthieu Geist, Sertan Girgin, Léonard Hussenot, Orgad Keller, Nikola Momchev, Sabela Ramos, Piotr Stanczyk, Nino Vieillard, Olivier Bachem, Gal Elidan, Avinatan Hassidim, Olivier Pietquin, Idan Szpektor:
Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback. CoRR abs/2306.00186 (2023) - 2022
- [i5]Zorik Gekhman, Nadav Oved, Orgad Keller, Idan Szpektor, Roi Reichart:
On the Robustness of Dialogue History Representation in Conversational Question Answering: A Comprehensive Study and a New Prompt-based Method. CoRR abs/2206.14796 (2022) - [i4]Deborah Cohen, Moonkyung Ryu, Yinlam Chow, Orgad Keller, Ido Greenberg, Avinatan Hassidim, Michael Fink, Yossi Matias, Idan Szpektor, Craig Boutilier, Gal Elidan:
Dynamic Planning in Open-Ended Dialogue using Reinforcement Learning. CoRR abs/2208.02294 (2022) - 2021
- [c11]Avishai Zagoury, Orgad Keller, Avinatan Hassidim, Noam Hazon:
Targeted Negative Campaigning: Complexity and Approximations. AAAI 2021: 5768-5778 - 2020
- [c10]Eyal Ben-David, Orgad Keller, Eric Malmi, Idan Szpektor, Roi Reichart:
Semantically Driven Sentence Fusion: Modeling and Evaluation. EMNLP (Findings) 2020: 1491-1505 - [c9]Idan Szpektor, Deborah Cohen, Gal Elidan, Michael Fink, Avinatan Hassidim, Orgad Keller, Sayali Kulkarni, Eran Ofek, Sagie Pudinsky, Asaf Revach, Shimi Salant, Yossi Matias:
Dynamic Composition for Conversational Domain Exploration. WWW 2020: 872-883 - [i3]Eyal Ben-David, Orgad Keller, Eric Malmi, Idan Szpektor, Roi Reichart:
Semantically Driven Sentence Fusion: Modeling and Evaluation. CoRR abs/2010.02592 (2020)
2010 – 2019
- 2019
- [j5]Orgad Keller, Avinatan Hassidim, Noam Hazon
:
New Approximations for Coalitional Manipulation in Scoring Rules. J. Artif. Intell. Res. 64: 109-145 (2019) - [j4]Orgad Keller, Avinatan Hassidim, Noam Hazon:
Approximating Weighted and Priced Bribery in Scoring Rules. J. Artif. Intell. Res. 66: 1057-1098 (2019) - 2018
- [c8]Orgad Keller, Avinatan Hassidim, Noam Hazon:
Approximating Bribery in Scoring Rules. AAAI 2018: 1121-1129 - [c7]Raphael Cohen, Orgad Keller, Jason Levy, Russell Levy, Micha Breakstone, Amit Ashkenazi:
Fully Automatic Speaker Separation System, with Automatic Enrolling of Recurrent Speakers. INTERSPEECH 2018: 1964-1965 - 2017
- [c6]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximation for Borda Coalitional Manipulation. AAMAS 2017: 606-614 - [i2]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximations for Coalitional Manipulation in General Scoring Rules. CoRR abs/1708.04862 (2017) - 2014
- [j3]Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein:
Generalized substring compression. Theor. Comput. Sci. 525: 42-54 (2014) - 2013
- [c5]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. WADS 2013: 390-401 - [i1]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. CoRR abs/1307.2415 (2013) - 2011
- [j2]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - 2010
- [c4]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405
2000 – 2009
- 2009
- [j1]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the longest common parameterized subsequence. Theor. Comput. Sci. 410(51): 5347-5353 (2009) - [c3]Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein:
Generalized Substring Compression. CPM 2009: 26-38 - 2008
- [c2]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. CPM 2008: 303-315 - 2007
- [c1]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
Range Non-overlapping Indexing and Successive List Indexing. WADS 2007: 625-636
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 2025-01-21 00:04 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:
