Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLihi Naamani Dery
Person information
- unicode name: ליהי דראי
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Haya Brama, Lihi Dery, Tal Grinshpoun:
Evaluation of neural networks defenses and attacks using NDCG and reciprocal rank metrics. Int. J. Inf. Sec. 22(2): 525-540 (2023)- [i10]Ilya Khakhiashvili, Lihi Dery, Tal Grinshpoun:
Distributed course allocation with asymmetric friendships. CoRR abs/2309.09684 (2023) - 2022
- [c11]Marina Bannikova, Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Reaching Consensus Under a Deadline. AAMAS 2022: 1920-1922 - [i9]Haya Brama, Lihi Dery, Tal Grinshpoun:
Evaluation of Neural Networks Defenses and Attacks using NDCG and Reciprocal Rank Metrics. CoRR abs/2201.05071 (2022) - [i8]Tamir Tassa, Lihi Dery:
Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules. CoRR abs/2205.10580 (2022) - [i7]Lihi Dery:
Ratings to Ranking: Preference Elicitation and Aggregation for Student Peer Assessment. CoRR abs/2212.13774 (2022) - 2021
- [j9]Marina Bannikova, Lihi Dery
, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Reaching consensus under a deadline. Auton. Agents Multi Agent Syst. 35(1): 9 (2021) - [j8]Lihi Dery, Tamir Tassa, Avishay Yanai:
Fear not, vote truthfully: Secure Multiparty Computation of score based rules. Expert Syst. Appl. 168: 114434 (2021) - [j7]Lihi Dery, Artyom Jelnov:
Privacy-Accuracy Consideration in Devices That Collect Sensor-Based Information. Sensors 21(14): 4684 (2021) - [c10]Lihi Dery, Tamir Tassa, Avishay Yanai, Arthur Zamarin:
DEMO: A Secure Voting System for Score Based Elections. CCS 2021: 2399-2401 - [c9]Ilya Khakhiashvili, Tal Grinshpoun, Lihi Dery:
Course Allocation with Friendships as an Asymmetric Distributed Constraint Optimization Problem. WI/IAT 2021: 688-693 - [i6]Lihi Dery:
Multi-label Ranking: Mining Multi-label and Label Ranking Data. CoRR abs/2101.00583 (2021) - 2020
- [j6]Lihi Dery, Erez Shmueli:
BoostLR: A Boosting-Based Learning Ensemble for Label Ranking Tasks. IEEE Access 8: 176023-176032 (2020) - [i5]Lihi Dery, Erez Shmueli:
Improving Label Ranking Ensembles using Boosting Techniques. CoRR abs/2001.07744 (2020)
2010 – 2019
- 2019
- [j5]Havi Werbin-Ofir, Lihi Dery, Erez Shmueli:
Beyond majority: Label ranking ensembles based on voting rules. Expert Syst. Appl. 136: 50-61 (2019) - [i4]Lihi Dery, Tamir Tassa:
Secure Voting Protocols with Perfect Ballot Secrecy. CoRR abs/1903.06472 (2019) - [i3]Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Meir Kalech:
Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation Process. CoRR abs/1905.04933 (2019) - [i2]Marina Bannikova, Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Between Discord and Deadlock: Consensus Under a Deadline. CoRR abs/1905.07173 (2019) - [i1]Lihi Dery, Dror Hermel, Artyom Jelnov:
Cheating in Ranking Systems. CoRR abs/1905.09116 (2019) - 2017
- [c8]David Ben Yosef, Lihi Naamani Dery, Svetlana Obraztsova, Zinovi Rabinovich, Marina Bannikova:
Haste makes waste: a case to favour voting bots. WI 2017: 419-425 - 2016
- [j4]Lihi Naamani Dery, Meir Kalech, Lior Rokach, Bracha Shapira:
Reducing preference elicitation in group decision making. Expert Syst. Appl. 61: 246-261 (2016) - 2015
- [c7]Lihi Naamani Dery, Svetlana Obraztsova, Zinovi Rabinovich, Meir Kalech:
Lie on the Fly: Iterative Voting Center with Manipulative Voters. IJCAI 2015: 2033-2039 - 2014
- [j3]Lihi Naamani Dery, Meir Kalech, Lior Rokach, Bracha Shapira:
Reaching a joint decision with minimal elicitation of voter preferences. Inf. Sci. 278: 466-487 (2014) - [c6]Lihi Naamani Dery, Inon Golan, Meir Kalech, Lior Rokach:
Preference Elicitation for Group Decisions. GDN 2014: 193-200 - [c5]Lihi Naamani Dery, Meir Kalech, Lior Rokach, Bracha Shapira:
Preference elicitation for narrowing the recommended list for groups. RecSys 2014: 333-336 - 2012
- [c4]Lihi Naamani Dery:
Iterative Voting under Uncertainty for Group Recommender Systems (Research Abstract). AAAI 2012: 2400-2401 - 2010
- [c3]Lihi Naamani Dery, Meir Kalech, Lior Rokach, Bracha Shapira:
Iterative voting under uncertainty for group recommender systems. RecSys 2010: 265-268
2000 – 2009
- 2009
- [j2]Lior Rokach, Lihi Naamani, Armin Shmilovici:
Active learning using pessimistic expectation estimators. Control. Cybern. 38(1): 261-280 (2009) - 2008
- [j1]Lior Rokach, Lihi Naamani, Armin Shmilovici:
Pessimistic cost-sensitive active learning of decision trees for profit maximizing targeting campaigns. Data Min. Knowl. Discov. 17(2): 283-316 (2008) - 2007
- [c2]David Ben-Shimon, Alexander Tsikinovsky, Lior Rokach, Amnon Meisels, Guy Shani, Lihi Naamani:
Recommender System from Personal Social Networks. AWIC 2007: 47-55 - [c1]Guy Shani, Lior Rokach, Amnon Meisels, Lihi Naamani, Nischal M. Piratla, David Ben-Shimon:
Establishing User Profiles in the MediaScout Recommender System. CIDM 2007: 470-476
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-04-25 05:52 CEST 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:
