Shirin Saeedi Bidokhti

Orcid: 0000-0002-3790-202X

According to our database1, Shirin Saeedi Bidokhti authored at least 50 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks.
CoRR, 2024

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding.
CoRR, 2024

Group Testing with General Correlation Using Hypergraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Containing a spread through sequential learning: to exploit or to explore?
Trans. Mach. Learn. Res., 2023

Text + Sketch: Image Compression at Ultra Low Rates.
CoRR, 2023

Compression with Unlabeled Graph Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Federated Neural Compression Under Heterogeneous Data.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On a Relation Between the Rate-Distortion Function and Optimal Transport.
Proceedings of the First Tiny Papers Track at ICLR 2023, 2023

2022
Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Age of Information in Random Access Channels.
IEEE Trans. Inf. Theory, 2022

Group Testing with Correlation under Edge-Faulty Graphs.
CoRR, 2022

Robust Graph Neural Networks via Probabilistic Lipschitz Constraints.
Proceedings of the Learning for Dynamics and Control Conference, 2022

Group Testing with Correlation via Edge-Faulty Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Neural Estimation of the Rate-Distortion Function for Massive Datasets.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Optimal Capacity-Constrained COVID-19 Vaccination for Heterogeneous Populations.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021
Out-of-Distribution Robustness in Deep Learning Compression.
CoRR, 2021

Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On the Timeliness of Arithmetic Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Real-time Sampling and Estimation on Random Access Channels: Age of Information and Beyond.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020
Remote Estimation in Decentralized Random Access Channels.
CoRR, 2020

2019
Benefits of Cache Assignment on Degraded Broadcast Channels.
IEEE Trans. Inf. Theory, 2019

Benefits of Coding on Age of Information in Broadcast Networks.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Non-asymptotic Coded Slotted ALOHA.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Improved Converses and Gap Results for Coded Caching.
IEEE Trans. Inf. Theory, 2018

A Rate-Distortion Approach to Caching.
IEEE Trans. Inf. Theory, 2018

Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory.
IEEE Trans. Inf. Theory, 2018

Noisy Broadcast Networks With Receiver Caching.
IEEE Trans. Inf. Theory, 2018

On Universal Compression with Constant Random Access.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks.
Entropy, 2017

Dependence balance in multiple access channels with correlated sources.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Gaussian broadcast channels with receiver cache assignment.
Proceedings of the IEEE International Conference on Communications, 2017

State-adaptive coded caching for symmetric broadcast channels.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
Capacity Results for Multicasting Nested Message Sets Over Combination Networks.
IEEE Trans. Inf. Theory, 2016

Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel.
IEEE Trans. Inf. Theory, 2016

An upper bound on the capacity-memory tradeoff of degraded broadcast channels.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

Erasure broadcast networks with receiver caching.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Capacity regions of two-user broadcast erasure channels with feedback and hidden memory.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Is Non-Unique Decoding Necessary?
IEEE Trans. Inf. Theory, 2014

An application of a wringing lemma to the multiple access channel with cooperative encoders.
Proceedings of the Iran Workshop on Communication and Information Theory, 2014

Capacity bounds for a class of diamond networks.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
A block Markov encoding scheme for broadcasting nested message sets.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Broadcasting and Multicasting Nested Message Sets.
PhD thesis, 2012

Feedback-based coding algorithms for broadcast erasure channels with degraded message sets.
Proceedings of the International Symposium on Network Coding, 2012

On multicasting nested message sets over combination networks.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Is non-unique decoding necessary?
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Degraded two-message multicast over graphs.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2007
Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007


  Loading...