default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarhad Shirani Chaharsooghi
Farhad Shirani 0001
Person information
- affiliation: Florida International University, Miami, FL, USA
- affiliation (former): North Dakota State University, Fargo, ND, USA
- affiliation (former): University of Michigan, Ann Arbor, MI, USA
SPARQL queries 
🛈 Please note that only 64% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Farhad Shirani
, S. Sandeep Pradhan:
A Structured Coding Framework for Communication and Computation Over Continuous Networks. IEEE Trans. Inf. Theory 70(3): 1629-1651 (2024)- [c40]Rundong Huang, Farhad Shirani, Dongsheng Luo:
Factorized Explainer for Graph Neural Networks. AAAI 2024: 12626-12634 - [c39]Xu Zheng, Farhad Shirani, Tianchun Wang, Wei Cheng, Zhuomin Chen, Haifeng Chen, Hua Wei, Dongsheng Luo:
Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks. ICLR 2024 - [c38]Zichuan Liu, Tianchun Wang, Jimeng Shi, Xu Zheng, Zhuomin Chen, Lei Song, Wenqian Dong, Jayantha Obeysekera, Farhad Shirani, Dongsheng Luo:
TimeX++: Learning Time-Series Explanations with Information Bottleneck. ICML 2024 - [c37]Marian Temprana Alonso, Farhad Shirani, Neil Irwin Bernardo, Yonina C. Eldar:
Non-Linear Analog Processing Gains in Task-Based Quantization. ISIT 2024: 1889-1894 - [i49]Hojat Allah Salehi, Farhad Shirani, S. Sandeep Pradhan:
Quantum Advantage in Non-Interactive Source Simulation. CoRR abs/2402.00242 (2024) - [i48]Marian Temprana Alonso, Farhad Shirani, Neil Irwin Bernardo, Yonina C. Eldar:
Non-Linear Analog Processing Gains in Task-Based Quantization. CoRR abs/2402.01525 (2024) - [i47]Xu Zheng, Farhad Shirani, Tianchun Wang, Shouwei Gao, Wenqian Dong, Wei Cheng, Dongsheng Luo:
PAC Learnability under Explanation-Preserving Graph Perturbations. CoRR abs/2402.05039 (2024) - [i46]Hojat Allah Salehi, Farhad Shirani:
On Non-Interactive Simulation of Distributed Sources with Finite Alphabets. CoRR abs/2403.00989 (2024) - [i45]Zichuan Liu, Tianchun Wang, Jimeng Shi, Xu Zheng, Zhuomin Chen, Lei Song, Wenqian Dong, Jayantha Obeysekera, Farhad Shirani, Dongsheng Luo:
TimeX++: Learning Time-Series Explanations with Information Bottleneck. CoRR abs/2405.09308 (2024) - [i44]Hojat Allah Salehi, Md. Jueal Mia, S. Sandeep Pradhan, M. Hadi Amini, Farhad Shirani:
CorBin-FL: A Differentially Private Federated Learning Mechanism using Common Randomness. CoRR abs/2409.13133 (2024) - [i43]Xu Zheng, Farhad Shirani, Zhuomin Chen, Chaohao Lin, Wei Cheng, Wenbo Guo, Dongsheng Luo:
F-Fidelity: A Robust Framework for Faithfulness Evaluation of Explainable AI. CoRR abs/2410.02970 (2024) - [i42]Zhuomin Chen, Jingchao Ni, Hojat Allah Salehi, Xu Zheng, Esteban Schafir, Farhad Shirani, Dongsheng Luo:
Explanation-Preserving Augmentation for Semi-Supervised Graph Representation Learning. CoRR abs/2410.12657 (2024) - 2023
- [c36]Mahshad Shariatnasab, Farhad Shirani, S. Sitharama Iyengar:
The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation. ISIT 2023: 1651-1656 - [c35]Farhad Shirani, Mohsen Heidari:
On Non-Interactive Source Simulation via Fourier Transform. ITW 2023: 371-376 - [c34]Marian Temprana Alonso, Farhad Shirani, S. Sitharama Iyengar:
Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms. ITW 2023: 515-520 - [i41]Mahshad Shariatnasab, Farhad Shirani, S. Sitharama Iyengar:
The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation. CoRR abs/2305.07079 (2023) - [i40]Xu Zheng, Farhad Shirani, Tianchun Wang, Wei Cheng, Zhuomin Chen, Haifeng Chen, Hua Wei, Dongsheng Luo:
Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks. CoRR abs/2310.01820 (2023) - [i39]Rundong Huang, Farhad Shirani, Dongsheng Luo:
Factorized Explainer for Graph Neural Networks. CoRR abs/2312.05596 (2023) - 2022
- [j10]Mahshad Shariatnasab, Farhad Shirani, Elza Erkip:
Fundamental Privacy Limits in Bipartite Networks Under Active Attacks. IEEE J. Sel. Areas Commun. 40(3): 940-954 (2022) - [j9]Shahram Shahsavari, Farhad Shirani, Mohammad Ali Khojastepour, Elza Erkip:
Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems. IEEE J. Sel. Areas Commun. 40(5): 1632-1651 (2022) - [j8]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies. IEEE Trans. Commun. 70(3): 1580-1594 (2022) - [c33]Farhad Shirani, Hamidreza Aghasi:
Quantifying the Capacity Gains in Coarsely Quantized SISO Systems with Nonlinear Analog Operators. GLOBECOM (Workshops) 2022: 522-527 - [c32]Farhad Shirani, Hamidreza Aghasi:
MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations. ISIT 2022: 2511-2516 - [c31]Mahshad Shariatnasab, Farhad Shirani, Zahid Anwar:
Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks. ISIT 2022: 2862-2867 - [c30]Farhad Shirani, S. Sandeep Pradhan:
Lattices from Linear Codes: Source and Channel Networks. ISIT 2022: 3238-3243 - [i38]Farhad Shirani, Hamidreza Aghasi:
MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations. CoRR abs/2202.02860 (2022) - [i37]Mahshad Shariatnasab, Farhad Shirani, Zahid Anwar:
Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks. CoRR abs/2202.05895 (2022) - [i36]Farhad Shirani, S. Sandeep Pradhan:
Lattices from Linear Codes: Source and Channel Networks. CoRR abs/2202.11238 (2022) - [i35]Farhad Shirani, Hamidreza Aghasi:
Quantifying the Capacity Gains in Coarsely Quantized SISO Systems with Nonlinear Analog Operators. CoRR abs/2208.04450 (2022) - [i34]Marian Temprana Alonso, Farhad Shirani, S. Sitharama Iyengar:
Optimal Distributed Fault-Tolerant Sensor Fusion: Fundamental Limits and Efficient Algorithms. CoRR abs/2210.04156 (2022) - [i33]Marian Temprana Alonso, Xuyang Liu, Farhad Shirani, Hamidreza Aghasi:
Capacity Gains in MIMO Systems with Few-Bit ADCs Using Nonlinear Analog Operators. CoRR abs/2212.05948 (2022) - [i32]Farhad Shirani, Mohsen Heidari:
On Non-Interactive Source Simulation via Fourier Transform. CoRR abs/2212.09239 (2022) - 2021
- [j7]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Correlated Graph Matching. IEEE J. Sel. Areas Inf. Theory 2(1): 338-351 (2021) - [j6]Farhad Shirani, S. Sandeep Pradhan:
A New Achievable Rate-Distortion Region for Distributed Source Coding. IEEE Trans. Inf. Theory 67(7): 4485-4503 (2021) - [c29]Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip:
On Graph Matching Using Generalized Seed Side-Information. ISIT 2021: 2726-2731 - [i31]Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip:
On Graph Matching Using Generalized Seed Side-Information. CoRR abs/2102.06267 (2021) - [i30]Mahshad Shariatnasab, Farhad Shirani, Elza Erkip:
Fundamental Privacy Limits in Bipartite Networks under Active Attacks. CoRR abs/2106.04766 (2021) - [i29]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
MIMO Networks with One-Bit ADCs: Receiver Design and Communication Strategies. CoRR abs/2112.02128 (2021) - 2020
- [j5]S. Sandeep Pradhan, Arun Padakandla, Farhad Shirani:
An Algebraic and Probabilistic Framework for Network Information Theory. Found. Trends Commun. Inf. Theory 18(2): 173-379 (2020) - [c28]Abbas Khalili, Shahram Shahsavari, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
On Throughput of Millimeter Wave MIMO Systems with Low Resolution ADCs. ICASSP 2020: 5255-5259 - [i28]Farhad Shirani, Siddharth Garg, Elza Erkip:
On the Joint Typicality of Permutations of Sequences of Random Variables. CoRR abs/2001.06962 (2020) - [i27]Abbas Khalili, Shahram Shahsavari, Farhad Shirani Chaharsooghi, Elza Erkip, Yonina C. Eldar:
On Throughput of Millimeter Wave MIMO Systems with Low Resolution ADCs. CoRR abs/2002.04221 (2020) - [i26]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Correlated Graph Matching. CoRR abs/2009.00467 (2020)
2010 – 2019
- 2019
- [j4]Shahram Shahsavari, Farhad Shirani, Elza Erkip:
A General Framework for Temporal Fair User Scheduling in NOMA Systems. IEEE J. Sel. Top. Signal Process. 13(3): 408-422 (2019) - [j3]Farhad Shirani, S. Sandeep Pradhan:
On the Sub-Optimality of Single-Letter Coding Over Networks. IEEE Trans. Inf. Theory 65(10): 6115-6135 (2019) - [j2]Mohsen Heidari, Farhad Shirani, S. Sandeep Pradhan:
Quasi Structured Codes for Multi-Terminal Communications. IEEE Trans. Inf. Theory 65(10): 6263-6289 (2019) - [c27]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems. ISIT 2019: 597-601 - [c26]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers. ISIT 2019: 602-606 - [c25]Shahram Shahsavari, Farhad Shirani, Elza Erkip:
On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints. ISIT 2019: 2534-2538 - [c24]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Database De-anonymization. ISIT 2019: 2748-2752 - [c23]Shahram Shahsavari, Farhad Shirani, Mohammad Ali Amir Khojastepour, Elza Erkip:
Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems. PIMRC Workshops 2019: 1-7 - [i25]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Database De-anonymization. CoRR abs/1901.07655 (2019) - [i24]Shahram Shahsavari, Farhad Shirani, Elza Erkip:
On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints. CoRR abs/1901.07719 (2019) - [i23]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems. CoRR abs/1901.09844 (2019) - [i22]Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers. CoRR abs/1901.10628 (2019) - [i21]Shahram Shahsavari, Farhad Shirani, Mohammad Ali Amir Khojastepour, Elza Erkip:
Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems. CoRR abs/1905.08992 (2019) - [i20]Farhad Shirani, S. Sandeep Pradhan:
A New Achievable Rate-Distortion Region for Distributed Source Coding. CoRR abs/1906.08810 (2019) - 2018
- [j1]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes. IEEE Trans. Inf. Theory 64(5): 3781-3809 (2018) - [c22]Shahram Shahsavari, Farhad Shirani, Elza Erkip:
Opportunistic Temporal Fair Scheduling for Non-Orthogonal Multiple Access. Allerton 2018: 391-398 - [c21]Farhad Shirani, Siddharth Garg, Elza Erkip:
Matching Graphs with Community Structure: A Concentration of Measure Approach. Allerton 2018: 1028-1035 - [c20]Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. ISIT 2018: 221-225 - [c19]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. ISIT 2018: 1126-1130 - [c18]Farhad Shirani, Siddharth Garg, Elza Erkip:
Optimal Active social Network De-anonymization Using Information Thresholds. ISIT 2018: 1445-1449 - [c17]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels. ISIT 2018: 2356-2360 - [i19]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. CoRR abs/1801.05294 (2018) - [i18]Farhad Shirani, Siddharth Garg, Elza Erkip:
Optimal Active Social Network De-anonymization Using Information Thresholds. CoRR abs/1801.06498 (2018) - [i17]Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. CoRR abs/1802.00918 (2018) - [i16]Farhad Shirani, Siddharth Garg, Elza Erkip:
Matching Graphs with Community Structure: A Concentration of Measure Approach. CoRR abs/1810.13347 (2018) - 2017
- [c16]Farhad Shirani, Siddharth Garg, Elza Erkip:
Seeded graph matching: Efficient algorithms and theoretical guarantees. ACSSC 2017: 253-257 - [c15]Farhad Shirani, Siddharth Garg, Elza Erkip:
An information theoretic framework for active de-anonymization in social networks based on group memberships. Allerton 2017: 470-477 - [c14]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A new achievable rate region for multiple-access channel with states. ISIT 2017: 36-40 - [c13]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the correlation between Boolean functions of sequences of random variables. ISIT 2017: 1301-1305 - [c12]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the sub-optimality of single-letter coding in multi-terminal communications. ISIT 2017: 1823-1827 - [c11]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the necessity of structured codes for communications over MAC with feedback. ISIT 2017: 2298-2302 - [i15]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Correlation between Boolean Functions of Sequences of Random Variables. CoRR abs/1702.01353 (2017) - [i14]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Sub-optimality of Single-letter Coding in Multi-terminal Communications. CoRR abs/1702.01376 (2017) - [i13]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A New Achievable Rate Region for Multiple-Access Channel with States. CoRR abs/1702.02330 (2017) - [i12]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Necessity of Structured Codes for Communications over MAC with Feedback. CoRR abs/1702.05544 (2017) - [i11]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Sub-optimality of Single-Letter Coding over Networks. CoRR abs/1705.00410 (2017) - [i10]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
How to Compute Modulo Prime-Power Sums ? CoRR abs/1708.00665 (2017) - [i9]Farhad Shirani, Siddharth Garg, Elza Erkip:
An Information Theoretic Framework for Active De-anonymization in Social Networks Based on Group Memberships. CoRR abs/1710.04163 (2017) - [i8]Farhad Shirani, Siddharth Garg, Elza Erkip:
Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees. CoRR abs/1711.10360 (2017) - 2016
- [c10]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to point-to-point and multi-terminal source coding. ISIT 2016: 730-734 - [c9]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New sufficient conditions for Multiple-Access Channel with correlated sources. ISIT 2016: 2019-2023 - [c8]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Trade-off between communication and cooperation in the Interference Channel. ISIT 2016: 2214-2218 - [i7]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes. CoRR abs/1602.01911 (2016) - [i6]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding. CoRR abs/1602.04521 (2016) - [i5]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Trade-off between Communication and Cooperation in the Interference Channel. CoRR abs/1602.05287 (2016) - [i4]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New Sufficient Conditions for Multiple-Access Channel with Correlated Sources. CoRR abs/1603.05274 (2016) - 2015
- [c7]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
New lattice codes for multiple-descriptions. ISIT 2015: 1580-1584 - [c6]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Beyond group capacity in multi-terminal communications. ISIT 2015: 2081-2085 - 2014
- [c5]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An achievable rate-distortion region for the multiple descriptions problem. ISIT 2014: 576-580 - [c4]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Finite block-length gains in distributed source coding. ISIT 2014: 1702-1706 - [i3]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem. CoRR abs/1402.2032 (2014) - 2013
- [c3]Farhad Shirani Chaharsooghi, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Distributed source coding in absence of common components. ISIT 2013: 1362-1366 - 2011
- [c2]Farhad Shirani Chaharsooghi, Mohammad Javad Emadi, Mahdi Zamanighomi, Mohammad Reza Aref:
A new method for variable elimination in systems of inequations. ISIT 2011: 1215-1219 - [c1]Mahdi Zamanighomi, Mohammad Javad Emadi, Farhad Shirani Chaharsooghi, Mohammad Reza Aref:
Multiple access channel with correlated channel states and cooperating encoders. ITW 2011: 628-632 - [i2]Mahdi Zamanighomi, Mohammad Javad Emadi, Farhad Shirani Chaharsooghi, Mohammad Reza Aref:
Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders. CoRR abs/1102.1165 (2011) - [i1]Farhad Shirani Chaharsooghi, Mohammad Javad Emadi, Mahdi Zamanighomi, Mohammad Reza Aref:
A New Method for Variable Elimination in Systems of Inequations. CoRR abs/1102.2602 (2011)
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-11-25 22:46 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:
