default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShirin Saeedi Bidokhti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti:
Group Testing with General Correlation Using Hypergraphs. ISIT 2024: 3225-3230- [i28]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding. CoRR abs/2403.07320 (2024) - [i27]Xingran Chen, Navid Naderializadeh, Alejandro Ribeiro, Shirin Saeedi Bidokhti:
Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks. CoRR abs/2404.03227 (2024) - 2023
- [j12]Xingran Chen, Hesam Nikpey, Jungyeol Kim, Saswati Sarkar, Shirin Saeedi Bidokhti:
Containing a spread through sequential learning: to exploit or to explore? Trans. Mach. Learn. Res. 2023 (2023) - [c34]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
On a Relation Between the Rate-Distortion Function and Optimal Transport. Tiny Papers @ ICLR 2023 - [c33]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Federated Neural Compression Under Heterogeneous Data. ISIT 2023: 525-530 - [c32]Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti:
Compression with Unlabeled Graph Side Information. ISIT 2023: 713-718 - [i26]Xingran Chen, Hesam Nikpey, Jungyeol Kim, Saswati Sarkar, Shirin Saeedi Bidokhti:
Containing a spread through sequential learning: to exploit or to explore? CoRR abs/2303.00141 (2023) - [i25]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Federated Neural Compression Under Heterogeneous Data. CoRR abs/2305.16416 (2023) - [i24]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
On a Relation Between the Rate-Distortion Function and Optimal Transport. CoRR abs/2307.00246 (2023) - [i23]Eric Lei, Yigit Berkay Uslu, Hamed Hassani, Shirin Saeedi Bidokhti:
Text + Sketch: Image Compression at Ultra Low Rates. CoRR abs/2307.01944 (2023) - 2022
- [j11]Eric Lei
, Hamed Hassani, Shirin Saeedi Bidokhti:
Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding. IEEE J. Sel. Areas Inf. Theory 3(4): 674-686 (2022) - [j10]Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti:
Age of Information in Random Access Channels. IEEE Trans. Inf. Theory 68(10): 6548-6568 (2022) - [c31]Raghu Arghal, Shirin Saeedi Bidokhti, Saswati Sarkar:
Optimal Capacity-Constrained COVID-19 Vaccination for Heterogeneous Populations. CDC 2022: 5620-5626 - [c30]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Neural Estimation of the Rate-Distortion Function for Massive Datasets. ISIT 2022: 608-613 - [c29]Hesam Nikpey, Jungyeol Kim, Xingran Chen, Saswati Sarkar, Shirin Saeedi Bidokhti:
Group Testing with Correlation via Edge-Faulty Graphs. ISIT 2022: 880-885 - [c28]Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai Shitz:
Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations. ISIT 2022: 3031-3036 - [c27]Raghu Arghal, Eric Lei, Shirin Saeedi Bidokhti:
Robust Graph Neural Networks via Probabilistic Lipschitz Constraints. L4DC 2022: 1073-1085 - [i22]Hesam Nikpey, Jungyeol Kim, Xingran Chen, Saswati Sarkar, Shirin Saeedi Bidokhti:
Group Testing with Correlation under Edge-Faulty Graphs. CoRR abs/2202.02467 (2022) - [i21]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding. CoRR abs/2204.01612 (2022) - [i20]Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai:
Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations. CoRR abs/2205.01748 (2022) - 2021
- [c26]Xingran Chen, Xinyu Liao, Shirin Saeedi Bidokhti:
Real-time Sampling and Estimation on Random Access Channels: Age of Information and Beyond. INFOCOM 2021: 1-10 - [c25]Shirin Saeedi Bidokhti, Aylin Yener:
On the Timeliness of Arithmetic Coding. ISIT 2021: 2304-2309 - [c24]Xingran Chen, Renpu Liu, Shaochong Wang, Shirin Saeedi Bidokhti:
Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs. ISIT 2021: 3127-3132 - [i19]Xingran Chen, Renpu Liu, Shaochong Wang, Shirin Saeedi Bidokhti:
Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs. CoRR abs/2102.08926 (2021) - [i18]Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Out-of-Distribution Robustness in Deep Learning Compression. CoRR abs/2110.07007 (2021) - [i17]Raghu Arghal, Eric Lei, Shirin Saeedi Bidokhti:
Robust Graph Neural Networks via Probabilistic Lipschitz Constraints. CoRR abs/2112.07575 (2021) - 2020
- [c23]Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti:
Age of Information in Random Access Channels. ISIT 2020: 1770-1775 - [i16]Xingran Chen, Xinyu Liao, Shirin Saeedi Bidokhti:
Remote Estimation in Decentralized Random Access Channels. CoRR abs/2007.03652 (2020)
2010 – 2019
- 2019
- [j9]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Benefits of Cache Assignment on Degraded Broadcast Channels. IEEE Trans. Inf. Theory 65(11): 6999-7019 (2019) - [c22]Mohammad Fereydounian, Xingran Chen, Hamed Hassani, Shirin Saeedi Bidokhti:
Non-asymptotic Coded Slotted ALOHA. ISIT 2019: 111-115 - [c21]Xingran Chen, Shirin Saeedi Bidokhti:
Benefits of Coding on Age of Information in Broadcast Networks. ITW 2019: 1-5 - [i15]Xingran Chen, Shirin Saeedi Bidokhti:
Benefits of Coding on Age of Information in Broadcast Networks. CoRR abs/1904.10077 (2019) - [i14]Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti:
Age of Information in Random Access Channels. CoRR abs/1912.01473 (2019) - 2018
- [j8]Roy Timo, Shirin Saeedi Bidokhti, Michèle A. Wigger, Bernhard C. Geiger:
A Rate-Distortion Approach to Caching. IEEE Trans. Inf. Theory 64(3): 1957-1976 (2018) - [j7]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory. IEEE Trans. Inf. Theory 64(7): 5042-5069 (2018) - [j6]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
Noisy Broadcast Networks With Receiver Caching. IEEE Trans. Inf. Theory 64(11): 6996-7016 (2018) - [j5]Chien-Yi Wang, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Improved Converses and Gap Results for Coded Caching. IEEE Trans. Inf. Theory 64(11): 7051-7062 (2018) - [c20]Kedar Tatwawadi, Shirin Saeedi Bidokhti, Tsachy Weissman:
On Universal Compression with Constant Random Access. ISIT 2018: 891-895 - [i13]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener, Abbas El Gamal:
State-Adaptive Coded Caching for Symmetric Broadcast Channels. CoRR abs/1802.00319 (2018) - 2017
- [j4]Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai:
Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks. Entropy 19(11): 610 (2017) - [c19]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener, Abbas El Gamal:
State-adaptive coded caching for symmetric broadcast channels. ACSSC 2017: 646-650 - [c18]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Gaussian broadcast channels with receiver cache assignment. ICC 2017: 1-6 - [c17]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Benefits of cache assignment on degraded broadcast channels. ISIT 2017: 1222-1226 - [c16]Amos Lapidoth, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Dependence balance in multiple access channels with correlated sources. ISIT 2017: 1663-1667 - [c15]Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai Shitz:
Capacity bounds on the downlink of symmetric, multi-relay, single receiver C-RAN networks. ISIT 2017: 2058-2062 - [c14]Chien-Yi Wang, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Improved converses and gap-results for coded caching. ISIT 2017: 2428-2432 - [i12]Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai:
Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single Receiver C-RAN Networks. CoRR abs/1702.01828 (2017) - [i11]Chien-Yi Wang, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Improved Converses and Gap-Results for Coded Caching. CoRR abs/1702.04834 (2017) - [i10]Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Benefits of Cache Assignment on Degraded Broadcast Channels. CoRR abs/1702.08044 (2017) - 2016
- [j3]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
Capacity Results for Multicasting Nested Message Sets Over Combination Networks. IEEE Trans. Inf. Theory 62(9): 4968-4992 (2016) - [j2]Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel. IEEE Trans. Inf. Theory 62(12): 7103-7122 (2016) - [c13]Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel. ISIT 2016: 1665-1669 - [c12]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
Erasure broadcast networks with receiver caching. ISIT 2016: 1819-1823 - [c11]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
An upper bound on the capacity-memory tradeoff of degraded broadcast channels. ISTC 2016: 350-354 - [i9]Shirin Saeedi Bidokhti, Michèle Angela Wigger, Roy Timo:
Noisy Broadcast Networks with Receiver Caching. CoRR abs/1605.02317 (2016) - [i8]Roy Timo, Shirin Saeedi Bidokhti, Michèle A. Wigger, Bernhard C. Geiger:
A Rate-Distortion Approach to Caching. CoRR abs/1610.07304 (2016) - [i7]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Erasure Channels with Feedback and Memory. CoRR abs/1612.01487 (2016) - 2015
- [c10]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity regions of two-user broadcast erasure channels with feedback and hidden memory. ISIT 2015: 406-410 - [i6]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory. CoRR abs/1506.07198 (2015) - [i5]Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity Bounds for Diamond Networks with an Orthogonal Broadcast Channel. CoRR abs/1510.00994 (2015) - 2014
- [j1]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran:
Is Non-Unique Decoding Necessary? IEEE Trans. Inf. Theory 60(5): 2594-2610 (2014) - [c9]Michael Heindlmaier, Navid Reyhanian, Shirin Saeedi Bidokhti:
On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory. Allerton 2014: 191-198 - [c8]Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity bounds for a class of diamond networks. ISIT 2014: 1196-1200 - [c7]Shirin Saeedi Bidokhti, Gerhard Kramer:
An application of a wringing lemma to the multiple access channel with cooperative encoders. IWCIT 2014: 1-4 - [i4]Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity Bounds for a Class of Diamond Networks. CoRR abs/1401.6135 (2014) - [i3]Michael Heindlmaier, Navid Reyhanian, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Packet Erasure Channels with Feedback and Memory. CoRR abs/1410.0380 (2014) - [i2]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
Capacity Results for Multicasting Nested Message Sets over Combination Networks. CoRR abs/1411.2417 (2014) - 2013
- [c6]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
A block Markov encoding scheme for broadcasting nested message sets. ISIT 2013: 2975-2979 - [i1]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran:
Is Non-Unique Decoding Necessary? CoRR abs/1312.4378 (2013) - 2012
- [b1]Shirin Saeedi Bidokhti:
Broadcasting and Multicasting Nested Message Sets. EPFL, Switzerland, 2012 - [c5]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
Is non-unique decoding necessary? ISIT 2012: 398-402 - [c4]Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
On multicasting nested message sets over combination networks. ITW 2012: 372-376 - [c3]Marios Gatzianas, Shirin Saeedi Bidokhti, Christina Fragouli:
Feedback-based coding algorithms for broadcast erasure channels with degraded message sets. NetCod 2012: 108-113 - 2011
- [c2]Shirin Saeedi Bidokhti, Christina Fragouli:
Degraded two-message multicast over graphs. ISIT 2011: 1703-1707
2000 – 2009
- 2007
- [c1]Márk Félegyházi, Mario Cagalj, Shirin Saeedi Bidokhti, Jean-Pierre Hubaux:
Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks. INFOCOM 2007: 1442-1450
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-10-13 18:00 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:
