default search action
Anat Lerner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c10]Andreas Weise, Vered Silber-Varod, Anat Lerner, Julia Hirschberg, Rivka Levitan:
"Talk to me with left, right, and angles": Lexical entrainment in spoken Hebrew dialogue. EACL 2021: 292-299 - [c9]Vered Silber-Varod
, Mária Gósy
Is It a Filler or a Pause? A Quantitative Analysis of Filled Pauses in Hebrew. SPECOM 2021: 638-648 - 2020
- [j10]Anat Lerner, Vered Silber-Varod
Modelling the dynamics of acoustic gaps between speakers during business-to-business sales calls. Int. J. Big Data Intell. 7(4): 177-185 (2020) - [j9]Andreas Weise, Vered Silber-Varod
Entrainment in spoken Hebrew dialogues. J. Phonetics 83: 101005 (2020) - [j8]Vered Silber-Varod
Positioning oneself in different roles: Structural and lexical measures of power relations between speakers in Map Task Corpus. Speech Commun. 117: 1-12 (2020) - [c8]Dima Shulga, Vered Silber-Varod
Toward Explainable Automatic Classification of Children's Speech Disorders. SPECOM 2020: 509-519
2010 – 2019
- 2019
- [c7]Rica Gonen, Anat Lerner
Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space. ADT 2019: 32-48 - [c6]Nehory Carmi, Azaria Cohen, Mireille Avigal, Anat Lerner
A Storyteller's Tale: Literature Audiobooks Genre Classification Using CNN and RNN Architectures. INTERSPEECH 2019: 3387-3390 - 2018
- [c5]Anat Lerner
The Influence of the Interlocutor's Gender on the Speaker's Role Identification. SPECOM 2018: 321-330 - [c4]Vered Silber-Varod
Prosodic Plot of Dialogues: A Conceptual Framework to Trace Speakers' Role. SPECOM 2018: 636-645 - 2017
- [j7]Rica Gonen, Anat Lerner
Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms - Two players case. Comput. 6(2): 183-208 (2017) - 2016
- [j6]Anat Lerner
Efficient Constrained Combinatorial Auctions. IGTR 18(3): 1650007:1-1650007:10 (2016) - 2015
- [j5]Anat Lerner
Autocratic Mechanisms: A Form of Dictatorship in Constrained Combinatorial Auctions. IGTR 17(4): 1550010:1-1550010:25 (2015) - 2014
- [j4]Anat Lerner
Characterizing the Incentive Compatible and Pareto Optimal Efficiency Space for Two Players, k Items, Public Budget and Quasilinear Utilities. Games 5(2): 97-115 (2014) - 2013
- [j3]Rica Gonen, Anat Lerner
The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings. Games 4(4): 690-710 (2013) - [j2]Shimon Avadis, Anat Lerner
MMM: multi-channel TDMA with MPR capabilities for MANETs. Wirel. Networks 19(3): 323-330 (2013)
2000 – 2009
- 2009
- [c3]Eyal Zohar, Anat Lerner
FairE9: Fair File Distribution over Mesh-Only Peer-to-Peer. GLOBECOM 2009: 1-8 - [c2]Anat Lerner
Compass enhanced ORRP for wireless sensor networks. PM2HW2N@MSWiM 2009: 1-8 - 2007
- [c1]Guy Sagy, Anat Lerner:
Chord Rooted Forest Algorithm for Data Grid Search. GCA 2007: 63-69
1980 – 1989
- 1987
- [j1]Imrich Chlamtac, Anat Lerner
Fair Algorithms for Maximal Link Activation in Multihop Radio Networks. IEEE Trans. Commun. 35(7): 739-746 (1987)
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-24 23:09 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: