default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOsama A. Hanna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Osama A. Hanna
, Antonious M. Girgis, Christina Fragouli, Suhas N. Diggavi:
Differentially Private Stochastic Linear Bandits: (Almost) for Free. IEEE J. Sel. Areas Inf. Theory 5: 135-147 (2024)- [c14]Osama A. Hanna, Merve Karakas, Lin Yang, Christina Fragouli:
Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels. AISTATS 2024: 3898-3906 - [c13]Osama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli:
On the Relation Between the Common Information Dimension and Wyner Common Information. ISIT 2024: 2311-2316 - [i11]Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli:
Learning for Bandits under Action Erasures. CoRR abs/2406.18072 (2024) - 2023
- [c12]Xinlin Li, Merve Karakas, Osama A. Hanna, Mehrdad Kiamari, Jared Ray Coleman, Christina Fragouli, Bhaskar Krishnamachari, Gunjan Verma:
Online Allocation of Sensing and Computation in Large Graphs. CIC 2023: 28-34 - [c11]Osama A. Hanna, Lin Yang, Christina Fragouli:
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms. COLT 2023: 1791-1821 - [c10]Osama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli:
Common Information Dimension. ISIT 2023: 406-411 - [c9]Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli:
Multi-Arm Bandits over Action Erasure Channels. ISIT 2023: 1312-1317 - [c8]Xinlin Li, Osama A. Hanna, Christina Fragouli, Suhas N. Diggavi, Gunjan Verma, Joydeep Bhattacharyya:
Feature Compression for Multimodal Multi-Object Tracking. MILCOM 2023: 139-143 - [c7]Osama A. Hanna, Lin Yang, Christina Fragouli:
Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination. NeurIPS 2023 - [i10]Osama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli:
Common Information Dimension. CoRR abs/2305.06469 (2023) - [i9]Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli:
Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels. CoRR abs/2312.14259 (2023) - 2022
- [j4]Osama A. Hanna, Lin F. Yang, Christina Fragouli:
Compression for Multi-Arm Bandits. IEEE J. Sel. Areas Inf. Theory 3(4): 773-788 (2022) - [c6]Osama A. Hanna, Lin Yang, Christina Fragouli:
Solving Multi-Arm Bandit Using a Few Bits of Communication. AISTATS 2022: 11215-11236 - [c5]Osama A. Hanna, Xinlin Li, Christina Fragouli, Suhas N. Diggavi:
Can we break the dependency in distributed detection? ISIT 2022: 2720-2725 - [c4]Osama A. Hanna, Lin Yang, Christina Fragouli:
Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context. NeurIPS 2022 - [i8]Osama A. Hanna, Lin F. Yang, Christina Fragouli:
Learning in Distributed Contextual Linear Bandits Without Sharing the Context. CoRR abs/2206.04180 (2022) - [i7]Osama A. Hanna, Antonious M. Girgis, Christina Fragouli, Suhas N. Diggavi:
Differentially Private Stochastic Linear Bandits: (Almost) for Free. CoRR abs/2207.03445 (2022) - [i6]Osama A. Hanna, Lin F. Yang, Christina Fragouli:
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms. CoRR abs/2211.05632 (2022) - 2021
- [j3]Osama A. Hanna, Yahya H. Ezzeldin, Christina Fragouli, Suhas N. Diggavi:
Quantization of Distributed Data for Learning. IEEE J. Sel. Areas Inf. Theory 2(3): 987-1001 (2021) - [c3]Rasmus Vestergaard, Osama A. Hanna, Linqi Song, Daniel E. Lucani, Christina Fragouli:
On Coded Broadcasting for Wireless Recommendation Systems. ICC 2021: 1-6 - [i5]Osama A. Hanna, Lin F. Yang, Christina Fragouli:
Solving Multi-Arm Bandit Using a Few Bits of Communication. CoRR abs/2111.06067 (2021) - 2020
- [j2]Osama A. Hanna, Yahya H. Ezzeldin, Tara Sadjadpour, Christina Fragouli, Suhas N. Diggavi:
On Distributed Quantization for Classification. IEEE J. Sel. Areas Inf. Theory 1(1): 237-249 (2020) - [i4]Osama A. Hanna, Yahya H. Ezzeldin, Christina Fragouli, Suhas N. Diggavi:
Quantizing data for distributed learning. CoRR abs/2012.07913 (2020)
2010 – 2019
- 2019
- [i3]Osama A. Hanna, Yahya H. Ezzeldin, Tara Sadjadpour, Christina Fragouli, Suhas N. Diggavi:
On Distributed Quantization for Classification. CoRR abs/1911.00216 (2019) - 2018
- [j1]Osama A. Hanna, Mohammed Nafie, Amr El-Keyi:
Cache-Aware Source Coding. IEEE Commun. Lett. 22(6): 1144-1147 (2018) - [c2]Anders E. Kalør, Osama A. Hanna, Petar Popovski:
Random Access Schemes in Wireless Systems with Correlated User Activity. SPAWC 2018: 1-5 - [i2]Anders Ellersgaard Kalør, Osama A. Hanna, Petar Popovski:
Random Access Schemes in Wireless Systems With Correlated User Activity. CoRR abs/1803.03610 (2018) - 2017
- [c1]Osama A. Hanna, Amr El-Keyi, Mohammed Nafie:
Degrees of freedom in cached MIMO relay networks with multiple base stations. IWCMC 2017: 2056-2061 - [i1]Osama A. Hanna, Amr El-Keyi, Mohammed Nafie:
Degrees of Freedom in Cached MIMO Relay Networks With Multiple Base Stations. CoRR abs/1702.05528 (2017)
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-20 22:56 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:
