default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Yemini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Matthew Cavorsi
, Orhan Eren Akgün, Michal Yemini, Andrea J. Goldsmith, Stephanie Gil:
Exploiting Trust for Resilient Hypothesis Testing With Malicious Robots. IEEE Trans. Robotics 40: 3514-3536 (2024)- [j12]Michal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith:
Robust Semi-Decentralized Federated Learning via Collaborative Relaying. IEEE Trans. Wirel. Commun. 23(7): 7520-7536 (2024) - [c14]Luca Ballotta, Michal Yemini:
The Role of Confidence for Trust-Based Resilient Consensus. ACC 2024: 2822-2829 - [i28]Luca Ballotta, Michal Yemini:
The Role of Confidence for Trust-based Resilient Consensus (Extended Version). CoRR abs/2404.07838 (2024) - [i27]Qiang Li, Michal Yemini, Hoi-To Wai:
Clipped SGD Algorithms for Privacy Preserving Performative Prediction: Bias Amplification and Remedies. CoRR abs/2404.10995 (2024) - [i26]Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith, H. Vincent Poor:
Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks. CoRR abs/2406.03766 (2024) - [i25]Arif Kerem Dayi, Orhan Eren Akgün, Stephanie Gil, Michal Yemini, Angelia Nedic:
Fast Distributed Optimization over Directed Graphs under Malicious Attacks using Trust. CoRR abs/2407.06541 (2024) - [i24]Luca Ballotta, Áron Vékássy, Stephanie Gil, Michal Yemini:
Friedkin-Johnsen Model with Diminishing Competition. CoRR abs/2409.12601 (2024) - 2023
- [j11]Nir Weinberger, Michal Yemini:
Multi-Armed Bandits With Self-Information Rewards. IEEE Trans. Inf. Theory 69(11): 7160-7184 (2023) - [j10]Michal Yemini, Stephanie Gil, Andrea J. Goldsmith:
Cloud-Cluster Architecture for Detection in Intermittently Connected Sensor Networks. IEEE Trans. Wirel. Commun. 22(2): 903-919 (2023) - [c13]Matthew Cavorsi, Orhan Eren Akgün, Michal Yemini, Andrea J. Goldsmith, Stephanie Gil:
Exploiting Trust for Resilient Hypothesis Testing with Malicious Robots. ICRA 2023: 7663-7669 - [c12]Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith, H. Vincent Poor:
Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy. ISIT 2023: 174-179 - [i23]Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith, H. Vincent Poor:
Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy. CoRR abs/2303.00035 (2023) - [i22]Matthew Cavorsi, Orhan Eren Akgün, Michal Yemini, Andrea Goldsmith, Stephanie Gil:
Exploiting Trust for Resilient Hypothesis Testing with Malicious Robots (evolved version). CoRR abs/2303.04075 (2023) - [i21]Stephanie Gil, Michal Yemini, Arsenia Chorti, Angelia Nedic, H. Vincent Poor, Andrea J. Goldsmith:
How Physicality Enables Trust: A New Era of Trust-Centered Cyberphysical Systems. CoRR abs/2311.07492 (2023) - 2022
- [j9]Michal Yemini, Angelia Nedic, Andrea J. Goldsmith, Stephanie Gil:
Characterizing Trust and Resilience in Distributed Consensus for Cyberphysical Systems. IEEE Trans. Robotics 38(1): 71-91 (2022) - [j8]Tomer Gafni, Michal Yemini, Kobi Cohen:
Learning in Restless Bandits Under Exogenous Global Markov Process. IEEE Trans. Signal Process. 70: 5679-5693 (2022) - [c11]Michal Yemini, Angelia Nedic, Stephanie Gil, Andrea J. Goldsmith:
Resilience to Malicious Activity in Distributed Optimization for Cyberphysical Systems. CDC 2022: 4185-4192 - [c10]Tomer Gafni, Michal Yemini, Kobi Cohen:
Restless Multi-Armed Bandits under Exogenous Global Markov Process. ICASSP 2022: 5218-5222 - [c9]Michal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith:
Semi-Decentralized Federated Learning with Collaborative Relaying. ISIT 2022: 1471-1476 - [c8]Nir Weinberger, Michal Yemini:
Upper Confidence Interval Strategies for Multi-Armed Bandits with Entropy Rewards. ISIT 2022: 1647-1652 - [i20]Michal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith:
Robust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying. CoRR abs/2202.11850 (2022) - [i19]Tomer Gafni, Michal Yemini, Kobi Cohen:
Restless Multi-Armed Bandits under Exogenous Global Markov Process. CoRR abs/2202.13665 (2022) - [i18]Michal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith:
Semi-Decentralized Federated Learning with Collaborative Relaying. CoRR abs/2205.10998 (2022) - [i17]Nir Weinberger, Michal Yemini:
Multi-Armed Bandits with Self-Information Rewards. CoRR abs/2209.02211 (2022) - [i16]Matthew Cavorsi, Orhan Eren Akgün, Michal Yemini, Andrea Goldsmith, Stephanie Gil:
Exploiting Trust for Resilient Hypothesis Testing with Malicious Robots. CoRR abs/2209.12285 (2022) - [i15]Michal Yemini, Angelia Nedic, Andrea J. Goldsmith, Stephanie Gil:
Resilient Distributed Optimization for Multi-Agent Cyberphysical Systems. CoRR abs/2212.02459 (2022) - 2021
- [j7]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
The Restless Hidden Markov Bandit With Linear Rewards and Side Information. IEEE Trans. Signal Process. 69: 1108-1123 (2021) - [j6]Michal Yemini, Andrea J. Goldsmith:
Virtual Cell Clustering With Optimal Resource Allocation to Maximize Capacity. IEEE Trans. Wirel. Commun. 20(8): 5099-5114 (2021) - [c7]Michal Yemini, Elza Erkip, Andrea J. Goldsmith:
Interference Reduction in Virtual Cell Optimization. ACSCC 2021: 18-25 - [i14]Michal Yemini, Angelia Nedic, Andrea Goldsmith, Stephanie Gil:
Characterizing Trust and Resilience in Distributed Consensus for Cyberphysical Systems. CoRR abs/2103.05464 (2021) - [i13]Michal Yemini, Stephanie Gil, Andrea J. Goldsmith:
Cloud-Cluster Architecture for Detection in Intermittently Connected Sensor Networks. CoRR abs/2110.01119 (2021) - [i12]Tomer Gafni, Michal Yemini, Kobi Cohen:
Learning in Restless Bandits under Exogenous Global Markov Process. CoRR abs/2112.09484 (2021) - 2020
- [c6]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
Restless Hidden Markov Bandit with Linear Rewards. CDC 2020: 1183-1189 - [c5]Michal Yemini, Stephanie Gil, Andrea Goldsmith:
Exploiting Local and Cloud Sensor Fusion in Intermittently Connected Sensor Networks. GLOBECOM 2020: 1-7 - [i11]Michal Yemini, Stephanie Gil, Andrea Goldsmith:
Exploiting Local and Cloud Sensor Fusion in Intermittently Connected Sensor Networks. CoRR abs/2005.12495 (2020) - [i10]Michal Yemini, Elza Erkip, Andrea J. Goldsmith:
Interference Reduction in Virtual Cell Optimization. CoRR abs/2010.16100 (2020)
2010 – 2019
- 2019
- [j5]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
The Simultaneous Connectivity of Cognitive Networks. IEEE Trans. Inf. Theory 65(11): 6911-6930 (2019) - [c4]Michal Yemini, Andrea J. Goldsmith:
Virtual Cell Clustering with Optimal Resource Allocation to Maximize Cellular System Capacity. GLOBECOM 2019: 1-7 - [c3]Michal Yemini, Andrea J. Goldsmith:
Optimal Resource Allocation for Cellular Networks with Virtual Cell Joint Decoding. ISIT 2019: 2519-2523 - [i9]Michal Yemini, Andrea J. Goldsmith:
"Fog" Optimization via Virtual Cells in Cellular Network Resource Allocation. CoRR abs/1901.06669 (2019) - [i8]Michal Yemini, Andrea J. Goldsmith:
Optimal Resource Allocation for Cellular Networks with Virtual Cell Joint Decoding. CoRR abs/1905.02184 (2019) - [i7]Michal Yemini, Andrea J. Goldsmith:
Virtual Cell Clustering with Optimal Resource Allocation to Maximize Cellular System Capacity. CoRR abs/1905.02891 (2019) - [i6]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
Restless Hidden Markov Bandits with Linear Rewards. CoRR abs/1910.10271 (2019) - [i5]Michal Yemini, Andrea J. Goldsmith:
Virtual Cell Clustering with Optimal Resource Allocation to Maximize Capacity. CoRR abs/1911.03436 (2019) - 2017
- [j4]Michal Yemini, Alessio Zappone, Eduard A. Jorswieck, Amir Leshem:
Energy Efficient Bidirectional Massive MIMO Relay Beamforming. IEEE Signal Process. Lett. 24(7): 1010-1014 (2017) - [j3]Amir Leshem, Michal Yemini:
Phase Noise Compensation for OFDM Systems. IEEE Trans. Signal Process. 65(21): 5675-5686 (2017) - [i4]Amir Leshem, Michal Yemini:
Phase Noise Compensation for OFDM Systems. CoRR abs/1708.05443 (2017) - 2016
- [j2]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the Multiple Access Channel With Asynchronous Cognition. IEEE Trans. Inf. Theory 62(10): 5643-5663 (2016) - [c2]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
Simultaneous connectivity in heterogeneous cognitive radio networks. ISIT 2016: 1262-1266 - [i3]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
On Simultaneous Percolation with Two Disk Types. CoRR abs/1601.04471 (2016) - 2015
- [j1]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
Asynchronous Transmission Over Single-User State-Dependent Channels. IEEE Trans. Inf. Theory 61(11): 5854-5867 (2015) - [i2]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the Multiple Access Channel with Asynchronous Cognition. CoRR abs/1503.08413 (2015) - 2014
- [c1]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the asynchronous cognitive MAC. ISIT 2014: 2929-2933 - [i1]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On Channels with Asynchronous Side Information. CoRR abs/1402.1617 (2014)
Coauthor Index
aka: Andrea Goldsmith
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 20:40 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:
