Sledovať
Shirin Saeedi Bidokhti
Shirin Saeedi Bidokhti
Overená e-mailová adresa na: seas.upenn.edu
Názov
Citované v
Citované v
Rok
Non-cooperative multi-radio channel allocation in wireless networks
M Felegyhazi, M Cagalj, SS Bidokhti, JP Hubaux
IEEE INFOCOM 2007-26th IEEE International Conference on Computer …, 2007
2242007
Age of information in random access channels
X Chen, K Gatsis, H Hassani, SS Bidokhti
IEEE Transactions on Information Theory 68 (10), 6548-6568, 2022
1492022
Noisy broadcast networks with receiver caching
SS Bidokhti, M Wigger, R Timo
IEEE Transactions on Information Theory 64 (11), 6996-7016, 2018
1002018
Benefits of Cache Assignment on Degraded Broadcast Channels
S Saeedi Bidokhti, M Wigger, A Yener
IEEE Transactions on Information Theory 65 (11), 6999 - 7019, 2019
612019
Improved converses and gap results for coded caching
CY Wang, SS Bidokhti, M Wigger
IEEE Transactions on Information Theory 64 (11), 7051-7062, 2018
552018
A rate-distortion approach to caching
R Timo, SS Bidokhti, M Wigger, BC Geiger
IEEE transactions on information theory 64 (3), 1957-1976, 2017
482017
Erasure broadcast networks with receiver caching
SS Bidokhti, M Wigger, R Timo
2016 IEEE International Symposium on Information Theory (ISIT), 1819-1823, 2016
382016
Is non-unique decoding necessary?
SS Bidokhti, VM Prabhakaran
IEEE transactions on information theory 60 (5), 2594-2610, 2014
312014
Benefits of coding on age of information in broadcast networks
X Chen, SS Bidokhti
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
302019
Real-time sampling and estimation on random access channels: Age of information and beyond
X Chen, X Liao, SS Bidokhti
IEEE INFOCOM 2021-IEEE Conference on Computer Communications, 1-10, 2021
24*2021
Gaussian broadcast channels with receiver cache assignment
SS Bidokhti, M Wigger, A Yener
2017 IEEE International Conference on Communications (ICC), 1-6, 2017
192017
Capacity bounds for diamond networks with an orthogonal broadcast channel
SS Bidokhti, G Kramer
IEEE Transactions on Information Theory 62 (12), 7103-7122, 2016
192016
Neural estimation of the rate-distortion function for massive datasets
E Lei, H Hassani, SS Bidokhti
2022 IEEE International Symposium on Information Theory (ISIT), 608-613, 2022
18*2022
Robust graph neural networks via probabilistic lipschitz constraints
R Arghal, E Lei, SS Bidokhti
Learning for Dynamics and Control Conference, 1073-1085, 2022
162022
An upper bound on the capacity-memory tradeoff of degraded broadcast channels.
SS Bidokhti, MA Wigger, R Timo
ISTC, 350-354, 2016
162016
On universal compression with constant random access
K Tatwawadi, SS Bidokhti, T Weissman
2018 IEEE International Symposium on Information Theory (ISIT), 891-895, 2018
152018
Capacity results for multicasting nested message sets over combination networks
SS Bidokhti, VM Prabhakaran, SN Diggavi
IEEE Transactions on Information Theory 62 (9), 4968-4992, 2016
132016
Capacity bounds for a class of diamond networks
SB Shirin, G Kramer
2014 IEEE International Symposium on Information Theory, 1196-1200, 2014
132014
Text+ sketch: Image compression at ultra low rates
E Lei, YB Uslu, H Hassani, SS Bidokhti
arXiv preprint arXiv:2307.01944, 2023
122023
Capacity regions of two-receiver broadcast erasure channels with feedback and memory
M Heindlmaier, SS Bidokhti
IEEE Transactions on Information Theory 64 (7), 5042-5069, 2018
122018
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20