Farhad Shirani Chaharsooghi

Orcid: 0000-0003-1316-3899

Affiliations:
  • Florida International University, Miami, FL, USA
  • North Dakota State University, Fargo, ND, USA (former)
  • University of Michigan, Ann Arbor, MI, USA (former)


According to our database1, Farhad Shirani Chaharsooghi authored at least 57 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Structured Coding Framework for Communication and Computation Over Continuous Networks.
IEEE Trans. Inf. Theory, 2024

On Non-Interactive Simulation of Distributed Sources with Finite Alphabets.
CoRR, 2024

PAC Learnability under Explanation-Preserving Graph Perturbations.
CoRR, 2024

Non-Linear Analog Processing Gains in Task-Based Quantization.
CoRR, 2024

Quantum Advantage in Non-Interactive Source Simulation.
CoRR, 2024

Factorized Explainer for Graph Neural Networks.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks.
CoRR, 2023

On Non-Interactive Source Simulation via Fourier Transform.
Proceedings of the IEEE Information Theory Workshop, 2023

Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms.
Proceedings of the IEEE Information Theory Workshop, 2023

The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies.
IEEE Trans. Commun., 2022

Fundamental Privacy Limits in Bipartite Networks Under Active Attacks.
IEEE J. Sel. Areas Commun., 2022

Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems.
IEEE J. Sel. Areas Commun., 2022

Capacity Gains in MIMO Systems with Few-Bit ADCs Using Nonlinear Analog Operators.
CoRR, 2022

Optimal Distributed Fault-Tolerant Sensor Fusion: Fundamental Limits and Efficient Algorithms.
CoRR, 2022

Lattices from Linear Codes: Source and Channel Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2022

MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Quantifying the Capacity Gains in Coarsely Quantized SISO Systems with Nonlinear Analog Operators.
Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021
A New Achievable Rate-Distortion Region for Distributed Source Coding.
IEEE Trans. Inf. Theory, 2021

A Concentration of Measure Approach to Correlated Graph Matching.
IEEE J. Sel. Areas Inf. Theory, 2021

On Graph Matching Using Generalized Seed Side-Information.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
An Algebraic and Probabilistic Framework for Network Information Theory.
Found. Trends Commun. Inf. Theory, 2020

On the Joint Typicality of Permutations of Sequences of Random Variables.
CoRR, 2020

On Throughput of Millimeter Wave MIMO Systems with Low Resolution ADCs.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Quasi Structured Codes for Multi-Terminal Communications.
IEEE Trans. Inf. Theory, 2019

On the Sub-Optimality of Single-Letter Coding Over Networks.
IEEE Trans. Inf. Theory, 2019

A General Framework for Temporal Fair User Scheduling in NOMA Systems.
IEEE J. Sel. Top. Signal Process., 2019

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Concentration of Measure Approach to Database De-anonymization.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes.
IEEE Trans. Inf. Theory, 2018

Optimal Active social Network De-anonymization Using Information Thresholds.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Typicality Matching for Pairs of Correlated Graphs.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Matching Graphs with Community Structure: A Concentration of Measure Approach.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Opportunistic Temporal Fair Scheduling for Non-Orthogonal Multiple Access.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
How to Compute Modulo Prime-Power Sums ?
CoRR, 2017

On the necessity of structured codes for communications over MAC with feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A new achievable rate region for multiple-access channel with states.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the sub-optimality of single-letter coding in multi-terminal communications.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the correlation between Boolean functions of sequences of random variables.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

An information theoretic framework for active de-anonymization in social networks based on group memberships.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Seeded graph matching: Efficient algorithms and theoretical guarantees.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
New sufficient conditions for Multiple-Access Channel with correlated sources.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Trade-off between communication and cooperation in the Interference Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Quasi Linear Codes: Application to point-to-point and multi-terminal source coding.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Beyond group capacity in multi-terminal communications.
Proceedings of the IEEE International Symposium on Information Theory, 2015

New lattice codes for multiple-descriptions.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Finite block-length gains in distributed source coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An achievable rate-distortion region for the multiple descriptions problem.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Distributed source coding in absence of common components.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders
CoRR, 2011

Multiple access channel with correlated channel states and cooperating encoders.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A new method for variable elimination in systems of inequations.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011


  Loading...