Farhad Shirani Chaharsooghi
Farhad Shirani Chaharsooghi
Assistant Professor
Verified email at ndsu.edu - Homepage
Title
Cited by
Cited by
Year
Seeded graph matching: Efficient algorithms and theoretical guarantees
F Shirani, S Garg, E Erkip
2017 51st Asilomar Conference on Signals, Systems, and Computers, 253-257, 2017
262017
Distributed source coding in absence of common components
FS Chaharsooghi, AG Sahebi, SS Pradhan
2013 IEEE International Symposium on Information Theory, 1362-1366, 2013
172013
Finite block-length gains in distributed source coding
F Shirani, SS Pradhan
2014 IEEE International Symposium on Information Theory, 1702-1706, 2014
152014
A general framework for temporal fair user scheduling in NOMA systems
S Shahsavari, F Shirani, E Erkip
IEEE Journal of Selected Topics in Signal Processing 13 (3), 408-422, 2019
132019
Typicality matching for pairs of correlated graphs
F Shirani, S Garg, E Erkip
2018 IEEE International Symposium on Information Theory (ISIT), 221-225, 2018
122018
A new method for variable elimination in systems of inequations
FS Chaharsooghi, MJ Emadi, M Zamanighomi, MR Aref
2011 IEEE International Symposium on Information Theory Proceedings, 1215-1219, 2011
102011
An achievable rate-distortion region for multiple descriptions source coding based on coset codes
F Shirani, SS Pradhan
IEEE Transactions on Information Theory 64 (5), 3781-3809, 2018
92018
An information theoretic framework for active de-anonymization in social networks based on group memberships
F Shirani, S Garg, E Erkip
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
92017
A concentration of measure approach to database de-anonymization
F Shirani, S Garg, E Erkip
2019 IEEE International Symposium on Information Theory (ISIT), 2748-2752, 2019
82019
Multiple access channel with correlated channel states and cooperating encoders
M Zamanighomi, MJ Emadi, FS Chaharsooghi, MR Aref
2011 IEEE Information Theory Workshop, 628-632, 2011
8*2011
Matching graphs with community structure: A concentration of measure approach
F Shirani, S Garg, E Erkip
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
72018
Optimal active social network de-anonymization using information thresholds
F Shirani, S Garg, E Erkip
2018 IEEE International Symposium on Information Theory (ISIT), 1445-1449, 2018
72018
New sufficient conditions for Multiple-Access Channel with correlated sources
M Heidari, F Shirani, SS Pradhan
2016 IEEE International Symposium on Information Theory (ISIT), 2019-2023, 2016
72016
An achievable rate-distortion region for the multiple descriptions problem
F Shirani, SS Pradhan
2014 IEEE International Symposium on Information Theory, 576-580, 2014
72014
Opportunistic temporal fair scheduling for non-orthogonal multiple access
S Shahsavari, F Shirani, E Erkip
2018 56th Annual Allerton conference on communication, control, and …, 2018
62018
On multiterminal communication over MIMO channels with one-bit ADCs at the receivers
A Khalili, F Shirani, E Erkip, YC Eldar
2019 IEEE International Symposium on Information Theory (ISIT), 602-606, 2019
52019
Quasi Linear Codes: Application to point-to-point and multi-terminal source coding
F Shirani, M Heidari, SS Pradhan
2016 IEEE International Symposium on Information Theory (ISIT), 730-734, 2016
52016
New lattice codes for multiple-descriptions
F Shirani, M Heidari, SS Pradhan
2015 IEEE International Symposium on Information Theory (ISIT), 1580-1584, 2015
52015
On the fundamental limits of multi-user scheduling under short-term fairness constraints
S Shahsavari, F Shirani, E Erkip
2019 IEEE international symposium on information theory (ISIT), 2534-2538, 2019
42019
On the necessity of structured codes for communications over MAC with feedback
M Heidari, F Shirani, SS Pradhan
2017 IEEE International Symposium on Information Theory (ISIT), 2298-2302, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20